Distributed computing approaches for large-scale probit-based stochastic user equilibrium problems

Journal of Advanced Transportation

Volumn 47, Issue 6, 2013, Pages 553-571

  Liu, Zhiyuan ^a   Meng, Qiang ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

distributed computing; Monte Carlo simulation; probit based stochastic user equilibrium; shortest path algorithms; stochastic network loading

Indexed keywords

COMPUTATIONAL BURDEN; DISTRIBUTED COMPUTING SYSTEMS; LARGE-SCALE NETWORK; MONTE CARLO SIMULATION METHODS; SHORTEST PATH ALGORITHMS; SHORTEST PATH PROBLEM; STOCHASTIC NETWORKS; STOCHASTIC USER EQUILIBRIUM;

DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; STOCHASTIC SYSTEMS;

MONTE CARLO METHODS;

EID: 84880355053     PISSN: 01976729     EISSN: 20423195     Source Type: Journal    
DOI: 10.1002/atr.177     Document Type: Article

References (47)

1. Patriksson M,. The Traffic Assignment Problems: Models and Methods. VSP: Utrecht, the Netherlands, 1994.
2. Sheffi Y,. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Models. Prentice-Hall, INC: Englewood Cliffs, New Jersey, 1985.
3. Wu W-X, Huang, H-J,. A new model for studying the SO-based pre-trip information release strategy and route choice behavior. Transportmetrica 2010; 6 (4): 271-290.
4. Zito P, Amato G, Amoroso S, Berrittella M,. The effect of Advanced Traveller Information Systems on public transport demand and its uncertainty. Transportmetrica 2011; 7 (1): 31-43.
5. Daganzo CF, Sheffi Y,. On stochastic models of traffic assignment. Transportation Science 1977; 11 (3): 253-274.
6. Rosa A, Maher MJ,. Algorithms for solving the probit path-based SUE traffic assignment problem with one or more user classes. Proceedings of the 15th ISTTT, Taylor MAP, (ed). Pergamon: Adelaide, Australia, 2002; 371-392.
7. Meng Q, Liu Z,. Mathematical models and computational algorithms for probit-based asymmetric stochastic user equilibrium problem with elastic demand. Transportmetrica 2011. DOI: 10.1080/18128601003736026.
8. Binder K, Heermann DW,. Monte Carlo Simulation in Statistical Physics: an Introduction. Springer-Verlag: Berlin, 1992.
9. Gentile JE,. Random Number Generation and Monte Carlo Methods. Springer Verlag: Heidelberg, 1998.
10. Rubinstein RY,. Simulation and the Monte Carlo method. John Wiley & Sons: New York, 1981.
11. Moatti A, Goldberg J, Memmi G,. Parallel Monte Carlo calculations with many microcomputers. Computer Physics Communication 1987; 45: 355-359.
12. Traynor CA, Anderson JB,. Parallel Monte Carlo calculations to determine energy differences among similar molecular structures. Chemical Physics Letters 1988; 147 (4): 389-394.
13. Esselink K, Loyens LDJC, Smit B,. Parallel Monte Carlo simulations. Physical Review E 1995; 51 (2): 1560-1568.
14. Zhao C, Wood J,. The Monte Carlo method on a parallel computer. Annals of Nuclear Energy 1989; 16 (2): 649-657.
15. Wood J, Al-Bahadili H, Khaddaj SA,. A comparison of Monte Carlo photon transport on two types of parallel computer. Annals of Nuclear Energy 1991; 18 (3): 155-166.
16. Singleton GL, Wu C-H, Tsai J-H,. A parallel Monte Carlo simulation for gaseous electronics on a dynamically reconfigurable multiprocessor system. Computer Physics Communications 1991; 66: 181-193.
17. Kennedy AD,. The hybrid Monte Carlo algorithm on parallel computers. Parallel Computing 1999; 25: 1311-1339.
18. Chen RJ, Meyer RR,. Parallel optimization for traffic assignment. Mathematical Programming 1988; 42: 327-345.
19. Hribar MR, Taylor VE, Boyce DE,. Implementing parallel shortest path for parallel transportation applications. Parallel Computing 2001; 27: 1537-1568.
20. Kumar V, Singh V,. Scalability of parallel algorithms for the all-pairs shortest-path problem. Journal of Parallel and Distributed Computing 1991; 13: 124-138.
21. Tremblay N, Florian M,. Temporal shortest paths: parallel computing implementations. Parallel Computing 2001; 27: 1569-1609.
22. Ma C-M,. Implementation of a Monte Carlo code on a parallel computer system. Parallel Computing 1994; 20: 991-1005.
23. Ben-Akiva M, Lerman SR,. Discrete Choice Analysis: Theory and Application to Travel Demand. The MIT Press: Cambridge, MA, 1985.
24. Cantarella GE,. A general fixed-point approach to multimode multi-user equilibrium assignment with elastic demand. Transportation Science 1997; 31 (2): 107-128.
25. Daganzo CF,. Stochastic network equilibrium with multiple vehicle types and asymmetric, indefinite link cost Jacobians. Transportation Science 1983; 17: 282-300.
26. Meng Q, Lee DH, Cheu RL, Yang H,. Logit based stochastic user equilibrium problem for entry exit toll schemes. Journal of Transportation Engineering 2004; 130 (6): 805-813.
27. Maher MJ, Hughes PC,. A probit-based stochastic user equilibrium assignment model. Transportation Research. Part B 1997; 31 (4): 341-355.
28. Maher MJ, Zhang X,. Formulation and algorithms for the problem of stochastic user equilibrium assignment with elastic demand. Eighth EURO Working Group meeting on Transportation, Rome, September 2000.
29. Dijkstra EW,. A note on two problems in connection with graphs (spanning tree, shortest path). Numerical Mathematics 1959; 1: 269-271.
30. Moore EF,. The shortest path through a maze. Proceedings of an International Symposium on the Theory of Switching, Harvard University, 1957; 285-292.
31. Pape U,. Implementation and efficiency of Moore-algorithms for the shortest route problem. Mathematical Programming 1974; 7: 212-222.
32. Van Vliet D,. Improved shortest path algorithms for transport networks. Transportation Research 1978; 12: 7-20.
33. Pollack M, Wiebenson W,. Solutions for the shortest route problem. Operations Research 1960; 8: 224-230.
34. Habbal M, Koutsopoulos H, Lerman S,. A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures. Transportation Science 1994; 28 (4): 292-308.
35. Traff JL,. An experimental comparison of two distributed single-source shortest path algorithms. Parallel Computing 1995; 21: 1505-1532.
36. O'Cearbhaill EA, O'Mahony M,. Parallel implementation of a transportation network model. Journal of Parallel and Distributed Computing 2005; 65: 1-14.
37. Florian M, Gendreau M,. Applications of parallel computing in transportation. Parallel Computing 2001; 27: 1521-1522.
38. Cochran WG,. Sampling Techniques. John Wiley & Sons: New York, 1977.
39. Fishman GS, Shaw TD,. Evaluating reliability of stochastic flow networks. Probability in the Engineering and Informational Sciences 1989; 3: 493-509.
40. Garica JAD, Cortez LU,. Optimum allocation in multivariate stratified sampling: multi-objective programming. Communicacion Technica 2006; I0606: 1-22.
41. Khan MGM, Ahsan MJ,. A note on optimum allocation in multivariate stratified sampling. South Pacific Journal of Natural Science 2003; 21: 91-95.
42. Rush R, Mulvey JM, Mitchell JE, Willemain TR,. Stratified filtered sampling in stochastic optimization. Journal of Applied Mathematics and Decision Sciences 2000; 4 (1): 17-38.
43. Gropp W, Lusk E, Skjellum A,. Using MPI: Portable Parallel Programming with the Message-passing Interface. The MIT Press: Cambridge, MA, 1999.
44. Nagel K, Rickert M,. Parallel implementation of the TRANSIMS micro-simulation. Parallel Computing 2001; 27: 1161-1639.
45. Wong SC, Wong CK, Tong CO,. A parallelized genetic algorithm for the calibration of Lowry model. Parallel Computing 2001; 27: 1523-1536.
46. Bar-Gera H,. Transportation Network Test Problems Website. 2010. http://www.bgu.ac.il/~bargera/tntp/ [accessed at Sep 8, 2010].
47. Demeulemeester E, Dodin B, Herroelen W,. A random activity network generator. Operations Research 1993; 41 (5): 972-980.