A modified ant colony system for finding the expected shortest path in networks with variable arc lengths and probabilistic nodes

Applied Soft Computing Journal

Volumn 21, Issue , 2014, Pages 491-500

  Farhanchi, Mojtaba ^a   Hassanzadeh, Reza ^b   Mahdavi, Iraj ^b   Mahdavi Amiri, Nezam ^c  

^a Hamedan Science and Technology Park   (Iran)

^b DEPARTMENT OF INDUSTRIAL ENGINEERING   (Iran)

^c SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Ant colony system (ACS); Expected shortest path; Probabilistic nodes; Random arc lengths; Stochastic networks

Indexed keywords

ANT COLONY OPTIMIZATION; STOCHASTIC SYSTEMS;

ANT COLONY SYSTEMS; ARC LENGTH; PROBABILISTIC NODES; SHORTEST PATH; STOCHASTIC NETWORKS;

GRAPH THEORY;

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

References (28)

1. C. Alexopoulos State space partitioning methods for stochastic shortest path problem Network 30 1997 9 12
2. A. Baykasoglu, T. Dereli, and I. Sabuncu An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems Omega 34 2006 385 396 (Pubitemid 41644498)
3. E. Bellman On a routing problem Quart. Appl. Math. 16 1958 87 90
4. Y. Bin, Y. Zhong-Zhen, and Y. Baozhen An improved ant colony optimization for vehicle routing problem Eur. J. Oper. Res. 196 2009 171 176
5. B. Bullnheimer Ant Colony Optimization in Vehicle Routing Doctoral Thesis 1999 University of Vienna Austria
6. B. Bullnheimer, R.F. Hartl, and C. Strauss An improved ant system algorithm for the vehicle routing problem Ann. Oper. Res. 89 2001 319 328
7. C.B. Chenga, and C.P. Maob A modified ant colony system for solving the travelling salesman problem with time windows Math. Comput. Model. 46 2007 1225 1235
8. D. Costa, and A. Hertz Ants can color graphs J. Oper. Res. Soc. 48 1997 295 305
9. A. Colorni, M. Dorigo, and V. Maniezzo Distributed optimization by ant colonies Proceedings of ECAL91 - European Conference on Artificial Life Paris, France 1991 134 142
10. G. DiCaro, and M. Dorigo AntNet: distributed stigmergetic control for communications networks J. Artif. Intell. Res. 9 1998 317 365 (Pubitemid 128636207)
11. E.W. Dijkstra A note on two problems in connection with graphs Numer. Math. 1 1959 269 271
12. M. Dorigo, and L.M. Gambardella Ant colony system: a cooperative learning approach to the traveling salesman problem IEEE Trans. Evol. Comput. 1 1 1997 53 66 (Pubitemid 127771018)
13. S. Dreyfus An appraisal of some shortest path algorithms Oper. Res. 17 1969 395 412
14. Y.Y. Fan, R.E. Kalaba, and J.E. Moore Shortest paths in stochastic networks with correlated link costs Comput. Math. Appl. 49 2005 1549 1564 (Pubitemid 41101303)
15. L.M. Gambardella, E. Taillard, and M. Dorigo Ant colonies for the quadratic assignment problem J. Oper. Res. Soc. 50 1999 167 176
16. M. Gravel, W.L. Price, and C. Gagne Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic Eur. J. Oper. Res. 143 2002 218 229
17. W. Gutjahr A graph-based ant system and its convergence Future Gen. Comput. Syst. 16 2000 873 888
18. X. Ji Models and algorithm for stochastic shortest path problem Appl. Math. Comput. 170 2005 503 514 (Pubitemid 41454827)
19. V.G. Kulkarni Shortest paths in networks with exponentially distributed arc lengths Networks 16 1986 255 274 (Pubitemid 18633397)
20. V. Maniezzo, and A. Colorni The ant system applied to the quadratic assignment problem IEEE Trans. Knowl. Data Eng. 11 1999 769 784
21. S. Mazzeo, and I. Loiseau An ant colony algorithm for the capacitated vehicle routing Electron. Notes Discrete Math. 18 2004 181 186
22. R. Schoonderwoerd, O. Holland, J. Bruten, and L. Rothkrantz Ant-based load balancing in telecommunications networks Adapt. Behav. 1997 169 207
23. S.J. Shyua, B.M.T. Linb, and T.S. Hsiao Ant colony optimization for the cell assignment problem in PCS networks Comput. Oper. Res. 33 2006 1713 1740
24. S.J. Shyu, B.M.T. Linb, and P.Y. Yinc Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time Comput. Ind. Eng. 47 2004 181 193
25. S.J. Shyu, P.Y. Yin, and B.M.T. Lin An ant colony optimization algorithm for the minimum weight vertex cover problem Ann. Oper. Res. 131 2004 283 304 (Pubitemid 39187384)
26. S.J. Shyu, P.Y. Yin, B.M.T. Lin, and M. Haouari Ant-tree: an ant colony optimization approach to the generalized minimum spanning tree problem J. Exp. Theor. Artif. Intell. 15 2003 103 112 (Pubitemid 36564445)
27. C.E. Sigal, A.A.B. Pritsker, and J.J. Solberg The stochastic shortest route problem Oper. Res. 28 5 1980 1122 1129
28. K.C. Ying, and C.J. Liao An ant colony system for permutation flow-shop sequencing Comput. Oper. Res. 31 2004 791 801