Selecting a dynamic and stochastic path method for vehicle routing and scheduling problems

Procedia - Social and Behavioral Sciences

Volumn 2, Issue 3, 2010, Pages 6042-6052

  Nakamura, Yuki ^a   Taniguchi, Eiichi ^a   Yamada, Tadashi ^a   Ando, Naoki ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Dynamic and stochastic network; Shortest path problem; Vehicle routing and scheduling

Indexed keywords

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

References (8)

1. Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269-271.
2. Fu, L., & Rilett, L. R. (1998). Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research Part B, 32, 499-516.
3. Kallehauge, B., Larsen, J., & Madsen, O. B. G. (2006). Lagrangian duality applied to the vehicle routing problem with time windows. Computers & Operations Research, 33, 1464-1487.
4. Kohl, N., & Madsen, O. B. G. (1997). An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation. Operations Research, 45, 395-406.
5. Miller-Hooks, E. (2001). Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. Networks, 37, 35-52.
6. Taniguchi, E., Yamada, T., & Tamagawa, D. (1999). Probabilistic vehicle routing and scheduling on variable travel times with dynamic traffic simulation. In E. Taniguchi, & R. G. Thompson (Eds.), City Logistics I (pp. 85-99). Institute of Systems Science Research, Kyoto.
7. Taniguchi, E., Thompson, R. G., Yamada, T., & van Duin, R. (2001). City logistics - Network modelling and intelligent transport systems. Pergamon, Oxford.
8. Toth, P., & Vigo, D. (2002). The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia.