A parallel algorithm for minimizing the number of routes in the vehicle routing problem with time windows

Authors:
Mirosław Błocho;Zbigniew J. Czech
Affiliations:
Silesia University of Technology, Gliwice, Poland, ABB ISDC, Krakow, Poland;Silesia University of Technology, Gliwice, Poland, Silesia University, Sosnowiec, Poland
Venue:
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Year:
2011

Citing 9
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Cyclic transfer algorithms for multivehicle routing and scheduling problems

Operations Research
The vehicle routing problem

The vehicle routing problem
Heuristics for Large Constrained Vehicle Routing Problems

Journal of Heuristics
A Hybrid Genetic Algorithm For The Vehicle Routing Problem With Time Windows

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows

INFORMS Journal on Computing
Implementing a parallel simulated annealing algorithm

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
A powerful route minimization heuristic for the vehicle routing problem with time windows

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A parallel algorithm for minimizing the number of routes in the vehicle routing problem with time windows (VRPTW) is presented. The algorithm components cooperate periodically by exchanging their best solutions with the lowest number of routes found to date. The objective of the work is to analyze speedup, achieved accuracy of solutions and scalability of the MPI implementation. For comparisons the selected VRPTW tests are used. The derived results justify the proposed parallelization concept. By making use of the parallel algorithm the twelve new best-known solutions for Gehring and Homberger's benchmarking tests were found.