Multi-objective α-reliable path finding in stochastic networks with correlated link costs: A simulation-based multi-objective genetic algorithm approach (SMOGA)

Expert Systems with Applications

Volumn 38, Issue 3, 2011, Pages 1515-1528

  Ji, Zhaowang ^a   Kim, Yong Seog ^b   Chen, Anthony ^a  

^a Utah State University   (United States)

^b UTAH STATE UNIVERSITY   (United States)

Author keywords

Chance constrained model; Genetic algorithm; Multi objective path finding; Pareto paths; Travel time reliability

Indexed keywords

CHANCE-CONSTRAINED; CHANCE-CONSTRAINED MODEL; CHICAGO; CORRELATED LINK COSTS; FILTER MODULE; GENETIC OPERATORS; GENETIC REPRESENTATIONS; GRAPHICAL REPRESENTATIONS; INITIAL POPULATION; LINK TRAVEL TIME; MONTE CARLO SIMULATION; MULTI OBJECTIVE; MULTI-OBJECTIVE GENETIC ALGORITHM; MULTIOBJECTIVE PROGRAMMING; MUTATION OPERATORS; NUMERICAL RESULTS; OBJECTIVE SPACE; OPTIMAL PATHS; PARETO PATHS; PATH FINDING; SIMPLIFIED MODELS; SIMULATION MODULES; SIMULATION-BASED; SOLUTION SPACE; STOCHASTIC NETWORKS; TRAVEL TIME; TRAVEL TIME RELIABILITY;

BUDGET CONTROL; COMBINATORIAL MATHEMATICS; GENETIC ALGORITHMS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MONTE CARLO METHODS; MULTIOBJECTIVE OPTIMIZATION; PARETO PRINCIPLE; POPULATION STATISTICS; RELIABILITY; STOCHASTIC SYSTEMS; TRAFFIC CONTROL;

COMPUTER SIMULATION;

EID: 78049528735     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.07.064     Document Type: Article

References (48)

1. M. Abdel-Aty, R. Kitamura, and P. Jovanis Exploring route choice behavior using geographical information system-based alternative routes and hypothetical travel time information input Transportation Research Record 1493 1995 74 80
2. C.W. Ahn, and C.W. Ramakrishna A genetic algorithm for shortest path routing problem and the sizing of populations IEEE Transactions on Evolutionary Computation 6 6 2002 566 579
3. Bar-Gera, H. (2001). Website of transportation network test problems. .
4. M.G.H. Bell, and Y. Iida Transportation network analysis 1997 John Wiley & Sons New York 216 p.
5. R.E. Bellman On a routing problem Quarterly Applied Mathematics 16 1958 87 90
6. D. Brownstone, A. Ghosh, T.F. Golob, C. Kazimi, and D. Van Amelsfort Drivers' willingness-to-pay to reduce travel time: Evidence from the San Diego I-15 congestion pricing project Transportation Research 37A 4 2003 373 387
7. A. Chen, and Z. Ji Path finding under uncertainty Journal of Advanced Transportation 39 1 2005 19 37
8. A. Chen, H. Yang, H.K. Lo, and W.H. Teng Capacity reliability of a road network: An assessment methodology and numerical results Transportation Research Part B 36 2002 225 252
9. K. Deb, A. Sameer, and T. Meyarivan A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Transactions on Evolutionary Computation 6 2 2002 182 197
10. E.W. Dijkstra A note on two problems in connection with graphs Numerical Mathematics 1 1959 269 271
11. Y. Fan, R. Kalaba, and J. Moore Arriving on time Journal of Optimization Theory and Applications 127 3 2005 497 513
12. Y. Fan, R. Kalaba, and J. Moore Shortest paths in stochastic networks with correlated link costs Computers and Mathematics with applications 49 2005 1549 1564
13. R.W. Floyd Algorithm 97-Shortest path Communications of ACM 5 1962 345
14. H. Frank Shortest paths in probabilistic graphs Operations Research 17 4 1969 583 599
15. L. Fu An adaptive routing algorithm for in-vehicle route guidance systems with real-time information Transportation Research 35B 2001 749 765
16. L. Fu, and L.R. Rilett Expected shortest paths in dynamic and stochastic traffic networks Transportation Research 32B 1998 499 516
17. Gao, S. (2005). Optimal adaptive routing and traffic assignment in stochastic time-dependent networks. Ph.D. Dissertation. Massachusetts Institute of Technology, 237 p.
18. S. Gao, and I. Chabini Optimal routing policy problems in stochastic time-dependent networks Transportation Research B 40 2 2006 93 122
19. M.R. Garey, and D.S. Johnson Computers and intractability: A guide to the theory of NP-completeness 1979 W.H. Freeman San Francisco
20. M. Gen, and R. Cheng Genetic algorithms & engineering optimization 2000 John Wiley & Sons, Inc.
21. Gomez-Sanchez, M. A. (2001). Genetic algorithms and simulation applied to optimization: The stochastic shortest path model. Ph.D. Dissertation, New Mexico State University.
22. R. Hall The fastest path through a network with random time-dependent travel times Transportation Science 20 1986 182 188
23. Horn, J.; Nafpliotis, N.; & Goldberg, D. (1994). A niched Pareto genetic algorithm for multiobjective optimization. In Proceedings of the fifth international conference on genetic algorithms (pp. 416-423). San Mateo: Morgan Kauffman.
24. Ji, Z. & Chen, A. (2005). Finding the α-reliable path in stochastic networks. Working paper, Utah State University.
25. Lam, T. (2000). The effect of variability of travel time on route and time-of-day choice. Ph.D. Dissertation, Department of Economics, University of California, Irvine, 194 p.
26. A.M. Law, and W.D. Kelton Simulation modeling and analysis 2000 McGraw-Hill
27. B. Liu Uncertainty programming 1999 John Wiley and Sons, Inc New York
28. R.P. Loui Optimal paths in graphs with stochastic or multidimensional weights Communications of the ACM 26 9 1983 670 676
29. Miller-Hooks, E. (1997). Optimal routing in time-varying, stochastic networks: Algorithms and implementations. Ph.D. Dissertation, University of Texas at Austin, USA, 262 p.
30. P.B. Mirchandani, and H. Soroush Optimal paths in probabilistic networks: A case with temporary preferences Computers and Operations Research 12 4 1985 365 383
31. P. Mooney, and A. Winstanley An evolutionary algorithm for multicriteria path optimization problems International Journal of Geographical Information Science 20 4 2006 401 423
32. Munemoto, M.; Takai, Y.; & Sato, Y. (1998). A migration scheme for the gentic adaptive routing algorithm. In Proceeding of IEEE international conference on systems, man and cybernetics, October 11-14, San Diego (pp. 2774-2779).
33. I. Murthy, and S. Sarkar A relaxation-based pruning technique for a class of stochastic shortest path problems Transportation Science 30 3 1996 220 236
34. Y. Nie, and Y. Fan Arriving-on-time problem: Discrete algorithm that ensures convergence Transportation Research Record 1964 2006 193 200
35. Y. Nie, and X. X. Wu Shortest path problem considering on-time arrival probability Transportation Research Part B 43 2009 597 613
36. Nie, Y. & X. Wu, X. (2009b). Reliable a priori shortest path problem with limited spatial and temporal dependencies. In Proceeding of the 18th International symposium on transportation and traffic theory (ISTTT) (pp. 169-196).
37. A. Osyczka, and S. Kundu A new method to solve generalized multicriteria optimization problems using the simple genetic algorithm Structural Optimization 10 1995 94 99
38. J.M.A. Pangilinan, and G.K. Janssens Evolutionary algorithms for the multiobjective shortest path problem International Journal of Applied Science, Engineering and Technology 4 1 2007 1307 4318
39. G.H. Polychronopoulos, and J.N. Tsitsiklis Stochastic shortest path problems with recourse Networks 27 2 1996 133 143
40. Schaffer, J. D. (1984). Some experiments in machine learning using vector evaluated genetic algorithms. Ph.D. Dissertation, Vanderbilt University, USA.
41. S. Sen, R. Pillai, S. Joshi, and A. Rathi A mean-variance model for route guidance in advanced traveler information systems Transportation Science 35 2001 37 49
42. R. Sivakumar, and R. Batta The variance-constrained shortest path problem Transportation Science 28 1994 309 316
43. Small, K.A.; Noland, R.; Chu, X.; & Lewis, D. (1999). Valuation of travel-time savings and predictability in congested conditions for highway user-cost estimation. NCHRP Report 431, Transportation Research Board, National Research Council, USA.
44. N. Srinivas, and K. Deb Multiobjective function optimization using nondominated sorting genetic algorithms Evolutionary Computation 2 3 1995 221 248
45. S.T. Waller, and A.K. Ziliaskopoulos On the online shortest path problem with limited arc cost dependencies Networks 40 2002 216 227
46. G. Yu, and J. Yang On the robust shortest path problem Computers and Operations Research 25 1998 457 468
47. Zhou, Z. (2008). Models and algorithms for addressing travel time variability: Applications from optimal path finding and traffic equilibrium problems. Ph.D. Dissertation, Utah State University.
48. A.K. Ziliaskopoulos, and H.S. Mahmassani Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications Transportation Research Record 1408 1993 94 100