Abstract
This work presents the results obtained when using a decentralised multiagent strategy (Agents) to solve dynamic optimization problems of a combinatorial nature. To improve the results of the strategy, we also include a simple adaptive scheme for several configuration variants of a mutation operator in order to obtain a more robust behaviour. The adaptive scheme is also tested on an evolutionary algorithm (EA). Finally, both Agents and EA are compared against the recent state of the art adaptive hill-climbing memetic algorithm (AHMA).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bartz-Beielstein, T.: Experimental Research in Evolutionary Computation: The New Experimentalism. Natural Computing Series. Springer, Heidelberg (2006)
Blackwell, T., Branke, J.: Multiswarms, exclusion, and anti-convergence in dynamic environments. IEEE Transactions on Evolutionary Computation 10(4), 459–472 (2006)
Branke, J.: Memory Enhanced Evolutionary Algorithms for Changing Optimization Problems. In: Angeline, P.J., Michalewicz, Z., Schoenauer, M., Yao, X., Zalzala, A. (eds.) Proceedings of the Congress on Evolutionary Computation, vol. 3, pp. 1875–1882. IEEE Press, Los Alamitos (1999)
Branke, J., Schmeck, H.: Designing evolutionary algorithms for dynamic optimization problems. In: Advances in Evolutionary Computing: Theory and Applications, pp. 239–262 (2003)
Cruz, C., González, J., Pelta, D.: Optimization in dynamic environments: a survey on problems, methods and measures. Soft Computing 15, 1427–1448 (2011)
García, S., Molina, D., Lozano, M., Herrera, F.: A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the cec’2005 special session on real parameter optimization. Journal of Heuristics 15(6), 617–644 (2009)
González, J.R., Masegosa, A.D., del Amo, I.G.: A cooperative strategy for solving dynamic optimization problems. Memetic Computing 3, 3–14 (2011)
Ochoa, G., Mädler-Kron, C., Rodriguez, R., Jaffe, K.: Assortative mating in genetic algorithms for dynamic problems. In: Applications on Evolutionary Computing, pp. 617–622 (2005)
Pelta, D., Cruz, C., González, J.R.: A study on diversity and cooperation in a multiagent strategy for dynamic optimization problems. Int. J. of Intelligent Systems 24, 844–861 (2009)
Pelta, D., Cruz, C., Verdegay, J.L.: Simple control rules in a cooperative system for dynamic optimisation problems. Int. J. of General Systems 38(7), 701–717 (2009)
Smith, J.: Self-adaptation in evolutionary algorithms for combinatorial optimisation. In: Cotta, C., Sevaux, M., Sörensen, K. (eds.) Adaptive and Multilevel Metaheuristics. SCI, vol. 136, pp. 31–57. Springer, Heidelberg (2008)
Wang, H., Wang, D., Yang, S.: A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems. Soft Computing 13(8-9), 763–780 (2009)
Yang, S., Yao, X.: Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Computing 9(11), 815–834 (2005)
Yang, S., Ong, Y.S., Jin, Y. (eds.): Evolutionary Computation in Dynamic and Uncertain Environments. SCI, vol. 51. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
González, J.R., Cruz, C., del Amo, I.G., Pelta, D.A. (2011). An Adaptive Multiagent Strategy for Solving Combinatorial Dynamic Optimization Problems. In: Pelta, D.A., Krasnogor, N., Dumitrescu, D., Chira, C., Lung, R. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2011). Studies in Computational Intelligence, vol 387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24094-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-24094-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24093-5
Online ISBN: 978-3-642-24094-2
eBook Packages: EngineeringEngineering (R0)