New insertion and postoptimization procedures for the traveling salesman problem
Operations Research
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
Cyclic transfer algorithms for multivehicle routing and scheduling problems
Operations Research
Ejection chains, reference structures and alternating path methods for traveling salesman problems
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
A Subpath Ejection Method for the Vehicle Routing Problem
Management Science
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
Record breaking optimization results using the ruin and recreate principle
Journal of Computational Physics
The vehicle routing problem
An overview of vehicle routing problems
The vehicle routing problem
Branch-and-bound algorithms for the capacitated VRP
The vehicle routing problem
The vehicle routing problem
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Tabu Search
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
A Heuristic for the Vehicle Routing Problem with Time Windows
Journal of Heuristics
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
The Shortest Path Problem with Time Windows and Linear Waiting Costs
Transportation Science
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
INFORMS Journal on Computing
A Multilevel Approach to the Travelling Salesman Problem
Operations Research
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
INFORMS Journal on Computing
Sequential search and its application to vehicle-routing problems
Computers and Operations Research
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Transportation Science
Review: Industrial aspects and literature survey: Fleet composition and routing
Computers and Operations Research
Vehicle routing under time-dependent travel times: The impact of congestion avoidance
Computers and Operations Research
Restricted dynamic programming: A flexible framework for solving realistic VRPs
Computers and Operations Research
Optimizing local pickup and delivery with uncertain loads
Proceedings of the Winter Simulation Conference
Hi-index | 0.00 |
Local search and local search-based metaheuristics are currently the only available methods for obtaining good solutions to large vehicle routing and scheduling problems. In this paper we provide a review of both classical and modern local search neighborhoods for this class of problems. The intention of this paper is not only to give an overview but to classify and analyze the structure of different neighborhoods. The analysis is based on a formal representation of VRSP solutions given by a unifying giant-tour model. We describe neighborhoods implicitly by a set of transformations called moves and show how moves can be decomposed further into partial moves. The search method has to compose these partial moves into a complete move in an efficient way. The goal is to find a local best neighbor and to reach a local optimum as quickly as possible. This can be achieved by search methods, which do not scan all neighbor solutions explicitly. Our analysis shows how the properties of the partial moves and the constraints of the VRSP influences the choice of an appropriate search technique.