Advanced routing for city logistics service providers based on time-dependent travel times |
| |
| Authors: | Jan Fabian Ehmke André Steinert Dirk Christian Mattfeld |
| |
| Affiliation: | 1. University of Thessaly, Pedion Areos, Volos, 38334, Greece;1. Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Argentina;2. Instituto de Investigación en Ciencias de la Computación (ICC), CONICET-Universidad de Buenos Aires, CABA, Argentina;3. Universidad Torcuato Di Tella, CABA, Argentina;4. Consejo Nacional de Investigaciones Científicas y Técnicas, CABA, Argentina;1. LAMSADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775 Paris, France;2. ENAV S.p.A, Italian Agency for Air Navigation Services Via Salaria 716 Roma, Italy;3. DEI, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy |
| |
| Abstract: | Increasing traffic demand, recurring congestion and sophisticated e-commerce business models lead to enormous challenges for routing in city logistics. We introduce a planning system for city logistics service providers, which faces those challenges by more realistic vehicle routing considering time-dependent travel times. Time-dependent travel times arise from telematics-based traffic data collection city-wide. Well-known heuristics for the Traveling Salesman Problem and for the Vehicle Routing Problem are adapted to time-dependent planning data. Computational experiments allow for insights into the efficiency of individual heuristics, their adaptability to time-dependent planning data sets, and the quality and structure of resulting delivery tours. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
