A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
Set-covering-based algorithms for the capacitated VRP
The vehicle routing problem
Very large-scale vehicle routing: new test problems, algorithms, and results
Computers and Operations Research
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
Computers and Operations Research
A general heuristic for vehicle routing problems
Computers and Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems
Computers and Operations Research
Cellular Genetic Algorithms
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
Networks - Route 2007
Efficient local search limitation strategies for vehicle routing problems
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
A parallel iterated tabu search heuristic for vehicle routing problems
Computers and Operations Research
A cooperative parallel metaheuristic for the capacitated vehicle routing problem
Computers and Operations Research
Hi-index | 0.00 |
The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. We develop a parallel algorithm for the VRP that combines a heuristic local search improvement procedure with integer programming. We run our parallel algorithm with as many as 129 processors and are able to quickly find high-quality solutions to standard benchmark problems. We assess the impact of parallelism by analyzing our procedure's performance under a number of different scenarios.