Search Results for author:
Found 3 papers, 0 papers with code
A Compositional Algorithm for the Conflict-Free Electric Vehicle Routing Problem
The CF-EVRP involves constraints such as time windows on the delivery to the customers, limited operating range of the vehicles, and limited capacity on the number of vehicles that a road segment can accommodate at the same time.
An SMT Based Compositional Algorithm to Solve a Conflict-Free Electric Vehicle Routing Problem
The Vehicle Routing Problem (VRP) is the combinatorial optimization problem of designing routes for vehicles to visit customers in such a fashion that a cost function, typically the number of vehicles, or the total travelled distance is minimized.
Leveraging Conflicting Constraints in Solving Vehicle Routing Problems
The Conflict-Free Electric Vehicle Routing Problem (CF-EVRP) is a combinatorial optimization problem of designing routes for vehicles to visit customers such that a cost function, typically the number of vehicles or the total travelled distance, is minimized.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
