Heuristics for vehicle routing problems: sequence or set optimization?
From MaRDI portal
Abstract: We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based on vehicle-to-customer "assignment" and visits "sequencing" decision variables. We show that an heuristic search focused on assignment decisions with a systematic optimal choice of sequences (using Concorde TSP solver) during each move evaluation is promising but requires a prohibitive computational effort. We therefore introduce an intermediate search space, based on the dynamic programming procedure of Balas & Simonetti, which finds a good compromise between intensification and computational efficiency. A variety of speed-up techniques are proposed for a fast exploration: neighborhood reductions, dynamic move filters, memory structures, and concatenation techniques. Finally, a tunneling strategy is designed to reshape the search space as the algorithm progresses. The combination of these techniques within a classical local search, as well as in the unified hybrid genetic search (UHGS) leads to significant improvements of solution accuracy. New best solutions are found for surprisingly small instances with as few as 256 customers. These solutions had not been attained up to now with classic neighborhoods. Overall, this research permits to better evaluate the respective impact of sequence and assignment optimization, proposes new ways of combining the optimization of these two decision sets, and opens promising research perspectives for the CVRP and its variants.
Recommendations
- Heuristic procedures for the capacitated vehicle routing problem
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- scientific article; zbMATH DE number 1082107
- A general heuristic for vehicle routing problems
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A hybrid algorithm for a class of vehicle routing problems
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- A survey of very large-scale neighborhood search techniques
- A unified solution framework for multi-attribute vehicle routing problems
- An Improved Petal Heuristic for the Vehicle Routeing Problem
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems
- Handbook of metaheuristics
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Hybrid metaheuristics for the clustered vehicle routing problem
- Large multiple neighborhood search for the clustered vehicle-routing problem
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- New benchmark instances for the capacitated vehicle routing problem
- Node, edge, arc routing and turn penalties: multiple problems -- one neighborhood extension
- Solution of real-world postman problems
- The granular tabu search and its application to the vehicle-routing problem
- The vehicle routing problem with service level constraints
- Timing problems and algorithms: time decisions for sequences of activities
- Upper bounds on ATSP neighborhood size.
- Vehicle Routing
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
Cited in
(6)- Fairer comparisons for travelling salesman problem solutions using hash functions
- A simple and effective hybrid genetic search for the job sequencing and tool switching problem
- A concise guide to existing and emerging vehicle routing problem variants
- Decomposition Strategies for Vehicle Routing Heuristics
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- An improved hybrid genetic search with data mining for the CVRP
This page was built for publication: Heuristics for vehicle routing problems: sequence or set optimization?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1722969)
