A simulated annealing for multi-criteria network path problems

Computers and Operations Research

Volumn 39, Issue 12, 2012, Pages 3119-3135

  Liu, Linzhong ^a   Mu, Haibo ^a   Luo, Haiyan ^a   Li, Xiaojing ^a  

^a LANZHOU JIAOTONG UNIVERSITY   (China)

Author keywords

Evolutionary algorithm; Multi criteria optimization; Network; Path problem; Simulated annealing

Indexed keywords

COMPUTATIONAL COMPARISONS; CONSTRAINED SHORTEST PATH; EVOLUTION OPERATOR; EVOLUTIONARY ALGORITHMS (EAS); GLOBAL SEARCH CAPABILITY; MULTI-CRITERIA; MULTICRITERIA OPTIMIZATION; NETWORK PATHS; PATH PROBLEMS; SEARCH ALGORITHMS; SEARCHING MECHANISM; SHORTEST PATH PROBLEM; SPANNING TREE;

EVOLUTIONARY ALGORITHMS; NETWORKS (CIRCUITS); SIMULATED ANNEALING;

GRAPH THEORY;

EID: 84862984225     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.03.013     Document Type: Article

References (55)

1. C.W. Ahn, and R. Ramakrishna A genetic algorithm for shortest path routing problem and the sizing of populations IEEE Transaction on Evolutionary Computation 6 2002 566 579
2. V. Akgun, E. Erkut, and R. Batta On finding dissimilar paths European Journal of Operational Research 121 2000 232 246 (Pubitemid 30531543)
3. P. Avella, M. Boccia, and A. Sforza A penalty function heuristic for the resource constrained shortest path problem European Journal of Operational Research 142 2002 221 230 (Pubitemid 34803129)
4. A. Azaron, and F. Kianfar Dynamic shortest path in stochastic dynamic networks: ship routing problem European Journal of Operational Research 144 2003 138 156
5. S. Bandyopadhyay A simulated annealing-based multiobjective optimization algorithm: AMOSA IEEE Transactions on Evolutionary Computation 39 2008 268 283
6. J.A. Bondy, and U.S.R. Murty Graph theory with application 1976 The Macmillan Ltd New York
7. W.M. Carlyle, and R.K. Wood Near-shortest and k-shortest simple paths Networks 42 2005 98 109 (Pubitemid 41290486)
8. A. Charnes, and W. Copper Chance-constrained programming Management Science 6 1959 73 79
9. A. Chen, J. Oh, D. Park, and W. Recker Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs Applied Mathematics and Computation 217 2011 3020 3031
10. Cheng L, Yang SX. Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks. In: 2009 IEEE congress on evolutionary computation; 2009. p. 3135-40.
11. K.L. Cooke, and E. Halsey The shortest route through a network with time-dependent internodal transit times Journal of Mathematical Analysis and Applications 14 1966 493 498
12. K.M. Curtin, and S. Biba The transit route arc-node service maximization problem European Journal of Operational Research 208 2011 46 56
13. G.B. Dantzig On the shortest route through a network Management Science 7 1960 187 190
14. M.S. Daskin Network and discrete location 1995 John Wiley and Sons New York
15. C. Davies, and P. Lingras Genetic algorithms for routing shortest paths in dynamic and stochastic networks European Journal of Operational Research 144 2003 27 38
16. E.W. Dijkstra A note on two problems in connection with graphs Numerical Mathematics 1 1959 269 271
17. R.W. Eglese Simulated annealing: a tool for operational research European Journal of Operational Research 46 1990 271 281 (Pubitemid 20720808)
18. F. Ergun, R. Sinha, and L. Zhang An improved FPTAS for restricted shortest path Information Processing Letters 83 2002 287 291 (Pubitemid 34704436)
19. W. Fan, and R.B. Machemehl Optimal transit route network design problem with variable transit demand: genetic algorithm approach Journal of Transportation Engineering 132 2006 40 51 (Pubitemid 43124787)
20. W. Fan, and R.B. Machemehl Using a simulated annealing algorithm to solve the transit route network design problem Journal of Transportation Engineering 132 2006 122 132 (Pubitemid 43119042)
21. L. Fogel, A. Owens, and M. Walsh Artificial intelligence through simulated evolution 1996 Wiley New York
22. T. Forgarty Evolutionary computing 1994 Springer-Verlag Berlin
23. M.R. Garey, and D.S. Johnson Computers and intractability: a guide to the theory of NP-completeness 1979 Freeman New York
24. S. Geman, and D. Geman Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images IEEE Transactions on Pattern Analysis and Machine Intelligence 6 1984 721 7410
25. M. Gen, and R. Cheng Genetic algorithms & engineering optimization 2000 Wiley New York
26. G.Y. Handler, and I. Zang A dual algorithm for the constrained shortest path problem Networks 10 1980 293 310
27. C. Horoba Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem Evolutionary Computation 18 2010 357 381
28. H.J. Huang, and Z.C. Li A multiclass, multicriteria logit-based traffic equilibrium assignment model under ATIS European Journal of Operational Research 160 2006 560 571
29. M. Iori, S. Martello, and D. Pretolani An aggregate label setting policy for the multi-objective shortest path problem European Journal of Operational Research 207 2010 489 14968
30. P.A. Jensen, and J.W. Barnes Network flow programming 1980 Johy Wiley & Sons New York
31. H. Kanoh Dynamic route planning for car navigation systems using virus genetic algorithms International Journal of Knowledge-based and Intelligent Engineering Systems 11 2007 65 78
32. I.R. Karas, and U. Atila A genetic algorithm approach for finding the shortest driving time on mobile devices Scientific Research and Essays 6 2011 394 405
33. B.K. Kim, J.B. Jo, J.R. Kim, and M. Gen 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
34. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by simulated annealing Science 220 1983 671 679
35. D. Klingman, A. Napier, and J. Stutz A program for generating large scale capacitated assignment, transportation, and minimum-cost flow network problems Management Science 20 1974 814 820
36. Lin L, Gen M. A bicriteria shortest path routing problems by hybrid genetic algorithm in communication networks. In: 2007 IEEE congress on evolutionary computation; 2007. p. 4577-2.
37. B. Liu Theory and practice of uncertain programming 2002 Physica-Verlag Heidelberg/New York
38. L. Liu, H. Mu, X. Yang, R. He, and Y. Li An oriented spanning tree based genetic algorithm for multi-criteria shortest path problems Applied Soft Computing 12 2012 506 515
39. Lup LW, Srinivasan RD. A hybrid evolutionary algorithm for dynamic route planning. In: 2007 IEEE congress on evolutionary computation; 2007. pp. 2743-9.
40. T.L. Magnanti, and R.T. Wong Network design and transportation planning: models and algorithms Transportation Science 18 1984 1 55 (Pubitemid 14547792)
41. M.K. Mainali, S. Mabu, S. Yu, S. Eto, and K. Hirasawaa Dynamic optimal route search algorithm for car navigation systems with preferences by dynamic programming IEEJ Transactions on Electrical and Electronic Engineering 6 2011 14 22
42. Maria J, Pangilinan A, Janssens GK. Evolutionary algorithms for the multiobjective shortest path planning problem. In: World academy of science, engineering and technology, vol. 25; 2007. p. 205-10.
43. R. Marti, J.L.G. Velarde, and A. Duartec Heuristics for the bi-objective path dissimilarity problem Computers & Operations Research 36 2009 2905 2912
44. E.D. Miller-Hooks, and H.S. Mahmassani Least possible time paths in stochastic time-varying networks Computer Operational Research 25 1998 1107 1125
45. C. Mohamed, J. Bassem, and L. Taicir A genetic algorithms to solve the bicriteria shortest path problem Electronic Notes in Discrete Mathematics 36 2010 851 858
46. S. Okada Fuzzy shortest path problems incorporating interactivity among paths Fuzzy Sets and Systems 142 2004 335 357
47. M.S. Osman, M.A. Abo-Sinna, and A.A. Mousa An effective genetic algorithm approach to multiobjective routing problems Applied Mathematics and Computation 163 2005 769 781 (Pubitemid 40219919)
48. P. Pattanamekar, D. Park, and L.R. Rilett Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty Transportation Research Part C 11 2003 331 354 (Pubitemid 37216401)
49. A. Raith, and M. Ehrgott A comparison of solution strategies for biobjective shortest path problems Computers & Operations Research 30 2009 1299 1331
50. L. Santos, J. Coutinho-Rodrigues, and J.R. Current An improved solution algorithm for the constrained shortest path problem Transportation Research Part B 41 2007 756 771 (Pubitemid 46655556)
51. A.J.V. Skriver, and K.A. Andersen A label correcting approach for solving bicriterion shortest-path problems Computers & Operations Research 27 2000 507 524 (Pubitemid 30218481)
52. F. Szidarovsky, M.E. Gershon, and L. Dukstein Techniques for multiobjective decision making in systems management 1986 Elsevier New York
53. H.F. Wang, and L. Hsueh-Ling User equilibrium in traffic assignment problem with fuzzy N-A incidence matrix Fuzzy Sets and Systems 107 1999 245 253
54. S. Yang, H. Cheng, and F. Wang Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks IEEE Transactions on Systems, Man, and Cybernetics Part C 40 2010 52 63
55. K.G. Zografos, and K.N. Androutsopoulos Algorithms for itinerary planning in multimodal transportation networks Transportation System 9 2008 175 184 (Pubitemid 351337440)