article

A species conserving genetic algorithm for multimodal function optimization

Authors:

Marton E. Balazs,

Geoffrey T. Parks,

P. John ClarksonAuthors Info & Claims

Evolutionary Computation, Volume 10, Issue 3

Pages 207 - 234

https://doi.org/10.1162/106365602760234081

Published: 01 September 2002 Publication History

Abstract

This paper introduces a new technique called species conservation for evolving parallel subpopulations. The technique is based on the concept of dividing the population into several species according to their similarity. Each of these species is built around a dominating individual called the species seed. Species seeds found in the current generation are saved (conserved) by moving them into the next generation. Our technique has proved to be very effective in finding multiple solutions of multimodal optimization problems. We demonstrate this by applying it to a set of test problems, including some problems known to be deceptive to genetic algorithms.

References

[1]

Ackley, D. H. (1987). An empirical study of bit vector function optimization. In Davis, L., editor, Genetic Algorithms and Simulated Annealing, pages 170-204, Pitman, London, UK.

[2]

Beasley, D., Bull, D. R., and Martin, R. R. (1993). A Sequential Niche Technique for Multimodal Function Optimization. Evolutionary Computation, 1(2):101-125.

Digital Library

[3]

Cavicchio, D. J. (1970). Adaptive Search Using Simulated Evolution. Ph.D. thesis, University of Michigan, Ann Arbor, Michigan.

[4]

Cohoon, J. P. et al. (1987). Punctuated equilibria: a parallel genetic algorithm. In Grefenstette, J. J., editor, Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, pages 148-154, Lawrence Earlbaum, Hillsdale, New Jersey.

Digital Library

[5]

Cohoon, J. P. et al. (1991). Distributed Genetic Algorithms for the Floorplan Design Problem. IEEE Transactions on Computer-Aided Design, 10(4):483-492.

[6]

Davidor, Y. (1991). A naturally occurring niche and species phenomenon: the model and first results. In Belew, R. K. and Booker, L. B., editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 257-263, Morgan Kaufmann, San Mateo, California.

[7]

Deb, K. (1989). Genetic Algorithms in Multimodal Function Optimization. Master's thesis, University of Alabama, Tuscaloosa, Alabama.

[8]

Deb, K. and Goldberg, D. E. (1989). An investigation of niche and species formation in genetic function optimization. In Schaffer, J. D., editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 42-50, Morgan Kaufmann, San Mateo, California.

Digital Library

[9]

Deb, K. and Goldberg, D. E. (1991). Analyzing deception in trap functions. IlliGAL Technical Report 91009, Illinois Genetic Algorithms Laboratory, University of Illinois, Urbana, Illinois.

[10]

De Jong, K. A. (1975). An Analysis of Behavior of a Class of Genetic Adaptive Systems. Ph.D. thesis, University of Michigan, Ann Arbor, Michigan.

Digital Library

[11]

Eby, D. et al. (1999). The optimization of flywheels using an injection island genetic algorithm. In Bentley, P. J., editor, Evolutionary Design by Computers, pages 167-190, Morgan Kaufmann, San Francisco, California.

[12]

Eshelman, L. J. (1991). The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. In Rawlins, G. J. E., editor, Foundations of Genetic Algorithms, pages 265-283, Morgan Kaufmann, San Mateo, California.

[13]

Gen, M. and Cheng, R. (1997). Genetic Algorithms and Engineering Design. John Wiley and Sons, New York, New York.

Digital Library

[14]

Glover, F. (1989). Tabu Search - Part I. ORSA Journal on Computing, 1(3):190-206.

[15]

Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, Massachusetts.

Digital Library

[16]

Goldberg, D. E. (1990). A Note on Boltzmann Tournament Selection for Genetic Algorithms and Population-oriented Simulated Annealing. Complex Systems, 4(4):445-460.

[17]

Goldberg, D. E. (1992). Construction of High-order Deceptive Functions using Low-order Walsh Coefficients. Annals of Mathematics and Artificial Intelligence, 5:35-48.

[18]

Goldberg, D. E. and Richardson, J. (1987). Genetic algorithms with sharing for multimodal function optimization. In Grefenstette, J. J., editor, Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, pages 41-49, Lawrence Earlbaum, Hillsdale, New Jersey.

Digital Library

[19]

Gordon, V. S., Whitley, D., and Böhn, A. (1992). Dataflow parallelism in genetic algorithms. In Männer, R. and Manderick, B., editors, Parallel Problem Solving from Nature 2, pages 533-542, Elsevier Science, Amsterdam, The Netherlands.

[20]

Holland, J. H. (1975). Adaptation in Natural and Artificial System. University of Michigan Press, Ann Arbor, Michigan.

Digital Library

[21]

Hughes, E. J. and Leyland, M. (2000). Using Multiple Genetic Algorithms to Generate Radar Point-scatterer Models. IEEE Transactions on Evolutionary Computation, 4(2):147-163.

Digital Library

[22]

Lienig, J. and Thulasiraman, K. (1993). A Genetic Algorithm for Channel Routing in VLSI Circuits. Evolutionary Computation, 1(4):293-311.

Digital Library

[23]

Mahfoud, S. W. (1995). Niching methods for genetic algorithms. IlliGAL Technical Report 95001, Illinois Genetic Algorithms Laboratory, University of Illinois, Urbana, Illinois.

Digital Library

[24]

Martin, W. N., Lienig, J., and Cohoon, J. P. (1997). Island (migration) models: evolutionary algorithms based on punctuated equilibria. In Bäck, T., Fogel, D. B., and Michalewicz, Z., editors, Handbook of Evolutionary Computation, pages C6.3:1-C6.3:16, Institute of Physics Publishing, Bristol, UK.

[25]

Mengshoel, O. J. and Goldberg, D. E. (1999). Probability crowding: deterministic crowding with probabilistic replacement. In Banzhaf, W., Daida, J., and Eiben, A. E., editors, Proceedings of the Genetic and Evolutionary Computation Conference 1999, pages 409-416, Morgan Kaufmann, San Francisco, California.

[26]

Michalewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, New York, New York.

Digital Library

[27]

Parmee, I. C. (1999). A Review of Evolutionary/Adaptive Search in Engineering Design. Evolutionary Optimization, 1(1):13-39.

[28]

Sarma, J. and De Jong, K. (1997). Generation gap methods. In Bäck, T., Fogel, D. B., and Michalewicz, Z., editors, Handbook of Evolutionary Computation, pages C2.7:1-C2.7:5, Institute of Physics Publishing, Bristol, UK.

[29]

Spears, W. M. (1994). Simple subpopulation schemes. In Sebald, A. V. and Fogel, L. J., editors, Proceedings of the Third Annual Conference on Evolutionary Programming, pages 296-307, World Scientific, Singapore.

[30]

Storn, R. and Price, K. (1997). Differential Evolution a Simple and Efficient Heuristic for Global Optimization over Continuous Spaces. Journal of Global Optimization, 11(4):341-359.

Digital Library

[31]

Whitley, D. (1989). The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best. In Schaffer, J. D., editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 116-121, Morgan Kaufmann, San Mateo, California.

Digital Library

Cited By

Hong JShen BPan A(2024)A reinforcement learning-based neighborhood search operator for multi-modal optimization and its applicationsExpert Systems with Applications: An International Journal10.1016/j.eswa.2024.123150246:COnline publication date: 15-Jul-2024
https://dl.acm.org/doi/10.1016/j.eswa.2024.123150
Feng DLi YLiu JLiu Y(2024)A particle swarm optimization algorithm based on modified crowding distance for multimodal multi-objective problemsApplied Soft Computing10.1016/j.asoc.2024.111280152:COnline publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1016/j.asoc.2024.111280
Agrawal STiwari AYaduvanshi BRajak P(2024)Differential evolution with nearest better clustering for multimodal multiobjective optimizationApplied Soft Computing10.1016/j.asoc.2023.110852148:COnline publication date: 27-Feb-2024
https://dl.acm.org/doi/10.1016/j.asoc.2023.110852
Show More Cited By

Index Terms

A species conserving genetic algorithm for multimodal function optimization

Recommendations

An investigation on niching multiple species based on population replacement strategies for multimodal functions optimization

This paper studies the niching mechanism based on population replacement in the process of evolution to solve the multimodal functions optimization (MMFO) problems. In order to niche multiple species for the MMFO tasks, the overlapping population ...
Disburdening the species conservation evolutionary algorithm of arguing with radii
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation

The present paper investigates the hybridization of two well-known multimodal optimization methods, i.e. species conservation and multinational algorithms. The topological species conservation algorithm embraces the vision of the existence of ...
Multimodal optimization by means of a topological species conservation algorithm

Any evolutionary technique for multimodal optimization must answer two crucial questions in order to guarantee some success on a given task: How to most unboundedly distinguish between the different attraction basins and how to most accurately safeguard ...

Comments

Information & Contributors

Information

Published In

cover image Evolutionary Computation

Evolutionary Computation Volume 10, Issue 3

Fall 2002

108 pages

ISSN:1063-6560

EISSN:1530-9304

Issue’s Table of Contents

Publisher

MIT Press

Cambridge, MA, United States

Publication History

Published: 01 September 2002

Published in EVOL Volume 10, Issue 3

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

148
Total Citations
View Citations
387
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Hong JShen BPan A(2024)A reinforcement learning-based neighborhood search operator for multi-modal optimization and its applicationsExpert Systems with Applications: An International Journal10.1016/j.eswa.2024.123150246:COnline publication date: 15-Jul-2024
https://dl.acm.org/doi/10.1016/j.eswa.2024.123150
Feng DLi YLiu JLiu Y(2024)A particle swarm optimization algorithm based on modified crowding distance for multimodal multi-objective problemsApplied Soft Computing10.1016/j.asoc.2024.111280152:COnline publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1016/j.asoc.2024.111280
Agrawal STiwari AYaduvanshi BRajak P(2024)Differential evolution with nearest better clustering for multimodal multiobjective optimizationApplied Soft Computing10.1016/j.asoc.2023.110852148:COnline publication date: 27-Feb-2024
https://dl.acm.org/doi/10.1016/j.asoc.2023.110852
Li WGao YWang L(2024)A multipopulation particle swarm optimization based on divergent guidance and knowledge transfer for multimodal multiobjective problemsThe Journal of Supercomputing10.1007/s11227-023-05624-280:3(3480-3527)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1007/s11227-023-05624-2
Burlacu BYang KAffenzeller M(2024)Population diversity and inheritance in genetic programming for symbolic regressionNatural Computing: an international journal10.1007/s11047-022-09934-x23:3(531-566)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1007/s11047-022-09934-x
Çiçek KAkan TBayat O(2024)Multi-modal Battle Royale optimizerCluster Computing10.1007/s10586-024-04399-227:7(8983-8993)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1007/s10586-024-04399-2
Zhang YWei WZhao TWang Z(2023)Differential Evolution with a Level-Based Learning Strategy for Multimodal OptimizationInternational Journal of Intelligent Systems10.1155/2023/39613362023Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1155/2023/3961336
Wang JLi CZeng SYang S(2023)History-Guided Hill Exploration for Evolutionary ComputationIEEE Transactions on Evolutionary Computation10.1109/TEVC.2023.325034727:6(1962-1975)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1109/TEVC.2023.3250347
Jian SHsieh S(2023)A Niching Regression Adaptive Memetic Algorithm for Multimodal Optimization of the Euclidean Traveling Salesman ProblemIEEE Transactions on Evolutionary Computation10.1109/TEVC.2022.321195427:5(1413-1426)Online publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1109/TEVC.2022.3211954
Liang JLin HYue CYu KGuo YQiao K(2023)Multiobjective Differential Evolution With Speciation for Constrained Multimodal Multiobjective OptimizationIEEE Transactions on Evolutionary Computation10.1109/TEVC.2022.319425327:4(1115-1129)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1109/TEVC.2022.3194253
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents