Analyzing the impact of MOACO components: An algorithmic study on the multi-objective shortest path problem

Expert Systems with Applications

Volumn 40, Issue 1, 2013, Pages 345-355

  Bezerra, Leonardo C T ^a   Goldbarg, Elizabeth F G ^a   Goldbarg, Marco C ^a   Buriol, Luciana S ^b  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO NORTE   (Brazil)

^b FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

Author keywords

Ant Colony Optimization; Multi objective shortest path; Scalarization vectors

Indexed keywords

ANT COLONY OPTIMIZATION (ACO); EXPERIMENTAL EVALUATION; METAHEURISTIC; MULTI OBJECTIVE; MULTI-OBJECTIVE SHORTEST PATH PROBLEMS; MULTIOBJECTIVE COMBINATORIAL OPTIMIZATION; ORIGINAL ALGORITHMS; SCALARIZATION; SHORTEST PATH; UNDERLYING GRAPHS;

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; GRAPH THEORY;

ALGORITHMS;

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

References (42)

1. Alaya, I., Solnon, C., & Ghédira, K. (2007). Ant colony optimization for multi-objective optimization problems. In ICTAI'07 (pp. 450-457).
2. Barán, B., & Schaerer, M. (2003). A multiobjective ant colony system for vehicle routing problem with time windows. In IASTED'03 (Vol. 21, pp. 97-102).
3. L.C.T. Bezerra, E.F.G. Goldbarg, M.C. Goldbarg, and L.S. Buriol Grace: A generational randomized aco for the multi-objective shortest path problem R. Takahashi, K. Deb, E. Wanner, S. Grecco, EMO'11 LNCS Vol. 6576 2011 Springer 535 549
4. M. Chica, O. Cordón, S. Damas, and J. Bautista A new diversity induction mechanism for a multi-objective ant colony algorithm to solve a real-world time and space assembly line balancing problem Memetic Computing 3 2011 15 24
5. W.J. Conover Practical non-parametric statistics 3rd ed. 1999 John Wiley and Sons New York, NY
6. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Transactions on Evolutionary Computation 6 2002 182 197
7. Dijkstra, E.W. (1959). A note on two problems in connexion with graphs. Nr. Math.
8. K. Doerner, W. Gutjahr, R. Hartl, C. Strauss, and C. Stummer Pareto ant colony optimization: A metaheuristic approach to multiobjective portfolio selection Annals of Operations Research 131 2004 79 99
9. K. Doerner, W. Gutjahr, R. Hartl, C. Strauss, and C. Stummer Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection European Journal of Operational Research 171 2006 830 841
10. K. Doerner, R.F. Hartl, and M. Reimann Are competants more competent for problem solving?: - The case of a multiple objective transportation problem GECCO'01 2001 Morgan Kaufmann Berlin, Heidelberg p. 802
11. Dorigo, M. (1992). Optimization, learning and natural algorithms. Ph.D. thesis, Dipartamento de Elettronica, Politecnico de Milano.
12. Dorigo, M., & Socha, K. (2006). An introduction to ant colony optimization. Technical report, TR/IRIDIA/2006-010 IRIDIA, Université Libre de Bruxelles.
13. M. Dorigo, and L.M. Gambardella Ant colony system: A cooperative learning approach to the traveling salesman problem IEEE Transactions on Evolutionary Computation 1 1997 53 66
14. C. García-Martínez, O. Cordón, and F. Herrera A taxonomy and empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP European Journal of Operational Research 180 2007 116 148
15. K. Ghoseiri, and B. Nadjari An ant colony optimization algorithm for the bi-objective shortest path problem Applied Soft Computing 10 2009 1237 1246
16. P.-P. Grass é La reconstruction du nid et les coordinations interindividuelles chez bellicositermes natalensis et cubitermes sp. la théorie de la stigmergie: Essai d'interprétation du comportement des termites constructeurs Insectes Sociaux 6 1959 41
17. S. Häckel, M. Fischer, D. Zechel, and T. Teich A multi-objective ant colony approach for pareto-optimization using dynamic programming GECCO'08 2008 ACM pp. 33-40
18. He, F., Qi, H., & Fan, Q. (2007). An evolutionary algorithm for the multi-objective shortest path problem. In ISKE'07.
19. J.H. Holland Adaptation in natural and artificial systems 1975 University of Michigan Press
20. S. Iredi, D. Merkle, and M. Middendorf Bi-criterion optimization with multicolony ant algorithms E. Zitzler, L. Thiele, K. Deb, C.A.C. Coello, D. Corne, EMO LNCS Vol. 1993 2001 Springer 359 372
21. Ke, L., Feng, Z., Xu, Z., Shang, K., & Wang, Y. (2010). A multiobjective aco algorithm for rough feature selection. In PACCS'10 (pp. 207-210).
22. Knowles, J. D., Thiele, L., & Zitzler, E. (2006). A tutorial on the performance assessment of stochastic multiobjective optimizers. Technical report, TIK-Report No. 214.
23. W.H. Kruskal, and W.A. Wallis Use of ranks in one-criterion variance analysis Journal of the American Statistical Association 47 1952 583 621
24. M. López-Ibáñez, L. Paquete, and T. Stützle On the design of ACO for the biobjective quadratic assignment problem M. Dorigo, M. Birattari, C. Blum, L. Gambardella, F. Montada, T. Stützle, ANTS LNCS Vol. 3172 2004 Springer-Verlag
25. M. López-Ibáñez, and T. Stützle The impact of design choices of multiobjective ant colony optimization algorithms on performance: An experimental study on the biobjective TSP GECCO '10 2010 ACM pp. 71-78
26. E.Q.V. Martins On a multicritera shortest path problem European Journal of Operational Research 16 1984 236 245
27. P. Mooney, and A. Winstansley An evolutionary algorithm for multicriteria path optimization problems International Journal of Geographical Information Science 20 2006 401 423
28. A.M. Mora, J.J. Merelo, J.L.J. Laredo, C. Millan, and J. Torrecillas Chac, a moaco algorithm for computation of bi-criteria military unit path in the battlefield: Presentation and first results International Journal of Intelligence Systems 24 2009 818 843
29. J. Mote, I. Murphy, and D.L. Olson A parametric approach to solving bicriterion shortest path problems European Journal of Operational Research 53 1991 81 92
30. MSPP. (2010). .
31. J.M.A. Pangilinan, and G.K. Janseens Evolutionary algorithms for the multiobjective shortest path problem International Journal of Computing and Information Science in Engineering 1 2007
32. L. Paquete, and T. Stützle A two-phase local search for the biobjective traveling salesman problem C. Fonseca, P. Fleming, E. Zitzler, L. Thiele, K. Deb, EMO LNCS Vol. 2632 2003 Springer Berlin/Heidelberg 69
33. A. Raith, and M. Ehrgott A comparison of solution strategies for biobjective shortest path problems Computers & Operations Research 36 2009 1299 1331
34. 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
35. Steiner, S., & Radzik, T. (2003). Solving the biobjective minimum spanning tree problem using a k-best algorithm. Technical report, TR-03-06 Department of Computer Science, King's College London.
36. T. Stützle, and H.H. Hoos Max-min ant system Future Generation Computer Systems 16 2000 889 914
37. E. Taillard, P. Waelti, and J. Zuber Few statistical tests for proportions comparison European Journal of Operational Research 185 2009 1336 1350
38. Vianna, D. S., & Arroyo, J. E. C. (2004). A GRASP algorithm for the multi-objective knapsack problem. In XXIV International Conference of the Chilean Computer Science Society.
39. F. Wilcoxon Individual comparisons by ranking methods Biometric Bulletin 1 1945 80 83
40. Q. Zhang, and H. Li Moead: A multiobjective evolutionary algorithm based on decomposition IEEE Transactions on Evolutionary Computation 11 2007 712 731
41. E. Zitzler, and L. Thiele Multiobjective evolutionary algorithms: A comparative case study and the strength pareto evolutionary algorithm IEEE Transactions on Evolutionary Computation 3 1999 257 271
42. E. Zitzler, L. Thiele, M. Laumanns, C.M. Fonseca, and V.G. da Fonseca Performance assessment of multiobjective optimizaers: An analysis and review IEEE Transactions on Evolutionary Computation 7 2003 132