Solving routing problems with pairwise synchronization constraints |
| |
Authors: | Parragh Sophie N. Doerner Karl F. |
| |
Affiliation: | 1.Production and Logistics Management, Johannes Kepler University Linz, Altenberger Strasse 69, 4040, Linz, Austria ;2.Faculty of Business, Economics and Statistics, University of Vienna, Oskar-Morgenstern-Platz 1, 1090, Vienna, Austria ; |
| |
Abstract: | Pairwise route synchronization constraints are commonly encountered in the field of service technician routing and scheduling and in the area of mobile care. Pairwise route synchronization refers to constraints that require that two technicians or home care workers visit the same location at exactly the same time. We consider constraints of this type in the context of the well-known vehicle routing problem with time windows and a generic service technician routing and scheduling problem. Different approaches for dealing with the problem of pairwise route synchronization are compared and several ways of integrating a synchronization component into a metaheuristic algorithm tailored to the original problems are analyzed. When applied to benchmark instances from the literature, our algorithm matches almost all available optimal values and it produces several new best results for the remaining instances. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|