Solving the k-shortest path problem with time windows in a time varying network

Operations Research Letters

Volumn 36, Issue 6, 2008, Pages 692-695

  Androutsopoulos, Konstantinos N ^a   Zografos, Konstantinos G ^a  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

Dynamic programming; k shortest path; Routing and scheduling

Indexed keywords

COMPUTER NETWORKS; MATERIALS HANDLING; NETWORK PROTOCOLS; SENSOR NETWORKS; SYSTEMS ENGINEERING; TIME VARYING NETWORKS; WINDOWS;

K-SHORTEST PATH; ROUTING; ROUTING AND SCHEDULING; SHORTEST PATH PROBLEMS; TIME DEPENDENTS; TIME WINDOWS; URBAN TRIPS;

PROBLEM SOLVING;

EID: 54249092332     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.07.003     Document Type: Article

References (14)

1. Ahuja R.K., Orlin J.B., Pallottino S., and Scutellà M.G. Dynamic shortest paths minimizing travel times and costs. Networks 41 (2003) 197-205
2. Cai X., Kloks T., and Wong C.K. Time-varying shortest path problems with constraints. Networks 29 3 (1997) 141-149
3. Chabini I. Discrete dynamic shortest path problems in transportation applications. Transportation Research Record: Journal of the Transportation Research Board 1645 (1998) 170-175 TRB, National Research Council, Washington DC
4. Chen Y.L., and Tang K. Minimum time paths in a network with mixed time constraints. Computers and Operations Research 25 10 (1998) 793-805
5. Chen Y.L., Rinks D., and Tang K. The first K minimum cost paths in a time-schedule network. Journal of the Operations Research Society 52 (2001) 102-108
6. Cooke K.L., and Halsey E. The shortest route through a network with time-dependent intermodal transit times. Journal of Mathematical Analysis and Applications 14 (1966) 493-498
7. Eppstein D. Finding the k shortest paths. SIAM Journal on Computing 28 2 (1999) 652-673
8. Erkut E., Tjandra S.A., and Verter V. Hazardous Materials Transportation. In: Barnhart C., and Laporte G. (Eds). Handbooks in Operations Research and Management Science vol. 14 (2007) 539-621
9. Erkut E., and Alp O. Integrated routing and scheduling of hazmat trucks with stops en route. Transportation Science 41 1 (2007) 107-122
10. Hadjiconstantinou E., and Christofides N. An efficient implementation of an algorithm for finding K shortest simple paths. Networks 34 2 (1999) 88-101
11. Horn M. An extended model and procedural framework for planning multi-modal passenger journeys. Transportation Research Part B 37 (2003) 641-660
12. Katoh N., Ibaraki T., and Mine H. Efficient algorithm for K-shortest simple paths. Networks 12 4 (1982) 411-427
13. Yen J.Y. Finding the K shortest loopless paths in a network. Management Science 17 (1971) 712-716
14. Ziliaskopoulos A., and Mahmassani H. Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications. Transportation Research Record 1403 (1993) 94-100