The first K minimum cost paths in a time-schedule network

Journal of the Operational Research Society

Volumn 52, Issue 1, 2001, Pages 102-108

  Chen, Y L ^a   Rinks, D ^b   Tang, K ^c  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b LOUISIANA STATE UNIVERSITY   (United States)

^c PURDUE UNIVERSITY   (United States)

Author keywords

Networks and graphs; Road transport; Shortest path

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIALS; TIME VARYING NETWORKS;

TIME SCHEDULE NETWORKS;

OPERATIONS RESEARCH;

EID: 0034817770     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601028     Document Type: Article

References (16)

1. Swersey AJ and Ballard W (1984). Scheduling school buses. Mgmt Sci 30: 844-853.
2. Chen YL and Chin YH (1990). The quickest path problem. Comp Opns Res 17: 153-161.
3. Bodin LD, Golden BL, Assad AA and Ball MO (1982). Routing and scheduling of vehicles and crews: the state of the art. Comp Opns Res 10: 63-211.
4. Deo N and Pang C (1984). Shortest path algorithms: taxonomy and annotation. Networks 14: 275-323.
5. Golden BL and Magnanti TL (1977). Deterministic network optimization: a bibliography. Networks 7: 149-183.
6. Desrochers M, Desrosiers J and Solomon M (1992). A new optimization algorithm for the vehicle routing problem with time windows. Opns Res 40: 342-354.
7. Dumas Y, Desrosiers J, Gelinas E and Solomon MM (1995). An optimal algorithm for the traveling salesman problem with time windows. Opns Res 43: 367-371.
8. Kohl N and Madsen OBG (1997). An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Opns Res 45: 395-406.
9. Chen YL and Tang K (1997). Shortest paths in time-schedule networks. Int J Opns and Quan Mgmt 3: 157-173.
10. Chen YL and Tang K (1998). Minimal time paths in a network with mixed time constraints. Comp Opns Res 25: 793-805.
11. Yen JY (1971). Finding the k shortest loopless paths in a network. Mgmt Sci 17: 712-716.
12. Katoh N, Ibaraki T and Mine H (1982). An efficient algorithm for k shortest simple paths. Networks 12: 411-427.
13. Fox BL (1978). Data structures and computer science techniques in operations research. Opns Res 26: 686-717.
14. Eppstein D (1999). Finding the k shortest paths. SIAM J Computing 28(2): pp 652-673.
15. Chen YL, Rinks D and Tang K (1999). The first K minimum cost paths in a time-schedule network. Working paper, Department of Information Systems and Decision Sciences, Louisiana State University, Baton Rouge, Louisiana, USA.
16. Fredman ML and Tarjan RB (1987). Fibonacci heaps and their uses in improved network optimization algorithms. J ACM 34: 596-615.