P. Caamano
J. A. Becerra
ABSTRACT
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the application domain of four representative evolutionary algorithms is carried out using a relevant set of real-parameter function optimization benchmarks. The four selected algorithms are the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) and the Differential Evolution (DE), due to their successful results in recent studies, a Genetic Algorithm with real parameter operators, used here as a reference approach because it is probably the most familiar to researchers, and the Macroevolutionary algorithm (MA), which is not widely known but it shows a very remarkable behavior in some problems. The algorithms have been compared running several tests over the benchmark function set to analyze their capabilities from a practical point of view, in other words, in terms of their usability. The characterization of the algorithms is based on accuracy, stability and time consumption parameters thus establishing their operational scope and the type of optimization problems they are more suitable for.
- Special Session on Real-Parameter Optimization at CEC-05, Edinburgh, UK, 2--5 Sept. 2005.Google Scholar
- Workshop on Parameter Setting in Genetic and Evolutionary Algorithms (PSGEA 2005), June, 25--29, 2005, Washington, D.C. USAGoogle Scholar
- Workshop on Evolutionary Algorithms for Dynamic Optimization Problems, June 26, 2005, Washington D.C.Google Scholar
- Bui, L. T., Shan, Y., Qi, F., Abbass, H.A. Comparing Two Versions of Differential Evolution in Real Parameter Optimization, Tech. Report TR-ALAR-200504009, School of ITEE, University of New South Wales, 2005.Google Scholar
- Costa, L. A., Parameter-less Evolution Strategy for Global Optimization, Proc. 6th WSEAS International Conference on Simulation, Modelling and Optimization, 2006, 622--627. Google ScholarDigital Library
- Yao, X., Liu, L., Lin G. Evolutionary Programming Made Faster, IEEE Transactions on Evolutionary Computation, Vol. 3, No. 2, 1999, 82--102. Google ScholarDigital Library
- Suganthan, P. N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.P., Auger, A., Tiwari, A. Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization, Technical Report, Nanyang Technological University, Singapore, and KanGAL Report #2005005, IIT Kanpur, India, 2005.Google Scholar
- Shang, Y. and Qiu, Y. A Note on the Extended Rosenbrock Function. Evol. Comput. 14, 1, 2006, 119--126. Google ScholarDigital Library
- Hansen, N. The CMA Evolution Strategy: A Tutorial, In www.bionik.tu-berlin.de/user/niko/, 2007Google Scholar
- Becerra, J. A., Santos, J., Duro, R.J., Robot Controller Evolution with Macroevolutionary Algorithms, Information Processing with Evolutionary Algorithms From Industrial Applications to Academic Speculations, 2005, 117--128Google Scholar
- Becerra, J. A., Díaz-Casás, V., Duro, R.J., Exploring Macroevolutionary Algorithms: Some Extensions and Improvements, Lecture Notes in Computer Science, vol. 4507, Springer-Verlag, 2007, 308--315 Google ScholarDigital Library
- Holland, J.H. Adaptation in natural and artificial systems, Univ. Michigan Press, 1975 Google ScholarDigital Library
- Goldberg, D.E. Genetic algorithms in search, optimization and machine learning, Addison-Wesley, 1989 Google ScholarDigital Library
- Herrera, F., Lozano, M., Verdegay, J.L. Tackling real-coded genetic algorithms: Operators and tools for behaviorial analysis. Artificial Intellig. Review, 12(4), 1998, 265--319. Google ScholarDigital Library
- Eshelman, L.J., Schaffer, J.D. Real-Coded Genetic Algorithms and Interval Schemata, Foundations of Genetic Algorithms 2, 1993, 187--202.Google Scholar
- Michalewicz, Z. Genetic algorithms + Data Structures = Evolution Programs. Springer-Verlag, 1992. Google ScholarDigital Library
- Hansen, N. and A. Ostermeier. Completely Derandomized Self-Adaptation in Evolution Strategies. Evolutionary Computation, 9(2), 2001, 159--195. Google ScholarDigital Library
- Auger, A, and Hansen, N. A Restart CMA Evolution Strategy With Increasing Population Size. In Proc. of the IEEE, CEC 2005, 2005, 1769--1776.Google ScholarCross Ref
- Storn, R. and Price, K. Differential Evolution -- a Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces Technical Report TR-95-012, ICSI, 1995.Google Scholar
- Rönkkönen, J., Kukkonen, S. Price, K. Real-parameter optimization with differential evolution, Proc. of 2005 IEEE Congress on Evolutionary Computation, 2005, 506--513.Google ScholarCross Ref
- Marin, J., and Solé, R. V. Macroevolutionary algorithms: A new optimization method on tness landscapes. IEEE Trans. on Evolutionary Computation 3, 4, 1999, 272--286. Google ScholarDigital Library
Index Terms
- Application domain study of evolutionary algorithms in optimization problems
Recommendations
Use of the q-Gaussian mutation in evolutionary algorithms
Special issue on advances in computational intelligence and bioinformaticsThis paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed ...
A novel quantum-inspired evolutionary algorithm for solving combinatorial optimization problems
GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computationIn this paper, we propose a novel quantum-inspired evolutionary algorithm, called NQEA, for solving combinatorial optimization problems. NQEA uses a new Q-bit update operator to increase the balance between the exploration and exploitation of the search ...
A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems
GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computationQuantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superposition. In this paper, we propose a multi-start quantum-inspired ...
Comments