Solving Vehicle Routing and Scheduling with Delivery and Installation of Machines using ILS

Abstract

We propose a new method based on iterated local search to solve a Vehicle Routing and Scheduling problem that was recently introduced in the VeRoLog Solver Challenge 2019. Our algorithm includes several neigh- borhood search operators and destroy/repair heuristics. We propose two new neighborhood operators aiming to address con icts between requests and trips for better allocation on days, vehicles and routes. Our algorithm was one of the competitors of the VeRoLog Solver Challenge where 13 di erent teams participated by submitting solutions for the instances from the all-time-best challenge. Results on twenty- ve instances presented by the organizer of the challenge show that our approach provided second best result for one of the instances, for six instances third best and for most of the rest fourth best result.