Acceleration Techniques for Vehicle Routing Heuristics
Abstract
The Vehicle Routing Problem (VRP) is one of the most studied combinatorial optimization problems which plays a central role in logistics and transportation (see Toth and Vigo, 2002 more than fifty years literally hundreds of heuristic optimization algorithms were proposed for the solution of the VRP and its many variants. The application of such approaches in highly demanding real-world contexts, such as those of intermodal logistics for freight distribution or those in military operations, require a very high computational efficiency of the methods to cope with demand-responsiveness and tight execution time constraints. We propose to develop advanced acceleration techniques that have a wide applicability in the VRP and its main variants and permit to achieve speedups of at least one order of magnitude with respect to current implementations.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 06, 2024
- Accession Number
- AD1228236
Entities
People
- Daniele Vigo
Organizations
- University of Bologna