Minimum time paths in a network with mixed time constraints

Computers and Operations Research

Volumn 25, Issue 10, 1998, Pages 793-805

  Chen, Y L ^a   Tang, Kwei ^b  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; SCHEDULING;

MIXED TIME CONSTRAINTS; TIME-CONSTRAINED SHORTEST PATH PROBLEMS (TCSPP);

COMPUTER NETWORKS;

EID: 0032188006     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00020-3     Document Type: Article

References (10)

1. Deo, N. and Pang, C., Shortest path algorithms: taxonomy and annotation. Networks, 1984, 14, 275-323.
2. White, L. S., Shortest route models for the allocation of inspection effort on a production line. Management Science, 1969, 15, 249-259.
3. Bodin, L. D., Golden, B. L., Assad, A. A. and Ball, M. O., Routing and scheduling of vehicles and crews: the state of the art. Computers and Operations Research, 1982, 10, 63-211.
4. Golden, B. L. and Magnanti, T. L., Deterministic network optimization: a bibliography. Networks, 1911, 7, 149-183.
5. Desrosiers, J., Soumis, F. and Desrochers, M., Routing with time windows by column generation. Networks, 1984, 14, 545-565.
6. Desrochers, M. and Soumis, F., A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR, 1988, 26, 191-211.
7. Desrochers, M. and Soumis, F., A reoptimization algorithm for the shortest path problem with time windows. European Journal of Operational Research, 1988, 35, 242-254.
8. Solomon, M. M., Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 1987, 35, 254-265.
9. Chen, Y. L. and Tang, K., Shortest paths in time-schedule networks. International Journal of Operations and Quantitative Management 1997, 3, 157-173.
10. Dijkstra, E. W., A note on two problems in connection with graphs. Numerische Mathematik, 1959, 1, 269-271.