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. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Błocho, M., & Czech, Z. J. (2012). A parallel algorithm for minimizing the number of routes in the vehicle routing problem with time windows. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7203 LNCS, pp. 255–265). https://doi.org/10.1007/978-3-642-31464-3_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
