An oriented spanning tree based genetic algorithm for multi-criteria shortest path problems

Applied Soft Computing Journal

Volumn 12, Issue 1, 2012, Pages 506-515

  Liu, Linzhong ^a   Mu, Haibo ^a   Yang, Xinfeng ^a   He, Ruichun ^a   Li, Yinzhen ^a  

^a LANZHOU JIAOTONG UNIVERSITY   (China)

Author keywords

Genetic algorithm; Network; Shortest path problem

Indexed keywords

COMPUTATIONAL TESTS; CONSTRAINED SHORTEST PATH; EVOLUTION OPERATOR; GLOBAL SEARCH CAPABILITY; LOCAL SEARCH; MULTI-CRITERIA; MUTATION MECHANISM; SHORTEST PATH PROBLEM; SPANNING TREE;

ENCODING (SYMBOLS); NETWORKS (CIRCUITS); PARALLEL ARCHITECTURES; TREES (MATHEMATICS);

GENETIC ALGORITHMS;

EID: 81155139678     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2011.08.015     Document Type: Article

References (35)

1. Dijkstra E.W. A note on two problems in connection with graphs Numerical Mathematics 1 1959 269 271
2. Dantzig G.B. On the shortest route through a network Management Science 7 1960 187 190
3. Magnanti T.L., and Wong R.T. Network design and transportation planning: models and algorithms Transportation Science 18 1984 1 55 (Pubitemid 14547792)
4. Daskin M.S. Network and Discrete Location 1995 John Wiley and Sons New York
5. Marti R., Velarde J.L.G., and Duartec A. Heuristics for the bi-objective path dissimilarity problem Computers & Operations Research 36 2009 2905 2912
6. Yongtaek L., and Sungmo R. A efficient dissimilar path searching method for evacuation routing Transportation Engineering 14 2010 61 67
7. W. Fan, R.B. Machemehl, Optimal transit route network design problem: algorithms, implementations, and numerical results, Tech. Rep. 167244-1, Center for Transportation Research, University of Texas at Austin, 5, 2004.
8. Curtin K.M., and Biba S. The transit route arc-node service maximization problem European Journal of Operational Research 208 2011 46 56
9. Aifadopoulou G., Ziliaskopoulos A., and Chrisohoou E. Multiobjective optimum path algorithm for passenger pretrip planning in multimodal transportation networks Journal of the Transportation Research Board 2032/2007 2008 26 34 (Pubitemid 351333789)
10. Kim B.K., Jo J.B., Kim J.R., and Gen M. Optimal route search in car navigation systems by multi-objective genetic algorithms International Journal of Information Systems for Logistics and Management 4 2009 9 18
11. Deo N., and Pang C. Shortest-path algorithms: taxonomy and annotation Networks 14 1984 275 323
12. Current J.R., Revelle C.S., and Cohon J.L. The shortest covering path problem: an application of locational constraints to network design Journal of Regional Science 24 1984 161 185
13. Current J.R., Pirkul H., and Rolland E. Efficient algorithms for solving the shortest covering path problem Transportation Science 28 1994 317 327
14. Handler G.Y., and Zang I. A dual algorithm for the constrained shortest path problem Networks 10 1980 293 310
15. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman New York
16. Lin L., and Gen M. A bicriteria shortest path routing problems by hybird genetic algorithm in communication networks in: 2007 IEEE Congress on Evolutionary Computation 2007 4577 4582
17. Gen M., and Cheng R. Genetic Algorithms & Engineering Optimization 2000 Wiley New York
18. Cheng L., and Yang S.X. Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks in: 2009 IEEE Congress on Evolutionary Computation 2009 3135 3140
19. A. Y. Hamed. A genetic algorithm for finding the k shortest paths in a network. Egyptian Informatics Journal 10 (2010) 75-79.
20. Mohamed C., Bassem J., and Taicir L. A genetic algorithms to solve the bicriteria shortest path problem Electronic Notes in Discrete Mathematics 36 2010 851 858
21. Horoba C. Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem Evolutionary Computation 18 2010 357 381
22. Szidarovsky F., Gershon M.E., and Dukstein L. Techniques for Multiobjective Decision Making in Systems Management 1986 Elsevier New York
23. Modesti P., and Sciomachen A. A utility measure for finding multi-objective shortest paths in urban multimodal transportation networks European Journal of Operational Research 111 1998 495 508 (Pubitemid 128410908)
24. Holland J. Adaptation in Natural and Artificial Systems 1975 University of Michigan Press Ann Arbor
25. Bondy J., and Murty U. Graph Theory with Application 1976 The Macmillan Ltd New York
26. Goldberg D. Genetic Algorithm in Search, Optimization and Machine Learning 1989 Addison-Wesley MA
27. Baker J.E. Adaptive selection methods for genetic algorithm in: Proceedings of 1st International Conference on Genetic Algorithms 1985 101 111
28. Fonseca C., and Fleming P. Genetic algorithm for multiobjective optimization: formulation, discussion and generalization in: Proceedings of 5th International Conference on Genetic Algorithms 1993 17 22
29. Srinivas N., and Deb K. Multiobjective optimization in genetic algorithms Evolutionary Computation 2 1995 221 248
30. Horn J., Nafpliotis N., and Goldberg D. A niched pareto genetic algorithm for multiobjective optimization in: Proceedings of the 1st IEEE Conference on Evolutionary Computation 1994 82 87
31. Fonseca C., and Fleming P. An overview of evolutionary algorithms in multiobjective optimization Evolutionary Computation 3 1995 1 16
32. Tamaki F., Kita H., and Kobayashi S. Multiobjective optimization by genetic algorithm: a review Fukuda T. Furuhashi T. in: Proceedings of the 1996 International Conference on Evolutionary Computation 1996 517 522
33. Schaffer J. Multiple objective optimization with vector evaluated genetic algorithm in: Proceedings of the First International Conference on Genetic Algorithms, Genetic Algorithms and their Applications 1985 93 100
34. Batagelj V., and Brandes U. Efficient generation of large random networks in: Proceedings of the Sunbelt XXIV Social Conference 2004 12 16
35. Liu B. Theory and Practice of Uncertain Programming 2002 Physica-verlag Heidelberg New York