Global optimization
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Applied Mathematics and Computation - Special issue on articficial life and robotics
Dual Evolutionary Optimization
Selected Papers from the 5th European Conference on Artificial Evolution
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Nonuniform sampling for global optimization of kinetic rate constants in biological pathways
Proceedings of the 38th conference on Winter simulation
Proceedings of the 38th conference on Winter simulation
Hi-index | 0.00 |
One of the fundamental difficulties in engineering design is the multiplicity of local solutions. This has triggered great efforts to develop global search algorithms. Globality, however, often has a prohibitively high numerical cost for real problems. A fixed cost local search, which sequentially becomes global is developed. Globalization is achieved by probabilistic restart. A spacial probability of starting a local search is built based on past searches. An improved Nelder-Mead algorithm makes the local optimizer. It accounts for variable bounds. It is additionally made more robust by reinitializing degenerated simplexes. The resulting method, called Globalized Bounded Nelder-Mead (GBNM) algorithm, is particularly adapted to tackle multimodal, discontinuous optimization problems, for which it is uncertain that a global optimization can be afforded. Different strategies for restarting the local search are discussed. Numerical experiments are given on analytical test functions and composite laminate design problems. The GBNM method compares favorably to an evolutionary algorithm, both in terms of numerical cost and accuracy.