Integration of information and optimization models for vehicle routing in urban areas

Procedia - Social and Behavioral Sciences

Volumn 20, Issue , 2011, Pages 110-119

  Ehmke, Jan Fabian ^a   Mattfeld, Dirk Christian ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

City logistics; Time dependent travel times; Vehicle routing

Indexed keywords

EID: 80053043530     PISSN: 18770428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/j.sbspro.2011.08.016     Document Type: Conference Paper

References (24)

1. Agatz, N., Campbell, A., Fleischmann, M., & Savelsbergh, M. (2008). Challenges and Opportunities in Attended Home Delivery. In B. Golden, R. Raghaven, & E. Wasil (Eds.), The Vehicle Routing Problem: Latest Advances and New Challenges, Springer.
2. Brockfeld, E., Lorkowski, S., Mieth, P., & Wagner, P. (2007a). Benefits and limits of recent Floating Car Data Technology - An Evaluation Study. Proceedings of WCTR Conference 2007. Available at http://elib.dlr.de/ 49618/.
3. Brockfeld, E., Passfeld, B., & Wagner, P. (2007b). Validating Travel Times Calculated On The Basis Of Taxi Floating Car Data With Test Drives. Proceedings of 14th ITS Conference. Available at http://elib.dlr.de/50208/.
4. Clarke, G., & Wright, J. W. (1964). Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research, 12, 568-581.
5. Dean, B. C. (2004). Shortest Paths in FIFO Time-Dependent Networks: Theory and Algorithms. Massachusetts Institute Of Technology. Available at http://www.cs.clemso.edu/~bcdean/paper18.html.
6. Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269-271.
7. Donati, A. V., Montemanni, R., Casagrande, N., Rizzoli, A. E., & Gambardella, L. M. (2008). Time dependent vehicle routing problem with a multi ant colony system. European Journal of Operational Research, 185, 1174-1191. (Pubitemid 47498811)
8. Eglese, R., Maden, W., & Slater, A. (2006). A road timetable to aid vehicle routing and scheduling. Computers and Operations Research, 12, 3508-3519.
9. Ehmke, J. F., Meisel, S., Engelmann, S., & Mattfeld, D. C. (2009). Data Chain Management for Planning in City Logistics. International Journal of Data Mining, Modelling and Management, 1, 335-356.
10. Ehmke, J. F., Meisel, S., & Mattfeld, D. C. (2010). Floating Car Data Based Analysis of Urban Travel Times for the Provision of Traffic Quality. In J. Barceló, & M. Kuwahara (Eds.): Traffic Data Collection and its Standardization, 129-150, Springer.
11. Fleischmann, B., Gietz, M., Gnutzmann, S. (2004). Time-Varying Travel Times in Vehicle Routing. Transportation Science, 38, 160-173.
12. Gietz, M. (1994). Computergestützte Tourenplanung mit zeitkritischen Restriktionen. Physica. German language
13. Golden, B., & Stewart, R. W. (1985). Empirical Analysis of Heuristics. In E. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, & D. B. Shmoys (eds.), The Travelling Salesman Problem, John Wiley & Sons, New York
14. Ichoua, S., Gendreau, M., & Potvin, J.-Y. (2003). Vehicle dispatching with time-dependent travel times. European Journal of Operational Research 144, 379-396. (Pubitemid 35214210)
15. Kaufman, D. E., & Smith, R. L. (1993). Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. IVHS 1, 1-11.
16. Lorkowski, S., Mieth, P., & Schäfer, R.-P. (2005). New ITS applications for metropolitan areas based on Floating Car Data. Institute of Transport Research, German Aerospace Center (Berlin). Available at: http://elib.dlr.de/21000/.
17. Maden, W., Eglese, R., & Black, D. (2010). Vehicle routing and scheduling with time-varying data: A case study. Journal of the Operational Research Society, 61, 515-522.
18. MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In L. M. Le Cam, & J. Neyman (eds.), Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, 281-287.
19. Malandraki, C., & Dial, R. B. (1996). A restricted dynamic programming heuristic algorithm for the time-dependent traveling salesman problem. European Journal of Operational Research, 90, 45-55. (Pubitemid 126392350)
20. Potvin, J.Y., & Rousseau, J.M. (1993). A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research, 66, 331-340.
21. Schneider, J. (2002). The time-dependent traveling salesman problem. Physica A: Statistical Mechanics and its Applications, 314, 151-155.
22. Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35, 254-265.
23. Taniguchi, E., Thompson, R. G., Yamada, Y., Van Duin, R. (2008). City Logistics - Network Modelling and Intelligent Transport Systems. Chapter 7. Emerald Publisher, Bingley, UK.
24. Van Woensel, T., Kerbache, L., Peremans, H., & Vandaele, N. (2008). Vehicle routing with dynamic travel times. A queueing approach. European Journal of Operational Research, 186, 990-1007. (Pubitemid 350016653)