An incremental ant colony algorithm with local search for continuous optimization

Genetic and Evolutionary Computation Conference, GECCO'11

Volumn , Issue , 2011, Pages 125-132

  Liao, Tianjun ^a   De Oca, Marco A Montes ^a   Aydin, Doǧan ^b   Stützle, Thomas ^a   Dorigo, Marco ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b EGE UNIVERSITY   (Turkey)

Author keywords

Ant colony optimization; Automatic parameter tuning; Continuous optimization; Local search

Indexed keywords

ANT COLONY ALGORITHMS; ANT COLONY OPTIMIZATION ALGORITHMS; ANT-COLONY OPTIMIZATION; BENCHMARK FUNCTIONS; COMPUTING JOURNALS; CONTINUOUS OPTIMIZATION; CONTINUOUS OPTIMIZATION PROBLEMS; LOCAL SEARCH; PARAMETER-TUNING; STATE-OF-THE-ART ALGORITHMS;

ARTIFICIAL INTELLIGENCE; ARTS COMPUTING; CALCULATIONS; CONSTRAINED OPTIMIZATION; EXPERIMENTS; SOFT COMPUTING;

EVOLUTIONARY ALGORITHMS;

EID: 84860403682     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001576.2001594     Document Type: Conference Paper

References (27)

1. A. Auger and N. Hansen. A restart CMA evolution strategy with increasing population size. In Proc. of CEC 2005, pages 1769-1776, Piscataway, NJ, 2005. IEEE Press. (Pubitemid 41496063)
2. P. Balaprakash, M. Birattari, and T. Stützle. Improvement strategies for the F-Race algorithm: Sampling design and iterative refinement. In Proc. of HM 2007, volume 4771 of LNCS, pages 108-122, Germany, 2007. Springer.
3. M. Birattari, Z. Yuan, P. Balaprakash, and T. Stützle. F-Race and iterated F-Race: An overview. Experimental Methods for the Analysis of Optimization Algorithms, pages 311-336, 2010. Germany, Springer.
4. M. Dorigo and T. Stützle. Ant Colony Optimization. MIT Press, Cambridge, MA, 2004.
5. J. Dréo and P. Siarry. Continuous interacting ant colony algorithm based on dense heterarchy. Future Generation Computer Systems, 20(5):841-856, 2004.
6. L. Eshelman and J. Schaffer. Real-coded genetic algorithms and interval-schemata. Foundations of Genetic Algorithms, 2(1993):187-202, 1993.
7. N. Hansen, A. Ostermeier, and A. Gawelczyk. On the adaptation of arbitrary normal mutation distributions in evolution strategies: The generating set adaptation. In Proc. of 6th ICGA, pages 57-64, San Francisco, CA, 1995. Morgan Kaufmann.
8. F. Herrera, M. Lozano, and D. Molina. Test suite for the special issue of soft computing on scalability of evolutionary algorithms and other metaheuristics for large scale continuous optimization problems, 2010. URL: http://sci2s.ugr.es/eamhco/updated-functions1-19.pdf.
9. X. Hu, J. Zhang, and Y. Li. Orthogonal methods based ant colony search for solving continuous optimization problems. Journal of Computer Science and Technology, 23(1):2-18, 2008. (Pubitemid 351192919)
10. S. Johnson. The NLopt nonlinear-optimization package, 2008. URL: http://ab-initio.mit.edu/wiki/index.php/NLopt.
11. R algorithm for continuous optimization problems. In M. Dorigo et al., editors, Proc of ANTS 2010, volume 6234 of LNCS, pages 48-59, Germany, 2010. Springer.
12. C. Ling, S. Jie, Q. Ling, and C. Hongjian. A method for solving optimization problems in continuous space using ant colony algorithm. In M. Dorigo et al., editors, Proc. of ANTS 2002, volume 2463 of LNCS, pages 288-289, Germany, 2002. Springer.
13. M. Lozano, D. Molina, and F. Herrera. Editorial: Scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems. Soft Computing, 2011. In Press.
14. N. Monmarché, G. Venturini, and M. Slimane. On how Pachycondyla apicalis ants suggest a new search algorithm. Future Generation Computer Systems, 16(9):937-946, 2000.
15. M. A. Montes de Oca, T. Stützle, K. Van den Enden, and M. Dorigo. Incremental social learning in particle swarms. IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics, 41(2):368-384, 2011.
16. M. A. Montes de Oca, D. Aydin, and T. Stützle. An incremental particle swarm for large-scale optimization problems: An example of tuning-in-the-loop (re)design of optimization algorithms. Soft Computing, 2011. In press. DOI: 10.1007/s00500-010-0649-0
17. M. A. Montes de Oca and T. Stützle. Towards incremental social learning in optimization and multiagent systems. In W. Rand et al., editors, ECoMASS Workshop of the Genetic and Evolutionary Computation Conference (GECCO 2008), pages 1939-1944. ACM Press, New York, 2008.
18. S. Pourtakdoust and H. Nobahari. An extension of ant colony system to continuous optimization problems. In M. Dorigo et al., editors, Proc. of ANTS 2004, volume 3172 of LNCS, pages 158-173, Germany, 2004. Springer.
19. M. Powell. An efficient method for finding the minimum of a function of several variables without calculating derivatives. The Computer Journal, 7(2):155, 1964.
20. M. Powell. The BOBYQA algorithm for bound constrained optimization without derivatives. Cambridge NA Report NA2009/06, University of Cambridge, UK, 2009.
21. K. Socha. ACO for continuous and mixed-variable optimization. In M. Dorigo et al., editors, Proc. of ANTS 2004, volume 3172 of LNCS, pages 25-36, Germany, 2004. Springer. (Pubitemid 39210699)
22. K. Socha and C. Blum. An ant colony optimization algorithm for continuous optimization: application to feed-forward neural network training. Neural Computing & Applications, 16(3):235-247, 2007.
23. K. Socha and M. Dorigo. Ant colony optimization for continuous domains. European Journal of Operational Research, 185(3):1155-1173, 2008. (Pubitemid 47505285)
24. R. Storn and K. Price. Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11(4):341-359, 1997. (Pubitemid 127502202)
25. P. Suganthan, N. Hansen, J. Liang, K. Deb, Y. Chen, A. Auger, and S. Tiwari. Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Technical Report 2005005, Nanyang Technological University, 2005.
26. K. Tang, X. Yao, P. Suganthan, C. MacNish, Y. Chen, C. Chen, and Z. Yang. Benchmark functions for the CEC 2008 special session and competition on large scale global optimization. Technical report, Nature Inspired Computation and Applications Laboratory, USTC, China, 2007. URL: http://nical.ustc.edu.cn/ cec08ss.php.
27. L. Tseng and C. Chen. Multiple trajectory search for large scale global optimization. In Proc. of CEC 2008, pages 3052-3059, Piscataway, NJ, 2008. IEEE Press.