Global Optimization for Possibly Time-Dependent Cost Functions by a Population Set-Based Algorithm with Births Control

In this paper a global optimization procedure is proposed, which can be related to the framework of the search algorithms based on models of population dynamics. In our approach the admissible set is decomposed into subsets (compartments), in each of which the search is parallelly carried out. As far as the number of born individuals is concerned, a control action is introduced, with the aim of intensifying the search in the most interesting compartments, dynamically identified. The generated individuals are localized in each compartment by exploiting the multidimensional Weyl theorem, which guarantees a dense exploration of the above-mentioned compartments. The procedure is able to deal also with dynamical or stochastic optimization problems. The algorithm performances have been widely tested against two, three, four, and six variables standard test functions. Comparisons with other similar algorithms have been performed with satisfactory results. Promising results have also been obtained in some applications to dynamical and stochastic optimization problems.

[1]  Lauwerens Kuipers,et al.  Uniform distribution of sequences , 1974 .

[2]  Tim Blackwell,et al.  Particle Swarm Optimization in Dynamic Environments , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[3]  Jürgen Branke,et al.  Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.

[4]  H. Zimmermann.  Towards global optimization 2: L.C.W. DIXON and G.P. SZEGÖ (eds.) North-Holland, Amsterdam, 1978, viii + 364 pages, US $ 44.50, Dfl. 100,-. , 1979 .

[5]  À. Calsina,et al.  STATIONARY SOLUTIONS OF A SELECTION MUTATION MODEL: THE PURE MUTATION CASE ∗ , 2005 .

[6]  Rolf Drechsler,et al.  Applications of Evolutionary Computing, EvoWorkshops 2008: EvoCOMNET, EvoFIN, EvoHOT, EvoIASP, EvoMUSART, EvoNUM, EvoSTOC, and EvoTransLog, Naples, Italy, March 26-28, 2008. Proceedings , 2008, EvoWorkshops.

[7]  Z. K. Silagadze.  FINDING TWO-DIMENSIONAL PEAKS , 2004 .

[8]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[9]  Leyuan Shi,et al.  Nested Partitions Method for Global Optimization , 2000, Oper. Res..

[10]  Jürgen Branke,et al.  Multi-swarm Optimization in Dynamic Environments , 2004, EvoWorkshops.

[11]  Michael N. Vrahatis,et al.  Unified Particle Swarm Optimization in Dynamic Environments , 2005, EvoWorkshops.

[12]  Shengxiang Yang,et al.  Constructing dynamic test environments for genetic algorithms based on problem difficulty , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[13]  Erick Cantú-Paz,et al.  A Survey of Parallel Genetic Algorithms , 2000 .

[14]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[15]  Peter G. Anderson,et al.  Multidimensional Golden Means , 1993 .

[16]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[17]  Karsten Weicker,et al.  Performance Measures for Dynamic Environments , 2002, PPSN.

[18]  Gianni Di Pillo,et al.  A New Version of the Price's Algorithm for Global Optimization , 1997, J. Glob. Optim..

[19]  M. Montaz Ali,et al.  Population set-based global optimization algorithms: some modifications and numerical studies , 2004, Comput. Oper. Res..

[20]  Patrick Siarry,et al.  A Continuous Genetic Algorithm Designed for the Global Optimization of Multimodal Functions , 2000, J. Heuristics.

[21]  Bernhard Sendhoff,et al.  Constructing Dynamic Optimization Test Problems Using the Multi-objective Optimization Concept , 2004, EvoWorkshops.

[22]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

[23]  R. Lyndon While,et al.  Applying evolutionary algorithms to problems with noisy, time-consuming fitness functions , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[24]  K. Weicker,et al.  On evolution strategy optimization in dynamic environments , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).