The first K shortest unique-arc walks in a traffic-light network

Mathematical and Computer Modelling

Volumn 40, Issue 13, 2004, Pages 1453-1464

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

^a NATIONAL CHIN YI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

Shortest path; Traffic light; Walk

Indexed keywords

MATHEMATICAL MODELS; TRAFFIC SIGNALS;

ARCS; INTERSECTION MOVEMENTS; LOOPING PATHS; NODES; TRAFFIC-LIGHT NETWORKS;

ALGORITHMS;

EID: 18144384253     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mcm.2005.01.004     Document Type: Article

References (23)

1. A.J. Swersey, and W. Ballard Scheduling school buses Management Science 30 1984 844 853
2. Y.-L. Chen, and Y.-H. Chin The quickest path problem Computers & Operations Research 17 1990 153 161
3. L.D. Bodin, B.L. Golden, A.A. Assad, and M.O. Ball Routing and scheduling of vehicles and crews: The state of the art Computers & Operations Research 10 1982 63 211
4. N. Deo, and C. Pang Shortest path algorithms: Taxonomy and annotation Networks 14 1984 275 323
5. B.L. Golden, and T.L. Magnanti Deterministic network optimization: A bibliography Networks 7 1977 149 183
6. M. Desrochers, and F. Soumis A generalized permanent labelling algorithm for the shortest path problem with time windows INFOR 26 3 1988 191 212
7. M. Desrochers, J. Desrosiers, and M.M. Solomon A new optimization algorithm for the vehicle routing problem with time windows Operations Research 40 1992 342 354
8. Y. Dumas, J. Desrosiers, E. Gelinas, and M.M. Solomon An optimal algorithm for the traveling salesman problem with time windows Operations Research 43 1995 367 371
9. N. Kohl, and O.B.G. Madsen An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation Operations Research 45 1997 395 406
10. A.K. Ziliaskopoulos, and H.S. Mahmassani A note on least time path computation considering delays and prohibitions for intersection movements Transportation Research Part B 30 5 1996 359 367
11. Y.-L. Chen, and H.-H. Yang Shortest paths in traffic-light networks Transportation Research Part B 34 2000 241 253
12. D. Eppstein Finding the k shortest paths SIAM Journal on Computing 28 1998 652 673
13. Institute of Transportation 2001 Highway Capacity Manual in Taiwan 2001 Ministry of Transportation of Communications Upper Saddle River, NJ, U.S.A.
14. Department of Transportation 2003 Traffic Flow Data 2003 Taipei City Government Taipei, Taiwan, ROC
15. F. Dion, H. Rakha, and Y.-S. Kang Comparison of delay estimates at under-saturated and over-saturated pre-timed signalized intersections Transportation Research Part B 38 2 2004 99 122
16. F.B. Zhan, and C.E. Noon Shortest path algorithms: An evaluation using real road networks Transportation Science 32 1 1998 65 73
17. L. Fu, and L.R. Rilett Expected shortest paths in dynamic and stochastic traffic networks Transportation Research Part B 32 7 1998 499 516
18. J.Y. Yen Finding the k shortest loopless paths in a network Management Science 17 1971 712 716
19. N. Katoh, T. Ibaraki, and H. Mine An efficient algorithm for k shortest simple paths Networks 12 1982 411 427
20. S. Dreyfus An appraisal of some shortest path algorithms Operations Research 17 1969 395 412
21. B.L. Fox Data structures and computer science techniques in operations research Operations Research 26 1978 686 717
22. E. Dijkstra A note on two problems in connection with graphs Numeriche Mathematics 1 1959 269 271
23. M.L. Fredman, and R.E. Tarjan Fibonacci heaps and their uses in improved network optimization algorithms Journal of ACM 34 1987 596 615