Advanced routing for city logistics service providers based on time-dependent travel times

Journal of Computational Science

Volumn 3, Issue 4, 2012, Pages 193-205

  Ehmke, Jan Fabian ^a   Steinert, André ^a   Mattfeld, Dirk Christian ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Floating Car Data; Heuristics; Time dependent travel times; Time dependent Traveling Salesman Problem; Vehicle routing

Indexed keywords

CITY LOGISTICS; COMPUTATIONAL EXPERIMENT; E-COMMERCE BUSINESS; FLOATING CAR DATA; HEURISTICS; PLANNING DATA; PLANNING SYSTEMS; TIME-DEPENDENT; TIME-DEPENDENT TRAVELING SALESMAN; TRAFFIC DATA COLLECTION; TRAFFIC DEMANDS; VEHICLE ROUTING PROBLEMS;

TRAVELING SALESMAN PROBLEM; VEHICLE ROUTING; WIRELESS TELECOMMUNICATION SYSTEMS;

TRAVEL TIME;

EID: 84861952220     PISSN: 18777503     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jocs.2012.01.006     Document Type: Article

References (38)

1. Agatz N., Campbell A.M., Fleischmann M., Savelsbergh M. Time slot management in attended home delivery. Transportation Science 2011, 45:435-449.
2. Barceló J., Kuwahara M. Traffic Data Collection and its Standardization, International Series in Operations Research & Management Science 2010, Springer, New York.
3. Bierwirth C., Mattfeld D.C., Kopfer H. On permutation representations for scheduling problems. Proceedings of the 4th International Conference on Parallel Problem Solving from Nature 1995, 310-318. Springer, London.
4. Bishop R. Intelligent Vehicle Technology and Trends 2005, Artech House, Boston.
5. Bräysy O., Gendreau M. Vehicle Routing Problem with Time Windows. Part II: Metaheuristics. Transportation Science 2005, 39:119-139.
6. Clarke G., Wright J.W. Scheduling of vehicles from central depot to a number of delivery points. Operations Research 1964, 12:568-581.
7. B.C. Dean, Shortest Paths in FIFO Time-Dependent Networks: Theory and Algorithms, Technical Report, MIT Department of Computer Science, 2004. Available from: (13 May 2011). http://www.cs.clemson.edu/~bcdean/paper18.html.
8. Delling D., Wagner D. Time-dependent route planning. Robust and Online Large-Scale Optimization. Models and Techniques for Transportation Systems 2009, 207-230. Springer, Berlin. R.K. Ahuja, R. Möhring, C.D. Zaroliagis (Eds.).
9. Dijkstra E.W. A note on two problems in connexion with graphs. Numerische Mathematik 1959, 1:269-271.
10. Dreyfus S.E. An appraisal of some shortest path algorithms. Operations Research 1969, 17:395-412.
11. Eglese R., Maden W., Slater A. A road timetable to aid vehicle routing and scheduling. Computers & Operations Research 2006, 33:3508-3519.
12. Ehmke J.F., Meisel S., Mattfeld D.C. Floating car based travel times for city logistics. Transportation Research-Part C: Emerging Technologies 2012, 1:338-352.
13. Ehmke J.F., Meisel S., Engelmann S., Mattfeld D.C. Data chain management for planning in city logistics. International Journal of Data Mining, Modelling and Management 2009, 1:335-356.
14. Fayyad U.M., Piatetsky-Shapiro G., Smith P. From data mining to knowledge discovery: an overview. Advances in Knowledge Discovery and Data Mining 1996, 1-34. AAAI Press, Menlo Park. U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, R. Uthurusamy (Eds.).
15. Figliozzi M.A. A route improvement algorithm for the vehicle routing problem with time dependent travel times. Proceedings of the 88th Transportation Research Board Annual Meeting 2009.
16. Flatberg T., Hasle G., Kloster O., Nilssen E.J., Riise A. Dynamic and stochastic aspects in vehicle routing - a literature survey. SINTEF Applied Mathematics, vol. 16 2005.
17. Fleischmann B., Gietz M., Gnutzmann S. Time-varying travel times in vehicle routing. Transportation Science 2004, 38:160-173.
18. Geisberger R., Sanders P. Engineering time-dependent many-to-many shortest paths. Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems 2010, 74-87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl. T. Erlebach, M. Lübbecke (Eds.).
19. George B., Kim S., Shekhar S. Spatio-temporal network databases and routing algorithms: a summary of results. Advances in Spatial and Temporal Databases. Proceedings of 10th International Symposium SSTD 2007 2007, 460-477. Springer, Berlin/Heidelberg. D. Papadias, D. Zhang, G. Kollios (Eds.).
20. George B., Shekhar S. Modeling spatio-temporal network computations: a summary of results. Proceedings of the 2nd International Conference on GeoSpatial Semantics 2007 2007, Springer, Berlin/Heidelberg.
21. Gevaers R., van de Voorde E., Vanelslander T. Characteristics and typology of last-mile logistics from an innovation perspective in an urban context. Proceedings of WCTR 2010 2010.
22. Glover F., Laguna M. Tabu Search 1998, Springer, New York.
23. Golden B.L., Stewart R.W. Empirical analysis of heuristics. The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization 1985, 207-249. Wiley, Chichester. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.).
24. Han J., Kamber M. Data Mining. Concepts and Techniques 2006, Elsevier/Morgan Kaufmann, Amsterdam.
25. Ichoua S., Gendreau M., Potvin J.Y. Vehicle dispatching with time-dependent travel times. European Journal of Operational Research 2003, 144:379-396.
26. Kaufman D.E., Smith R.L. Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. IVHS 1993, 1:1-11.
27. Köhler E., Langtau K., Skutella M. Time-expanded graphs for flow-dependent transit time. Proceedings of 10th Annual European Symposium on Algorithms - ESA 2002, 599-611. Springer, Berlin. R. Möhring, R. Raman (Eds.).
28. Lu Q., George B., Shekhar S. Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results. SSTD 2005, Springer, Heidelberg, pp. 22-24. C. Bauzer Medeiros, M.J. Egenhofer, E. Bertino (Eds.).
29. Maden W., Eglese R., Black D. Vehicle routing and scheduling with time-varying data: a case study. Journal of the Operational Research Society 2010, 61:515-522.
30. Malandraki C., Dial R.B. A restricted dynamic programming heuristic algorithm for the time dependent Traveling Salesman Problem. European Journal of Operational Research 1996, 90:45-55.
31. Orda A., Rom R. Minimum weight paths in time-dependent networks. Networks 1991, 21:295-319.
32. J. Pape, Mobilität 2020. Perspektiven für den Verkehr von morgen. (Mobility 2020. Perspectives for future traffic), Konvent für Technikwissenschaften der Union der deutschen Akademien der Wissenschaften e.V., IRB, Stuttgart, 2006.
33. Potvin J.Y., Rousseau J.M. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research 1993, 66:331-340.
34. Schneider J. The Time-dependent Traveling Salesman Problem. Physica A: Statistical Mechanics and its Applications 2002, 314:151-155.
35. Solomon M. Algorithms for vehicle routing and scheduling problem with time windows constraints. Operations Research 1987, 35:254-265.
36. Taniguchi E., Thompson R.G., Yamada T. Modelling city logistics. City Logistics. I. Proceeding, Institute of City Logistics 1999, E. Taniguchi, R.G. Thompson (Eds.).
37. Taniguchi E., Thompson R.G., Yamada T., van Duin R. City Logistics. Network Modelling and Intelligent Transport Systems 2008, Emerald, Bingley.
38. van Woensel T., Kerbache L., Peremans H., Vandaele N. Vehicle routing with dynamic travel times: a queueing approach. European Journal of Operational Research 2008, 186:990-1007.