Abstract
This paper presents the use of a multi-agent system for the development of proactive S-Metaheuristics (i.e. single-solution based metaheuristics) derived from Record-to-Record Travel (RRT) and Local Search. The basic idea is to implement metaheuristics as agents that operate in the environment of the optimization process with the goal of avoiding stagnation in local optima by adjusting their parameters and neighborhood. Environmental information about previous solutions is used to determine the best operators and parameters. The proactive adjustment of the neighborhood is based on the identification of the best operators using Fitness Distance Correlation (FDC). The proactive adjustment of the parameters is focused on guarantying a minimal level of acceptance of new solutions. Besides, a simple form of combination of both proactive behaviors is introduced. The system has been validated through experimentation with 28 functions on binary strings.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Talbi, E.G.: Metaheuristics: From Design to Implementation. John Wiley & Sons (2009)
Wolpert, D.H., Macready, W.G.: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (1996)
Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: 6th Int. Conf. on Genetic Algorithms, Pittsburgh, pp. 184–192 (1995)
Birattari, M.: Tuning Metaheuristics. SCI, vol. 197. Springer, Heidelberg (2009)
Yu, E.S.: Social Modeling and i*. In: Borgida, A.T., Chaudhri, V.K., Giorgini, P., Yu, E.S. (eds.) Conceptual Modeling: Foundations and Applications. LNCS, vol. 5600, pp. 99–121. Springer, Heidelberg (2009)
González, J.R., Cruz, C., del Amo, I.G., Pelta, D.A.: An adaptive multiagent strategy for solving combinatorial dynamic optimization problems. In: Pelta, D.A., Krasnogor, N., Dumitrescu, D., Chira, C., Lung, R. (eds.) NICSO 2011. SCI, vol. 387, pp. 41–55. Springer, Heidelberg (2011)
Lepagnot, J., Nakib, A., Oulhadj, H., Siarry, P.: A New multiagent Algorithm for Dynamic Continuous optimization. Int. Journal of Applied Metaheuristic Computing 1(1), 16–38 (2010)
Aydin, M.E.: Coordinating metaheuristic agents with swarm intelligence. Journal of Intelligent Manufacturing 23(4), 991–999 (2012)
Malek, R.: Collaboration of Metaheuristics Algorithms through a Multi-Agent System. In: Mařík, V., Strasser, T., Zoitl, A. (eds.) HoloMAS 2009. LNCS, vol. 5696, pp. 72–81. Springer, Heidelberg (2009)
Li, B., Yu, H., Shen, Z., Miao, C.: Evolutionary Organizational Search. In: 8th Int. Conf. on Autonomous Agents and Multiagent Systems, Budapest, pp. 1329–1330 (2009)
Poupaert, E., Deville, Y.: Simulated Annealing with estimated temperature. AI Communications 13(1), 19–26 (2000)
Wang, H., Wang, D., Yang, S.: A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems. Soft Computing- A Fusion of Foundations, Methodologies and Applications 13(8-9), 763–780 (2009)
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. Journal of Heuristics 15(6), 617–644 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moreno, M., Rosete, A., Pavón, J. (2013). An Agent Based Implementation of Proactive S-Metaheuristics. In: Pan, JS., Polycarpou, M.M., Woźniak, M., de Carvalho, A.C.P.L.F., Quintián, H., Corchado, E. (eds) Hybrid Artificial Intelligent Systems. HAIS 2013. Lecture Notes in Computer Science(), vol 8073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40846-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-40846-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40845-8
Online ISBN: 978-3-642-40846-5
eBook Packages: Computer ScienceComputer Science (R0)