A Compositional Algorithm for the Conflict-Free Electric Vehicle Routing Problem
Journal article, 2022

The Conflict-Free Electric Vehicle Routing Problem (CF-EVRP) is an extension of the Vehicle Routing Problem (VRP), 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. The problem finds many logistics applications, particularly for highly automated logistic systems for material handling. 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. In this paper, the compositional algorithm ComSat for solving the CF-EVRP is presented. The algorithm iterates through the sub-problems until a globally feasible solution is found. The proposed algorithm is implemented using an optimizing SMT-solver and is evaluated against an implementation of a previously presented monolithic model. The soundness and completeness of the algorithm are proven, and it is benchmarked on a set of generated problems and found to be able to solve problems of industrial size.

Job shop scheduling

Schedules

Time factors

Routing

vehicle routing

Vehicle routing

Roads

Optimization

scheduling

Electric vehicles

Author

Sabino Francesco Roselli

Chalmers, Electrical Engineering, Systems and control

Per Lage Götvall

Volvo Group

Martin Fabian

Chalmers, Electrical Engineering, Systems and control

Knut Åkesson

Chalmers, Electrical Engineering, Systems and control

IEEE Transactions on Automation Science and Engineering

1545-5955 (ISSN) 15583783 (eISSN)

Vol. 19 3 1405-1421

Subject Categories

Computational Mathematics

Transport Systems and Logistics

Control Engineering

DOI

10.1109/TASE.2022.3169949

More information

Latest update

3/7/2024 9