Improved ant colony optimization algorithms for continuous ... - CoDE

More documents

Recommendations

Info

70 BIBLIOGRAPHY [56] J. Lampinen and I. Zelinka. Mixed integer-discrete-continuous optimization by differential evolution. Part 2: a practical example. In P. O˘smera, editor, Proceedigns of MENDEL’99, 5th International Mendel Conference of Soft Computing, pages 77–81. Brno University of Technology, Brno, Czech Repuplic, 1999. [57] G. Leguizamón and C.A.C. Coello. An alternative ACOR 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. [58] H.-L. Li and C.-T. Chou. A global approach for nonlinear mixed discrete programing in design optimization. Engineering Optimization, 22:109– 122, 1994. [59] H.S. Li and S.K. Au. Solving Constrained Optimization Problems via Subset Simulation. In Rafi L. Muhanna Michael Beer and Robert L. Mullen, editors, Proceedings of 4th International Workshop on Reliable Engineering Computing, 2010. [60] T. Liao, Marco A. Montes de Oca., D. Aydın, T. Stützle, and M. Dorigo. An Incremental Ant Colony Algorithm with Local Search for Continuous Optimization. In Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2011, New York, 2011. ACM Press. accepted. [61] T. Liao, Marco A. Montes de Oca., and T. Stützle. Tuning Parameters across Mixed Dimensional Instances: A Performance Scalability Study of Sep-G-CMA-ES. In Proceedings of the Workshop on Scaling Behaviours of Landscapes, Parameters and Algorithms of the Genetic and Evolutionary Computation Conference, GECCO 2011, New York, 2011. ACM Press. accepted. [62] C. Ling, S. Jie, Q. Ling, and C. Hongjian. A method for solving optimization problems in continuous space using ant colony algorithm. In Proceedings of International Workshop on Ants Algorithms, ANTS 2002, volume 2463 of LNCS, pages 288–289, Berlin, Germany, 2002. Springer. [63] H.T. Loh and P.Y. Papalambros. Computation implementation and test of a sequential linearization approach for solving mixed-discrete nonlinear design optimization. Journal of Mechanical Design, 113(3):335–345, 1991. [64] 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.
BIBLIOGRAPHY 71 [65] S. Lucidi, V. Piccialli, and M. Sciandrone. An algorithm model for mixed variable programming. SIAM Journal on Optimization, 15(4):1057–1084, 2005. [66] E. Mezura-Montes and C. Coello. Useful infeasible solutions in engineering optimization with evolutionary algorithms. In Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence, MICAI 2005, volume 3789 of LNCS, pages 652–662. Springer, 2005. [67] 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. [68] M.A. Montes De Oca, K. Enden, and T. Stützle. Incremental Particle Swarm-Guided Local Search for Continuous Optimization. In Proceedings of the 5th International Workshop on Hybrid Metaheuristics, HM 2008, volume 5296 of LNCS, pages 72–86, Berlin, Germany, 2008. Springer-Verlag. [69] MA Montes de Oca, T. Stutzle, M. Birattari, and M. Dorigo. Frankenstein’s PSO: a composite particle swarm optimization algorithm. IEEE Transactions on Evolutionary Computation, 13(5):1120–1132, 2009. [70] MA 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. [71] Marco A. Montes de Oca, Doğan Aydın, and Thomas 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. [72] Marco A. Montes de Oca and Thomas Stützle. Towards incremental social learning in optimization and multiagent systems. In W. Rand et al., editors, Workshop ECMSS. GECCO 2008, pages 1939–1944. ACM Press, New York, 2008. [73] Jens Niehaus and Wolfgang Banzhaf. More on computational effort statistics for genetic programming. In Proceedings of the 6th European conference on Genetic programming, EuroGP’03, pages 164–172, Berlin, 2003. Springer-Verlag. [74] J. Ocenasek and J. Schwarz. Estimation Distribution Algorithm for Mixed Continuous-discrete Optimization Problems. Intelligent technologies:theory and applications: new trends in intelligent technologies, page 227, 2002. IOS Press.
Page 1:
Université Libre de Bruxelles Facu
Page 5:
Acknowledgements I thank Prof. Marc
Page 9 and 10:
Contents Abstract iii Acknowledgeme
Page 11 and 12:
Chapter 1 Introduction Metaheuristi
Page 13:
them in the smallest function evalu
Page 16 and 17:
6 Ant Colony Optimization Algorithm
Page 18 and 19:
8 Ant Colony Optimization Algorithm
Page 20 and 21:
10 Ant Colony Optimization of Sep-A
Page 22 and 23:
12 Ant Colony Optimization Average
Page 25 and 26:
Chapter 3 An Incremental Ant Colony
Page 27 and 28:
3.2 IACOR with Local Search 17 3.2
Page 29 and 30: 3.3 Experimental Study 19 Algorithm
Page 31 and 32: 3.3 Experimental Study 21 Table 3.2
Page 33 and 34: 3.4 Conclusions 23 3.4 Conclusions
Page 35 and 36: 3.4 Conclusions 25 G−CMA−ES (5
Page 37: 3.4 Conclusions 27 Table 3.4: The m
Page 40 and 41: 30 Ant Colony Optimization for Mixe
Page 66 and 67: 56 Conclusions and Future Work of t
Page 69 and 70: Chapter 6 Appendix 6.1 Mathematical
Page 71 and 72: 6.1 Mathematical formulation of eng
Page 73 and 74: 6.1 Mathematical formulation of eng
Page 75 and 76: Bibliography [1] K. Abhishek, S. Le
Page 77 and 78: BIBLIOGRAPHY 67 [20] D. Datta and J
Page 79: BIBLIOGRAPHY 69 [44] Q. He and L. W
Page 83 and 84: BIBLIOGRAPHY 73 [87] Thomas Stützl
show all

Improved ant colony optimization algorithms for continuous ... - CoDE

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?