Improved ant colony optimization algorithms for continuous ... - CoDE
Improved ant colony optimization algorithms for continuous ... - CoDE
Improved ant colony optimization algorithms for continuous ... - CoDE
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
BIBLIOGRAPHY 71<br />
[65] S. Lucidi, V. Piccialli, and M. Sciandrone. An algorithm model<br />
<strong>for</strong> mixed variable programming. SIAM Journal on Optimization,<br />
15(4):1057–1084, 2005.<br />
[66] E. Mezura-Montes and C. Coello. Useful infeasible solutions in engineering<br />
<strong>optimization</strong> with evolutionary <strong>algorithms</strong>. In Mexican International<br />
Conference on Artificial Intelligence: Advances in Artificial<br />
Intelligence, MICAI 2005, volume 3789 of LNCS, pages 652–662.<br />
Springer, 2005.<br />
[67] N. Monmarché, G. Venturini, and M. Slimane. On how Pachycondyla<br />
apicalis <strong>ant</strong>s suggest a new search algorithm. Future Generation Computer<br />
Systems, 16(9):937–946, 2000.<br />
[68] M.A. Montes De Oca, K. Enden, and T. Stützle. Incremental Particle<br />
Swarm-Guided Local Search <strong>for</strong> Continuous Optimization. In Proceedings<br />
of the 5th International Workshop on Hybrid Metaheuristics,<br />
HM 2008, volume 5296 of LNCS, pages 72–86, Berlin, Germany, 2008.<br />
Springer-Verlag.<br />
[69] MA Montes de Oca, T. Stutzle, M. Birattari, and M. Dorigo. Frankenstein’s<br />
PSO: a composite particle swarm <strong>optimization</strong> algorithm. IEEE<br />
Transactions on Evolutionary Computation, 13(5):1120–1132, 2009.<br />
[70] MA Montes de Oca, T. Stützle, K. Van den Enden, and M. Dorigo.<br />
Incremental social learning in particle swarms. IEEE Transactions on<br />
Systems, Man, and Cybernetics, Part B: Cybernetics, 41(2):368–384,<br />
2011.<br />
[71] Marco A. Montes de Oca, Doğan Aydın, and Thomas Stützle. An<br />
incremental particle swarm <strong>for</strong> large-scale <strong>optimization</strong> problems: An<br />
example of tuning-in-the-loop (re)design of <strong>optimization</strong> <strong>algorithms</strong>.<br />
Soft Computing, 2011. In press.<br />
[72] Marco A. Montes de Oca and Thomas Stützle. Towards incremental<br />
social learning in <strong>optimization</strong> and multiagent systems. In W. Rand<br />
et al., editors, Workshop ECMSS. GECCO 2008, pages 1939–1944.<br />
ACM Press, New York, 2008.<br />
[73] Jens Niehaus and Wolfgang Banzhaf. More on computational ef<strong>for</strong>t<br />
statistics <strong>for</strong> genetic programming. In Proceedings of the 6th European<br />
conference on Genetic programming, EuroGP’03, pages 164–172,<br />
Berlin, 2003. Springer-Verlag.<br />
[74] J. Ocenasek and J. Schwarz. Estimation Distribution Algorithm <strong>for</strong><br />
Mixed Continuous-discrete Optimization Problems. Intelligent technologies:theory<br />
and applications: new trends in intelligent technologies,<br />
page 227, 2002. IOS Press.