Leveraging Conflicting Constraints in Solving Vehicle Routing Problems
Sabino Francesco Roselli, Remco Vader, Martin Fabian, Knut, Akesson

TL;DR
This paper improves the PathsChanger algorithm for the Conflict-Free Electric Vehicle Routing Problem by using unsatisfiable core information, leading to faster convergence in solving complex routing constraints.
Contribution
It introduces an enhanced PathsChanger method that leverages conflict information to efficiently solve the Path Changing Problem in vehicle routing.
Findings
Faster convergence to feasible solutions with the new PathsChanger.
Reduced computational time in solving CF-EVRP instances.
Demonstrated effectiveness on benchmark problems.
Abstract
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. 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 simultaneously accommodate. In previous work, the compositional algorithm ComSat was introduced and that solves the CF-EVRP by breaking it down into sub-problems and iteratively solve them to build an overall solution. Though ComSat showed good performance in general, some problems took significant time to solve due to the high number of iterations required to find solutions that satisfy the road segments' capacity constraints. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVehicle Routing Optimization Methods · Transportation and Mobility Innovations · Transportation Planning and Optimization
