Article ID: | iaor20023249 |
Country: | Netherlands |
Volume: | 8 |
Issue: | 3 |
Start Page Number: | 251 |
End Page Number: | 276 |
Publication Date: | May 2002 |
Journal: | Journal of Heuristics |
Authors: | Homberger Jrg, Gehring Hermann |
This paper describes the parallelization of a two-phase metaheuristic for the vehicle routing problem with time windows and a central depot. The underlying objective function combines the minimization of the number of vehicles in the first search phase of the metaheuristic with the minimization of the total travel distance in the second search phase. The parallelization of the metaheuristic follows a type 3 parallelization strategy, i.e. several concurrent searches of the solution space are carried out with a differently configured metaheuristic. The concurrently executed processes cooperate through the exchange of solutions. The parallelized two-phase metaheuristic was subjected to a comparative test on the basis of 358 problems from the literature with sizes varying from 100 to 1000 customers. The derived results seem to justify the proposed parallelization concept.