A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions
American Journal of Mathematical and Management Sciences - Special issue: vehicle routing 2000: advances in time windows, optimality, fast bounds, & multi-depot routing
A tabu search heuristic for the multi-depot vehicle routing problem
Computers and Operations Research
The vehicle routing problem
A general heuristic for vehicle routing problems
Computers and Operations Research
Active guided evolution strategies for large-scale vehicle routing problems with time windows
Computers and Operations Research
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Transportation Science
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
Computers and Operations Research
Fifty Years of Vehicle Routing
Transportation Science
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
Networks - Route 2007
A parallel iterated tabu search heuristic for vehicle routing problems
Computers and Operations Research
Hi-index | 0.02 |
We introduce a parallel iterated tabu search heuristic for solving eight different variants of the vehicle routing problem. Through extensive computational results we show that the proposed heuristic is both general and competitive with specific heuristics designed for each problem type.