@inproceedings{8ea39c37244b4d0d8514cf96a3d6a796,
title = "A parallel algorithm for minimizing the number of routes in the vehicle routing problem with time windows",
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.",
keywords = "MPI library, approximation algorithms, guided local search, heuristics, parallel algorithm, vehicle routing problem with time windows",
author = "Miros{\l}aw B{\l}ocho and Czech, \{Zbigniew J.\}",
year = "2012",
doi = "10.1007/978-3-642-31464-3\_26",
language = "English",
isbn = "9783642314636",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 1",
pages = "255--265",
booktitle = "Parallel Processing and Applied Mathematics - 9th International Conference, PPAM 2011, Revised Selected Papers",
edition = "PART 1",
note = "9th International Conference on Parallel Processing and Applied Mathematics, PPAM 2011 ; Conference date: 11-09-2011 Through 14-09-2011",
}