Parallel implementation of a transportation network model

Journal of Parallel and Distributed Computing

Volumn 65, Issue 1, 2005, Pages 1-14

  O'Cearbhaill, Eoin A ^a   O'Mahony, Margaret ^a  

^a TRINITY COLLEGE DUBLIN   (Ireland)

Author keywords

Algorithm; Applications; Computing; Networks; Parallel; Shortest path; Transport

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; COMPUTER SIMULATION; ERROR ANALYSIS; MATHEMATICAL MODELS; RANDOM ACCESS STORAGE;

CENTRAL PROCESSING UNIT (CPU); REPROGRAMMING; SHORTEST PATH ALGORITHM; TRANSPORTATION NETWORK MODEL;

PARALLEL PROCESSING SYSTEMS;

EID: 11444265511     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2004.07.003     Document Type: Article

References (83)

1. P. Adamson, E. Tick, Greedy partitioned algorithms for the shortest path problem, Int. J. Parallel Programming 20 (1991) 271-298.
2. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, "Network Flows", Theory, Algorithms and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
3. R.E. Allsop, Guest editorial, Transport. Res. C 5 (2) (1997) 73-76.
4. Y. Arezki, D. van Vliet, A full analytical implementation of the PARTAN/Frank-Wolfe algorithm for equilibrium assignment, Transp. Sci. 24 (1) (1990) 58-62.
5. R. Bellman, On a routing problem, Q. Appl. Math. 16 (1958) 87-90.
6. D.P. Bertsekas, An auction algorithm for shortest paths, SIAM J. Optim. 1 (1991) 425-447.
7. D.P. Bertsekas, Linear Network Optimization: Algorithms and Codes, MIT Press, Cambridge, MA, 1991.
8. D.P. Bertsekas, D.A. Castanon, Parallel synchronous and asynchronous implementations of the auction algorithm, Parallel Comput. 17 (1991) 707-732.
9. D.P. Bertsekas, J.N. Tsitsiklis, Parallel and Distributed Computation, Prentice-Hall, Englewood Cliffs, NJ, 1989.
10. D.P. Bertsekas, J.N. Tsitsiklis, Some aspects of parallel and distributed iterative algorithms - a survey, Automatica 27 (1) (1991) 3-21.
11. D.P. Bertsekas, F. Guerriero, R. Musmanno, Parallel asynchronous label-correcting methods for shortest paths, J. Optim. Theory Appl. 88(1) (1996) 297-320.
12. F. Bitz, H.T. Kung, Path planning on the WARP computer: using a linear systolic array in dynamic programming, Int. J. Comput. Math. 25 (1988) 173-188.
13. I. Chabini, Discrete dynamic shortest path problems in transportation applications: complexity and algorithms with optimal run time, Transp. Res. Rec. 1645 (1998) 170-175.
14. I. Chabini, M. Florian, E. Le Saux, Parallel and Distributed Computation of Shortest Routes and Network Equilibrium Models, Department of Civil and Environmental Engineering, MIT Press, Cambridge, MA, USA, 1997.
15. K.M. Chandy, J. Misra, Distributed computation on graphs: shortest path algorithms, Commun. ACM 25 (1982) 833-837.
16. B.V. Cherkassky, A.V. Goldberg, T. Radzik, Shortest path algorithms: theory and experimental evaluation, Math. Programming 73 (1996) 129-174.
17. A. Crauser, K. Mehlhorn, U. Meyer, P. Sanders, A parallelization of Dijkstra's shortest path algorithm, in: Proceedings of the 23rd Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Brno, Czech Republic, Springer, Berlin, 1998
18. P.J. Denning, Working sets past and present, IEEE Trans. Software Eng. SE 6 (1) (1980) 64-84.
19. N. Deo, C. Pang, Shortest path algorithms: taxonomy and annotation, Networks 14 (1984) 275-323.
20. N. Deo, C.Y. Pang, R.E. Lord, Two parallel algorithms for shortest path problems, Technical Report CS-80-059, Washington State University, March 1980.
21. S. Dey, P.K. Srimani, Fast parallel algorithm for all-pairs shortest path problem and its VLSI implementation, IEE Proc. 136 (Pt. E. 2) (1989).
22. E.W. Dijkstra, A note on two problems in connection with graphs (spanning tree, shortest path), Numer. Math. 1 (1959) 269-271.
23. Dublin Transportation Initiative, Final Report, Technical Annex on Transportation Modelling, Department of the Environment, Dublin, 1995.
24. D.L. Eager, J. Zahorjan, E.D. Lazowska, Speedup versus efficiency in parallel systems, IEEE Trans. Comput. 38 (3) (1989) 408-423.
25. M. Florian, Applications of parallel computing in transportation: Guest editorial, Parallel Comput. 27 (2001) 1521-1522.
26. L.R. Ford, D.R. Fulkerson, Maximal flow through a network, Flows in Networks, Princeton University Press, Princeton, NJ, 1962, pp. 399-404.
27. M. Frank, P. Wolfe, An algorithm for quadratic programming, Nav. Res. Logist. Q. 3 (1956) 95-110.
28. G. Gallo, S. Pallottino, Shortest path methods: a unifying approach, Math. Programming Study 26 (1986) 38-64.
29. G. Gallo, S. Pallottino, Shortest path methods in transportation models, in: M. Florian (Ed.), Transportation Planning Models, NorthHolland, Amsterdam, 1984, pp. 227-256.
30. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, B. Manchek, V. Sunderam, PVM: Parallel Virtual Machine-A User's Guide and Tutorial for Network Parallel Computing, MIT Press, Cambridge, MA, 1994.
31. A.V. Goldberg, T. Radzik, A heuristic improvement of the Bellman-Ford algorithm, Appl. Math. Lett. 6 (1993) 3-6.
32. B. Golden, Shortest-path algorithms: a comparison, Oper. Res. 24 (6) (1976) 1164-1168.
33. D.G. Greenwood, N.B. Taylor, Parallelising the CONTRAM traffic assignment model, in: Proceedings of the 1993 European Multisimulation Conference, Lyon, 7- 9, June 1993.
34. W. Gropp, E. Lusk, Why are PVM and MPI so different?, in: M. Bubak, J. Dongarra (Eds.), Recent Advances in PVM and MPI, Lecture Notes in Computer Science, vol. 1332, Springer, Berlin, Heidelberg, New York, 1997, 3-10.
35. W. Gropp, E. Lusk, A. Skjellum, Using MPI-Portable Parallel Programming with the Message-Passing Interface, MIT Press, Cambridge, MA, London, UK, 1994.
36. W. Gropp, S. Huss-Lederman, A. Lumsdaine, E. Lusk, B. Nitzberg, W. Saphir, M. Snir, MPI: The Complete Reference Vol. 2 - The MPI-2 Extension, MIT Press, Cambridge, MA, 1998.
37. J. Gurd, C.C. Kirkham, I. Watson, The Manchester prototype dataflow computer, Commun. ACM 28 (1) (1985) 34-52.
38. M. Habbal, H. Koutsopoulos, S. Lerman, A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures, Transp. Sci. (1994).
39. R. Hempel, D.W. Walker, The emergence of the MPI message passing standard for parallel computing, Comput. Stand. Interfaces 21 (1999) 51-62.
40. A.D. Hislop, M. McDonald, N. Hounsell, The application of parallel processing to traffic assignment or use with route guidance, Traffic Eng. Control (1991) 510-515.
41. C.A.R. Hoare, Communicating sequential processes. Commun. ACM 21 (8) (1978) 666-677.
42. M.R. Hribar, V.E. Taylor, D.E. Boyce, Choosing a shortest path algorithm. Technical Report CSE-95-004, Computer Science and Engineering, EECS Department, Northern University, 1995.
43. M.R. Hribar, V.E. Taylor, D.E. Boyce, Implementing parallel shortest path for parallel transportation applications, Parallel Comput. 27 (2001) 1537-1568.
44. M.R. Hribar, V.E. Taylor, D.E. Boyce, Termination detection for parallel shortest path algorithms, J. Parallel Distributed Comput. 55 (1998) 153-165.
45. V. Kumar, V. Singh, Scalability of parallel algorithms for the allpairs shortest path problem, J. Parallel Distr. Process. 13 (2) (1991) 124-138.
46. G. Lee, C.P. Kruskal, D.J. Kuck, An empirical study of automatic restructuring of nonnumerical programs for parallel processors, IEEE Trans. Comput. (Special Issue on Parallel Processing) Part C 34 (10) (1985) 927-933.
47. D.R. Leonard, P. Gower, User Guide to CONTRAM Version 4, TRRL Supplementary Report 735, Transport and Road Research Laboratory, Crowthorne, 1982.
48. D.R. Leonard, P. Gower, N.B. Taylor, CONTRAM: Structure of the Model, TRL Report RR178, Transport Research Laboratory, Crowthorne, UK, 1989.
49. P. Mateti, N. Deo, Parallel algorithms for the single source shortest path problem, Computing 29 (1982) 31-49.
50. Message Passing Interface Forum, MPI: a message passing interface forum, Int. J. Supercomput. Appl. High Performance Comput. 8(3/4) (1994) 165-14.
51. M. Minsky, S. Papert, On some associative, parallel and analog computations, in: E.J. Jacks (Ed.), Associative Information Technologies, Elsevier, North-Holland, New York, 1971.
52. J.F. Mondou, T.G. Crainic, S. Nguyen, Shrotest path algorithms: a computational study with C programming language, Comput. Oper. Res. 18 (1991) 767-786.
53. E.F. Moore, The shortest path through a maze, in: Proceedings of an International Symposium on the Theory of Switching, Harvard University, 1957, pp. 285-292.
54. K. Nagel, M. Rickert, Parallel implementation of the TRANSIMS micro-simulation, Parallel Comput. 27 (12) (2001) 1611-1639.
55. P. Narayanan, Single source shortest path problem on processor arrays, in: Proceedings Frontiers of Massively Parallel Computation, McLean, VA, October 1992, pp. 553-556.
56. J. Ortuzar, D. de, L.G. Willumsen, Modelling Transport, Wiley, England, 1994.
57. R.C. Paige, C.P Kruskal, Parallel algorithms for shortest path problems, IEEE (1985) 14-20.
58. S. Pallottino, Shortest path methods: complexity, interrelations and new propositions, Networks 14 (1984) 257-267.
59. S. Pallottino, M. Scutella, Shortest path algorithms in transportation models: classical and innovative aspects. Technical Report: TR-97-06, Universit di Pisa, 1997.
60. M. Papaefthymiou, J. Rodrigue, Implementing parallel shortest-paths algorithms, Department of Computer Science, Yale University, 1994.
61. U. Pape, Implementation and efficiency of Moore algorithms for the shortest route problem, Math. Programming 7 (1974) 212-222.
62. M. Pollack, W. Wiebenson, Solutions for the shortest route problem, Oper. Res. 8 (1960) 224-230.
63. L. Polymenakos, D.P. Bertsekas, Parallel shortest path auction algorithms, Parallel Comput. 20 (1994) 1221-1247.
64. M. Snir, S.W. Otto, S. Huss-Lederman, D.W. Walker, J. Dongarra, MPI: The Complete Reference, Scientific and Engineering Computation Series, MIT Press, Cambridge, MA, 1996.
65. M. Snir, S. Otto, S. Huss-Lederman, D. Walker, J. Dongarra, MPI: The Complete Reference Vol. 1 - The MPI Core, second ed., MIT Press, Cambridge, MA, 1998.
66. V. Sunderam, PVM: A framework for parallel distributed computing, Concurrency: Pract. Experience 2 (4) (1990) 315-339.
67. N.B. Taylor, CONTRAM 5: An enhanced traffic assignment model, TRL Report RR249, Transport Research Laboratory, Crowthorne, UK, 1990.
68. N.B. Taylor, Dynamic route guidance simulation with CONTRAM and ROGUS, in: Proceedings of PROMETHEUS Workshop on Traffic Related Simulation, Stuttgart, December 1992.
69. J.L. Traff, An experimental comparison of two distributed singlesource shortest path algorithms. Parallel Comput. 21 (1995) 1505-1532.
70. N. Tremblay, M. Florian, Temporal shortest paths: parallel computing implementations. Parallel Comput. 27 (2001) 1569-1609.
71. P. Tseng, O.P. Bertsekas, J.N. Tsitsiklis, Partially asynchronous, parallel algorithms for network flow and other problems, SIAM J. Control Optim. 28 (1990) 678-710.
72. D. Van Vliet, D'Esopo: a forgotten tree-building algorithm, Traffic Eng. Control UK, July-August 1977.
73. D. Van Vliet, Improved shortest path algorithms for transport networks, Transp. Res. 12 (1978) 7-20.
74. D. Van Vliet, SATURN - A modern assignment model, Traffic Eng. Control 23 (12) (1982) 578-581.
75. D. Van Vliet, M. Hall, SATURN 9.4 User Manual, W.S. Atkins, UK, 1998.
76. D.W. Walker, The design of a standard message-passing interface for distributed memory concurrent computers, Parallel Comput. 20 (4) (1994) 657-673.
77. S.A. Zenios, Parallel numerical optimization: current status and annotated bibliography, ORSA J. Comput. 1 (1) (1989) 20-43.
78. F.B. Zhan, C.E. Noon, Shortest path algorithms: an evaluation using real road networks, Transp. Sci. 32 (1) (1998) 65-73.
79. A. Ziliaskopoulos, D. Kotzinos, A massively parallel time-dependent least-time-path algorithm for intelligent transportation systems applications, Comput. Aided Civ. Infrastruct. Eng. 16 (5) (2001) 337 -346 (Special Issue: High Performance Computing).
80. A. Ziliaskopoulos, D. Kotzinos, H.S. Mahmassani, Design and implementation of parallel time-dependent least time path algorithms for intelligent transportation systems applications, Transp. Res. C 5 (2) (1997) 95-107.
81. A. Ziliaskopoulos, H.S. Mahmassani, Time-dependent, shortestpath algorithm for real-time intelligent vehicle highway system applications, Transp. Res. Rec. 1408 (1993) 94-100.
82. A. Ziliaskopoulos, H.S. Mahmassani, Design and implementation of a shortest path algorithm with time-dependent arc costs, in: Proceedings of the Fifth Advanced Technology Conference, Washington, DC, USA, 1992, pp. 1072-1093.
83. A.K. Ziliaskopoulos, H.S. Mahmassani, A note on least time path computation considering delays and prohibitions for intersection movements, Transp. Res. 30 (1996) 359-367.