A simulation study of automated path planning in transportation systems

Simulation Series

Volumn 35, Issue 3, 2003, Pages 638-643

  Sadoun, Baiqies ^a  

^a AL BALQA APPLIED UNIVERSITY   (Jordan)

Author keywords

City planning and engineering; Geomatics; GIS; Modeling and simulation; Transportation planning and engineering

Indexed keywords

COMPUTER SIMULATION; GEOGRAPHIC INFORMATION SYSTEMS; GRAPH THEORY; INTELLIGENT SYSTEMS; MOTION PLANNING; PLANNING; REGIONAL PLANNING; SURVEYS;

GEOMATICS; INTELLIGENT TRANSPORTATION SYSTEMS; MODEL AND SIMULATION; PLANNING SYSTEMS; SIMULATION STUDIES; TRANSPORTATION ENGINEERING; TRANSPORTATION PLANNING; TRANSPORTATION SYSTEM;

TRANSPORTATION;

EID: 84907883748     PISSN: 07359276     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. B. Sadoun, " Simulation in city Planning and Engineering, " in Applied System Simulation: Methodologies and Applications, Kiuwer, 2003.
2. B. Sadoun, " An Efficient Simulation Methodology for the Design of Traffic Lights at Intersections in Urban Areas, " Simulation: Transactions of The Society for Modeling and Simulation International, Vol. 79. No. 2, February 2003.
3. B. Sadoun, " A New Simulation Methodology to Optimize the Operation of a Toll Plaza of a Highway, " Proc. of the 2002 Summer Computer Simulation Conference, pp. 140-146, San Diego, California, USA, July 2002.
4. E. Lieberman, "Integrating GIS, simulation and animation", Proc. of 1991 WinIer Simulation Conference, pp. 771 -777, 1991.
5. B.V. Cherkassky, A.V. Goldberg and T. Radzik, Shortest paths algorithms: Theory and experimental evaluation", Technical Report 93-1480, Computer Science Department, Stanford University, 1993.
6. R. K. Ahuja, K. Mehlhorn, J. B. Orlin. and R. E. Tarjan, "Faster algorithms for the Shortest Path Problem", Journal of Association of Computing Machinery, Vol. 37, pp. 2 13-223, 1990.
7. R. E. Bellman, "On a Routing Problem, " Quarterly of Applied Mathematics, Vol. 16, pp. 87-90, 1958.
8. A. V. Goldberg, and T. Radzik, "A Heuristic Improvement of the Bellman-Ford Algorithm. Applied Mathematics Letter, Vol. 6, pp. 3-6, 1993.
9. T. H. Corman, C. E. Leiserson, and R. L. Riverst, "Introduction to Algorithms, " MIT Press, Cambridge, MA, 1990.
10. G. Gallo and S. Pallottino, "Shortest Paths Algorithms, " Annals of Operations Research Vol. 13, pp. 3-79, 1988.
11. E. W. Dijkstra "A Note on Two Problems in Connection with Graphs, "Numeriche Mathematik, Vol. 1, pp. 269-271, 1959
12. M.H. Hung and J.J. Divoky, "A Computational Study of Efficient Shortest Path Algorithms, " Computers & Operations Research, Vol. 15, pp. 567-576, 1988.
13. F. B. Zhan, and C. E. Noon, "Shortest Path Algorithms: An Evaluation Using Real Road Networks, " Transportation Science, Vol. 32, No. 1, pp. 65-73, 1996.
14. U. Pape, "Implementation and Efficiency of Moore Algorithms for the Shortest Root Problem, " Mathematical Programming, Vol. 7, pp. 2 12-222, 1974.
15. R. McDonnell, and K. Kemp" International GIS Dictionary." Cambridge University Press, GeoInformation International, 1995.
16. S. Pallottino, " Shortest-Path Methods: Complexity, Interrelations and New Propositions, " Networks, Vol. 14, pp. 257-267, 1984.
17. http://www.mapsonus.com
18. http://pasture.ccn.purdue.cdul-caaais/tgis/overview.html
19. http://www.esri.com