Advanced routing for city logistics service providers based on time-dependent travel times
- 作者：Jan Fabian Ehmke ; j-f.ehmke@tu-bs.de ; [Author Vitae] ; André ; Steinert a.steinert@tu-bs.de ; [Author Vitae] ; Dirk Christian Mattfeld d.mattfeld@tu-bs.de ; [Author Vitae]
- 关键词：FA ; Floating Car Data Average ; FH ; Floating Car Data Hourly Average ; FW ; Floating Car Data Weighted Average ; FCD ; Floating Car Data ; KDD ; Knowledge Discovery in Databases ; TDNN ; Time-Dependent Nearest Neighbor Heuristic ; TDDPNN ; Time-Dependent Dynamic Pro
- 刊名：Journal of Computational Science
- 出版年：2012
- 期刊代码：pc68_18777503
- 类别：cp
- 出版时间：July, 2012
- 卷：3
- 期：4
- 页码：193-205
- 文件大小：2368 K
摘要
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.