Abstract
Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search algorithms use a population of solutions to maintain an acceptable diversity level during the process, thus their correct distribution is crucial for the search. This paper introduces a new population meta-heuristic called “variable mesh optimization” (VMO), in which the set of nodes (potential solutions) are distributed as a mesh. This mesh is variable, because it evolves to maintain a controlled diversity (avoiding solutions too close to each other) and to guide it to the best solutions (by a mechanism of resampling from current nodes to its best neighbour). This proposal is compared with basic population-based meta-heuristics using a benchmark of multimodal continuous functions, showing that VMO is a competitive algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brest J, Boskovic B, Greiner S, Zumer V, Maucec MS (2007) Performance comparison of self-adaptive and adaptive differential evolution algorithms. Soft Comput 11(7):617–629
Deb K (2001) Self-adaptive genetic algorithms with simulated binary crossover. Evol Comput J 9(2):195–219
Engelbrecht A (2006) Fundamentals of computational swarm intelligence. Wiley, New York
Fernandes C, Rosa A (2001) A study of non-random matching and varying population size in genetic algorithm using a royal road function. In: Proceedings of IEEE congress on evolutionary computation. IEEE Press, Piscataway, New York, pp 60–66
García S, Fernández A, Luengo J, Herrera F (2009) A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability. Soft Comput Appl 13(10):959–977
García S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC2005 special session on real parameter optimization. J Heuristics 15:617–644
Glover FW, Kochenberger GA (2003) Handbook of metaheuristics (International Series in Operations Research & Management Science). Springer, Berlin
Herrera F, Lozano M (eds) (2005) Special issue on real coded genetic algorithms: foundations, models and operators. Soft Comput 9:4
Herrera F, Lozano M, Verdegay J (1998) Tackling realcoded genetic algorithms: operators and tools for the behavioral analysis. Artif Intell Rev 12(4):265–319
Herrera F, Lozano M, Sánchez A (2003) A taxonomy for the crossover operator for real-coded genetic algorithms: an experimental study. Int J Intell Syst 18(3):309–338
Holm S (1979) A simple sequentially rejective multiple test procedure. Scand J Stat 6(2):65–70
Iman R, Davenport J (1980) Approximations of the critical region of the Friedman statistic. Commun Stat 18:571–595
Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, pp 1942–1948
Laguna M, Martí R (2003) Scatter search. Methodology and implementation in C. Kluwer, Dordrecht
Lozano M, Herrera F, Molina D (eds) (2011) Special issue on scalability of evolutionary algorithms and other metaheuristics for large scale continuous optimization problems. Soft Comput
Michalewicz Z, Siarry P (2008) Special issue on adaptation of discrete metaheuristics to continuous optimization. In: Eur J Oper Res 185:1060–1061
Minetti G (2005) Uniform crossover in genetic algorithms. In: Proceedings of IEEE fifth international conference on intelligent systems design and applications, pp 350–355
Rahnamayan S, Tizhoosh H, Salama M (2008) Solving large scale optimization problems by opposition-based differential evolution. IEEE Trans Comput 7(10):1792–1804
Sheskin DJ (2007) Handbook of parametric and nonparametric statistical procedures. Chapman and Hall/CRC
Shi Y, Eberhart C (1998) A modified particle swarm optimizer. In: Proceedings of IEEE international conference on evolutionary computation, pp 69–73
Storn R, Price K (1997) Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11:341–359
Suganthan P, Hansen N, Liang J, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Technical report, Nanyang Technological University. http://www.ntu.edu.sg/home/EPNSugan/
Syswerda G (1989) Uniform crossover in genetic algorithms. In: Schaffer J (eds) Proceedings of third international conference on genetic algorithms. pp 2–9 Morgan Kaufmann, San Mateo
Wilcoxon F (1945) Individual comparisons by ranking methods. Biometrics 1:80–83
Author information
Authors and Affiliations
Corresponding author
Appendix: Results of the experiments
Appendix: Results of the experiments
In this appendix, the results used for the statistical analysis for each study case are presented. Each algorithm is run 25 times for each test function, and the average error of the best found solution is computed. The function error value for a solution x is defined as (f(x j ) − f(x * j )), where x * j is the global optimum of the function. The captions in the tables detail which experiment it belongs to and the dimension of the test functions used (see Tables 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25).
Rights and permissions
About this article
Cite this article
Puris, A., Bello, R., Molina, D. et al. Variable mesh optimization for continuous optimization problems. Soft Comput 16, 511–525 (2012). https://doi.org/10.1007/s00500-011-0753-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-011-0753-9