Finding multi-objective paths in stochastic networks: A simulation-based genetic algorithm approach

Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004

Volumn 1, Issue , 2004, Pages 174-180

  Ji, Zhaowang ^a   Chen, Anthony ^a   Subprasom, Kitti ^a  

^a Utah State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT TRANSPORTATION SYSTEM (ITS); SHORTEST PATH (SP); STANDARD DEVIATION; STOCHASTIC NETWORKS;

COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; COSTS; DECISION MAKING; NEURAL NETWORKS; OPTIMIZATION; RANDOM PROCESSES;

GENETIC ALGORITHMS;

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

References (20)

1. Bellman, E., "On a routing problem," Quarterly of Applied Mathematics, vol. 16, pp. 87-90, 1958.
2. Dijkstra, E.W., "A note on two problems in connection with graphs," Numerical Mathematics, vol. 1, pp. 269-271, 1959.
3. Dantzig, G.B., "On the shortest route through a network," Management Science, vol. 6, pp. 187-190, 1960.
4. Loui, P., "Optimal paths in graphs with stochastic or multidimensional weights," Communications of ACM, vol. 26, pp. 670-676, 1960.
5. Mirchadani, B.P. and Soroush, H., "Optimal paths in probabilistic networks: a case with temporary preference," Computers and Operations Research, vol. 12, no. 4, pp. 365-383, 1985.
6. Mirchadani, B.P. and Soroush, H., "Routes and flows in stochastic networks," Advanced Schools on Stochastic in Combinatorial Optimization (Eds G. Agnrealtta, F. Mason and P. Serafini), CISM, Udine, Italy, pp. 129-177, 1985.
7. Murthy, I. and Sarkar, S., "A relaxation-based pruning technique for a class of stochastic shortest path problems," Transportation Science, vol. 30, no. 3, pp. 220-236, 1996.
8. Miller-Hooks, E. and Mahmassani, H., "Least possible time paths in stochastic, time-varying networks," Computers and Operations Research, vol. 25, pp. 1107-1125, 1998.
9. Fu, L. and Rilett, L.R., "Expected shortest paths in dynamic and stochastic traffic networks," Transportation Research, vol.32B, no. 7, pp. 499-516, 1998.
10. Miller-Hooks, E. and Mahmassani, H., "Least expected time paths in stochastic, time-varying transportation networks," Transportation Science, vol. 34, no. 2, pp. 198-215, 2000.
11. th Annual Meeting of the Transportation Research Board, Washington, D.C., 2002.
12. Abdel-Aty, M., Kitamura, R., and Jovanis, P., "Investigating effect of travel time variability on route choice using repeated measurement stated preference data," Transportation Research Record 1493, pp. 39-45, 1996.
13. Markowitz, H. Mean-Variance Analysis in Portfolio Choice and Capital Markets, New Hope, Pennsylvania, 1927.
14. Goldberg, D., Genetic algorithms in search, optimization and machine learning, Addison-Wesley, MA, 1989.
15. Osyczka, A., Evolutionary Algorithms for Single and Multicriteria Design Optimization, Physica-Verlag, 2002.
16. Osyczka, A., and S. Kundu., "A new method to solve generalized multicriteria optimization problems using the simple genetic algorithm," Structural Optimization, Vol.10, pp. 94-99, 1995.
17. Gen, M. and Cheng, R., Genetic algorithms & engineering optimization, John Wiley & Sons, Inc. 2000.
18. Gomez-Sanchez, M.A., Genetic algorithms and simulation applied to optimization: the stochastic shortest path model, Ph.D Dissertation, New Mexico State University, 2001.
19. Sheffi, Y. Urban transportation networks: Equilibrium analysis with mathematical programming methods, Prentice Hall, England Cliffs, NJ. 1985.
20. Suwansirikul, C. and Friesz, T.L. "Equilibrium decomposed optimization: a heuristic for the continuous equilibrium network design problem," Transportation Science, vol. 21, no. 4, pp. 254-263, 1987.