A tabu search heuristic for periodic and multi‐depot vehicle routing problems
NetworksPublished 1 September 1997
Jean‐François Cordeau, Michel Gendreau, Gilbert Laporte
Citations59
SJR quartileQ1
SJR score0.87
SNIP1.24
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
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, 1997
Keywords
Engineering