Abstract
Agent Swarm Optimization is a framework that combines the use of evolutionary algorithms, data mining, modeling and other techniques to find the best compromises among objectives in complex decision problems. It has been applied mainly in engineering cases where using classic optimization algorithms would require undesired simplifications of the problem or the use of simulators for evaluating the objective functions. The flexibility of evolutionary algorithms makes possible to use them in practically any case. Nevertheless, in this paper we are presenting a complex problem where using “pure” evolutionary algorithms was not resulting in good solutions. A different situation appeared after using rules for reducing the search space and moving the evolutionary process toward zones with a higher probability of containing good solutions. The results of using rules is also presented in this paper for the case studied. Additionally, the paper explores the capacity of the algorithms to discover additional rules that can improve the search process and the way the evolutionary algorithms behave in problems where the expert knowledge to generate search rules is limited.
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
Montalvo, I., 2011. Diseno óptimo de sistemas de distribución de agua mediante Agent Swarm Optimization. PhD doctroal dissertation. Universitat Politècnica de València, Valencia, Spain.
Montalvo, I., Izquierdo, J., Herrera, M., Pérez-García, R., 2014. Water supply system computer-aided design by Agent Swarm Optimization. Computer-Aided Civil and Infrastructure Engineering, DOI: 10.1111/mice.12062.
Klosgen W., 1996. Explora: A multipattern and multistrategy discovery assistant. In Fayyad UM, Piatetsky-Shapiro, Smyth P, Uthurusamy R, editors. Advances in Knowledge Discovery and Data Mining. Cambridge: AAAI Press.
Lavrac N, Kavsek B, Flach PA, Todorovski L., 2004. Subgroup discovery with CN2-SD. J Mach Learn Res 5:153-88.
Wrobel S., 1997. An Algorithm for multi-relational discovery of subgroups. Proceedings of the 1st European Conference on Priniciples of Data Mining and Knowledge Discovery; 1997; Trondheim. Norway. Berlin/Heidelberg: Springer.
Friedman, J.H., and Fisher, N.I. 1999 Bump hunting in high-dimensional data. Statistics and Computing, 9, 123-143.
Deb, K. 2001, Multi-objective optimization using evolutionary algorithms, Wiley, New York.
Dorigo, M., Maniezzo, V. & Colorni, A. 1996, The ant system: optimization by a colony of cooperating ants, IEEE Transactions on Systems, Man and Cybernetics—PartB, 26(1), 1–13.
Kennedy, J. & Eberhart, R. C. 1995, Particle swarm optimization, in Proceedings of the IEEE International Conference on Neural Networks, Piscataway, NJ, 1942-1948.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer-Verlag GmbH Germany
About this paper
Cite this paper
Arango, I.M., Sebastián, J.I. (2017). Agent Swarm Optimization: Exploding the search space. In: Beyerer, J., Niggemann, O., Kühnert, C. (eds) Machine Learning for Cyber Physical Systems. Technologien für die intelligente Automation. Springer Vieweg, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-53806-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-53806-7_7
Published:
Publisher Name: Springer Vieweg, Berlin, Heidelberg
Print ISBN: 978-3-662-53805-0
Online ISBN: 978-3-662-53806-7
eBook Packages: EngineeringEngineering (R0)