Shortest paths in traffic-light networks

Transportation Research Part B: Methodological

Volumn 34, Issue 4, 2000, Pages 241-253

  Chen, Yen Liang ^a   Yang, Hsu Hao ^b  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b NATIONAL CHIN YI UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Road network; Shortest path; Time window; Traffic light

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; TRAFFIC SIGNALS;

TIME-CONSTRAINED SHORTEST PATH PROBLEM (TCSPP);

MOTOR TRANSPORTATION;

TRAFFIC MANAGEMENT;

EID: 0034067577     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0191-2615(99)00023-5     Document Type: Article

References (8)

1. Balakrishnan N. Simple heuristics for the vehicle routing problem with soft time windows. Journal of Operational Research Society. 44:1993;279-287.
2. Bodin L.D., Golden B.L., Assad A.A., Ball M.O. Routing and scheduling of vehicles and crews: the state of the art. Computers & Operations Research. 10:1982;63-211.
3. Bramel J., Simchilevi D. Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows. Operations Research. 44:1996;501-509.
4. Deo N., Pang C. Shortest path algorithms: taxonomy and annotation. Networks. 14:1984;275-323.
5. Fredman M.L., Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of ACM. 34:1987;596-615.
6. Golden B.L., Magnanti T.L. Deterministic network optimization: a bibliography. Networks. 7:1977;149-183.
7. Kolen A.W.J., Rinnooy Kan A.H.G., Trienekens H.W.J.M. Vehicle routing with time windows. Operations Research. 35:1987;266-273.
8. Russell R.A. Hybrid heuristics for the vehicle-routing problem with time windows. Transportation Sciences. 29:1995;156-166.