articleTop 1% cited
A unified tabu search heuristic for vehicle routing problems with time windows
Journal of the Operational Research Society · 2001 · Vol. 52(8) · pp. 928–936
Abstract
Abstract This paper presents 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 time windows. The major benefits of the approach are its speed, simplicity and flexibility. The performance of the heuristic is assessed by comparing it to alternative methods on benchmark instances of the vehicle routing problem with time windows. Computational experiments are also reported on new randomly generated instances for each of the two generalizations.
Vehicle Routing Optimization MethodsRobotic Path Planning AlgorithmsTransportation and Mobility InnovationsTabu searchVehicle routing problemComputer scienceScheduling (production processes)Operations researchMathematical optimizationProject managementHeuristicsHeuristicRouting (electronic design automation)
Citations
885
FWCI
42.65
field-weighted impact
References
29
Percentile
100%
vs. same field & year
Citations per year
Cited by
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
Operations Research · 2012 · 670 citations
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications · 2013 · 841 citations
References
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Operations Research · 1987 · 4,119 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.