Adjustable preference path strategies for use in multicriteria, stochastic, and time-varying transportation networks

Transportation Research Record

Volumn , Issue 1923, 2005, Pages 137-143

  Opasanon, Sathaporn ^a   Miller Hooks, Elise ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HIGHWAY TRAFFIC CONTROL; OPTIMIZATION; REAL TIME SYSTEMS;

DEPARTURE TIMES; REAL-TIME PATH-FINDING ASSISTANCE; TIME-VARYING TRANSPORTATION NETWORKS;

STOCHASTIC CONTROL SYSTEMS;

EID: 33645690685     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1923-15     Document Type: Conference Paper

References (23)

1. Gallo, G., G. Longo, S. Pallottino, and S. Nguyen. Directed Hypergraphs and Applications. Discrete Applied Mathematics, Vol. 42, 1993, pp. 177-201.
2. Chen, T.-Y., H.-L. Chang, and G.-H. Tzeng. Using a Weight-Assessing Model to Identify Route Choice Criteria and Information Effects. Transportation Research Part A, Vol. 35, 2001, pp. 197-224.
3. Hall, R. Fastest Path through a Network with Random Time-Dependent Travel Times. Transportation Science, Vol. 20, No. 3, 1986, pp. 182-188.
4. Miller-Hooks, E., and H. Mahmassani. Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks. Transportation Science, Vol. 34, No. 2, 2000, pp. 198-215.
5. Pretolani, D. A Directed Hypergraph Model for Random Time Dependent Shortest Paths. European Journal of Operational Research, Vol. 123, 2000, pp. 315-324.
6. Martins, E. Q. V. On a Multicriteria Shortest Path Problem. European Journal of Operational Research, Vol. 16, 1984, pp. 236-245.
7. Corley, H. W., and I. D. Moon. Shortest Path in Networks with Vector Weights. Journal of Optimization Theory and Applications, Vol. 46, No. 1, 1985, pp. 79-86.
8. Nozick, L. K., G. F. List, and M. A. Turnquist. Integrated Routing and Scheduling in Hazardous Materials Transportation. Transportation Science, Vol. 31, No. 3, 1997, pp. 200-215.
9. Wijeratne, A. B., M. A. Turnquist, and P. B. Mirchandani. Multiobjective Routing of Hazardous Materials in Stochastic Networks. European Journal of Operational Research, Vol. 65, 1993, pp. 33-43.
10. Miller-Hooks, E., and H. S. Mahmassani. Optimal Routing of Hazardous Materials in Stochastic, Time-Varying Transportation. In Transportation Research Record 1645, TRB, National Research Council, Washington, D.C., 1998, pp. 143-151.
11. Ahuja, R., T. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, N.J., 1993, Chapts. 4, 5.
12. Chang, T. S., L. K. Nozick, and M. A. Turnquist. Multi-Objective Path-Finding in Stochastic Dynamic Networks, with Application to Routing Hazardous Materials Shipments. Transportation Science, in press.
13. Nielsen, L. R., K. A. Andersen, and D. Pretolani. Bicriterion Shortest Hyperpaths in Random Time-Dependent Networks. IMA Journal of Management Mathematics, Vol. 14, No. 3, 2003, pp. 271-303.
14. Opasanon, S., and E. Miller-Hooks. Multicriteria Adaptive Hyperpaths in Stochastic, Time-Varying Networks. European Journal of Operational Research, in press.
15. Wie, B.-W., R. L. Tobin, and M. Carey. The Existence, Uniqueness and Computation of an Arc-Based Dynamic Network User Equilibrium Formulation. Transportation Research Part B, Vol. 36, 2002, pp. 897-918.
16. Jang, W., B. Ran, and K. Choi. A Discrete Time Dynamic How Model and a Formulation and Solution Method for Dynamic Route Choice. Transportation Research Part B, in press, 2005.
17. Loui, R. P. Optimal Paths in Graphs with Stochastic or Multidimensional Weights. Communications of the ACM, Vol. 26, 1983, pp. 670-676.
18. Eiger, A., P. B. Mirchandani, and H. Soroush. Path Preferences and Optimal Paths in Probabilistic Networks. Transportation Science, Vol. 19, No. 1, 1985, pp. 75-84.
19. Henig, M. I. The Shortest Path Problem with Two Objective Functions. European Journal of Operational Research, Vol. 25, 1985, pp. 281-291.
20. Mirchandani, P. B., and H. Soroush. Optimal Paths in Probabilistic Networks: A Case with Temporary Preferences. Computers and Operations Research, Vol. 12, No. 4, 1985, pp. 365-381.
21. Modesti, P., and A. Sciomachen. A Utility Measure for Finding Multi-objective Shortest Paths in Urban Multimodal Transportation Networks. European Journal of Operational Research, Vol. 111, 1998, pp. 495-508.
22. Orda, A., and R. Rom. Shortest-Path and Minimum-Delay Algorithms in Networks with Time-Dependent Edge-Length. Journal of the Association for Computing Machinery, Vol. 37, No. 3, 1990, pp. 607-625.
23. Opasanon, S. On Finding Paths and Flows in Multicriteria, Stochastic and Time-Varying Networks. Ph.D. dissertation. University of Maryland, College Park, 2004.