Journal ArticleDOI
A tabu search heuristic for periodic and multi-depot vehicle routing problems
TLDR
In this article, a tabu search heuristic was proposed for solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing problems.Abstract:
We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing problem. Computational experiments carried out on instances taken from the literature indicate that the proposed method outperforms existing heuristics for all three problems. © 1997 John Wiley & Sons, Inc. Networks 30: 105–119, 1997read more
Citations
More filters
Book
Tabu Search
Fred Glover,Manuel Laguna +1 more
TL;DR: This book explores the meta-heuristics approach called tabu search, which is dramatically changing the authors' ability to solve a host of problems that stretch over the realms of resource planning, telecommunications, VLSI design, financial analysis, scheduling, spaceplanning, energy distribution, molecular engineering, logistics, pattern classification, flexible manufacturing, waste management,mineral exploration, biomedical analysis, environmental conservation and scores of other problems.
Journal ArticleDOI
A general heuristic for vehicle routing problems
David Pisinger,Stefan Ropke +1 more
TL;DR: A unified heuristic which is able to solve five different variants of the vehicle routing problem and shown promising results for a large class of vehicle routing problems with backhauls as demonstrated in Ropke and Pisinger.
Journal ArticleDOI
The orienteering problem: A survey
TL;DR: The OP is formally described and many relevant variants are presented and all published exact solution approaches and (meta) heuristics are discussed and compared.
BookDOI
Genetic and Evolutionary Computation -- GECCO-2003
Erick Cantú-Paz,James A. Foster,Kalyanmoy Deb,Lawrence Davis,Rajkumar Roy,Una-May O'Reilly,Hans-Georg Beyer,Russell Standish,Graham Kendall,Stewart W. Wilson,Mark Harman,Joachim Wegener,Dipankar Dasgupta,Mitch A. Potter,Alan C. Schultz,Kathryn A. Dowsland,Natasha Jonoska,Julian F. Miller +17 more
TL;DR: This work extends the application of CPSO to the dynamic problem by considering a bi-modal parabolic environment of high spatial and temporal severity, and suggests that charged swarms perform best in the extreme cases, but neutral swarms are better optimizers in milder environments.
Journal ArticleDOI
A unified tabu search heuristic for vehicle routing problems with time windows
TL;DR: A unified tabu search heuristic for the vehicle routing problem with time windows and for two important generalizations: the periodic and the multi-depot vehicle routing problems with timewindows is presented.
References
More filters
Journal ArticleDOI
The vehicle routing problem: An overview of exact and approximate algorithms
TL;DR: In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed.
Related Papers (5)
Algorithms for the vehicle routing and scheduling problems with time window constraints
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
G. Clarke,J. W. Wright +1 more