research-article

A novel methodology for diversity preservation in evolutionary algorithms

Authors:

Giovanni Squillero,

Alberto Paolo TondaAuthors Info & Claims

GECCO '08: Proceedings of the 10th annual conference companion on Genetic and evolutionary computation

Pages 2223 - 2226

https://doi.org/10.1145/1388969.1389049

Published: 12 July 2008 Publication History

Get Access

Abstract

In this paper we describe an improvement of an entropy-based diversity preservation approach for evolutionary algorithms. This approach exploits the information contained not only in the parts that compose an individual, but also in their position and relative order. We executed a set of preliminary experiments in order to test the new approach, using two different problems in which diversity preservation plays a major role in obtaining good solutions.

References

[1]

Martin, W.N., Lienig J. and Cohoon J.P. Island (migration) models: evolutionary algorithms based on punctuated equilibria, In Handbook of Evolutionary Computation, IOP Publishing Ltd and Oxford University, 1997.

Google Scholar

[2]

Tomassini, M. and Giacobini, M. Spatial and Temporal Dimensions in Evolutionary Systems, GSICE05, 2005.

Google Scholar

[3]

Corno F., Sanchez E., Squillero G., Evolving Assembly Programs: How Games Help Microprocessor Validation, IEEE Transactions on Evolutionary Computation, Special Issue on Evolutionary Computation and Games, Dec. 2005, vol. 9, pp. 695--706

Digital Library

Google Scholar

[4]

Sarma J., De Jong K., An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms, PPSN IV (Berlin, 1996)

Digital Library

Google Scholar

[5]

E. Burke, S. Gustafson, G. Kendall, Diversity in Genetic Programming: An Analysis of Measures and Correlation With Fitness, IEEE Transactions on Evolutionary Computation, Feb 2004, Vol 8, No I, pp 47--62

Digital Library

Google Scholar

[6]

Shannon C.E., A Mathematical Theory of Communication, Bell System Technical Journal, vol. 27, pp. 379--423, 623--656, July, October, 1948

Crossref

Google Scholar

Cited By

View all

Gabor TPhan TLinnhoff-Popien C(2021)Productive fitness in diversity-aware evolutionary algorithmsNatural Computing10.1007/s11047-021-09853-3Online publication date: 29-Apr-2021
https://doi.org/10.1007/s11047-021-09853-3
Kala RShukla ATiwari R(2018)Robotic path planning using hybrid genetic algorithm particle swarm optimisationInternational Journal of Information and Communication Technology10.1504/IJICT.2012.0487564:2/3/4(89-105)Online publication date: 19-Dec-2018
https://dl.acm.org/doi/10.1504/IJICT.2012.048756
Squillero G(2018)Artificial evolution in computer aided design: from the optimization of parameters to the creation of assembly programsComputing10.1007/s00607-011-0157-993:2-4(103-120)Online publication date: 31-Dec-2018
https://dl.acm.org/doi/10.1007/s00607-011-0157-9
Show More Cited By

Index Terms

A novel methodology for diversity preservation in evolutionary algorithms
1. Computing methodologies

Recommendations

Use of the q-Gaussian mutation in evolutionary algorithms
Special issue on advances in computational intelligence and bioinformatics

This 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 ...
Multiobjective real-coded bayesian optimization algorithmrevisited: diversity preservation
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation

This paper provides empirical studies on MrBOA, which have been designed for strengthening diversity of nondominated solutions. The studies lead to modified sharing. A new selection scheme has been suggested for improving diversity performance. ...
A Novel Diversity-based Evolutionary Algorithm for the Traveling Salesman Problem
GECCO '15: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation

The Traveling Salesman Problem (TSP) is one of the most well-known NP-hard combinatorial optimization problems. In order to deal with large TSP instances, several heuristics and metaheuristics have been devised. In this paper, a novel memetic scheme ...

Comments

Information & Contributors

Information

Published In

GECCO '08: Proceedings of the 10th annual conference companion on Genetic and evolutionary computation

July 2008

1182 pages

ISBN:9781605581316

DOI:10.1145/1388969

Conference Chair:
Conor Ryan
University of Limerick, Ireland
,
Editor:
Maarten Keijzer
Chordiant Software International B.V., The Netherlands

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 July 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GECCO08

Sponsor:

GECCO08: Genetic and Evolutionary Computation Conference

July 12 - 16, 2008

GA, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
173
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)1

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gabor TPhan TLinnhoff-Popien C(2021)Productive fitness in diversity-aware evolutionary algorithmsNatural Computing10.1007/s11047-021-09853-3Online publication date: 29-Apr-2021
https://doi.org/10.1007/s11047-021-09853-3
Kala RShukla ATiwari R(2018)Robotic path planning using hybrid genetic algorithm particle swarm optimisationInternational Journal of Information and Communication Technology10.1504/IJICT.2012.0487564:2/3/4(89-105)Online publication date: 19-Dec-2018
https://dl.acm.org/doi/10.1504/IJICT.2012.048756
Squillero G(2018)Artificial evolution in computer aided design: from the optimization of parameters to the creation of assembly programsComputing10.1007/s00607-011-0157-993:2-4(103-120)Online publication date: 31-Dec-2018
https://dl.acm.org/doi/10.1007/s00607-011-0157-9
Byron JIba WNeumann FSutton A(2016)Population Diversity as a Selection FactorProceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion10.1145/2908961.2931653(953-959)Online publication date: 20-Jul-2016
https://dl.acm.org/doi/10.1145/2908961.2931653
Squillero GTonda ANeumann FSutton A(2016)Promoting Diversity in Evolutionary AlgorithmsProceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion10.1145/2908961.2931651(943-944)Online publication date: 20-Jul-2016
https://dl.acm.org/doi/10.1145/2908961.2931651
Gaudesi MSquillero GTonda AAlba E(2013)An efficient distance metric for linear genetic programmingProceedings of the 15th annual conference on Genetic and evolutionary computation10.1145/2463372.2463495(925-932)Online publication date: 6-Jul-2013
https://dl.acm.org/doi/10.1145/2463372.2463495
Ulrich TBader JThiele L(2010)Defining and optimizing indicator-based diversity measures in multiobjective searchProceedings of the 11th international conference on Parallel problem solving from nature: Part I10.5555/1885031.1885107(707-717)Online publication date: 11-Sep-2010
https://dl.acm.org/doi/10.5555/1885031.1885107
Ulrich TBader JThiele L(2010)Defining and Optimizing Indicator-Based Diversity Measures in Multiobjective SearchParallel Problem Solving from Nature, PPSN XI10.1007/978-3-642-15844-5_71(707-717)Online publication date: 2010
https://doi.org/10.1007/978-3-642-15844-5_71

View Options

Login options

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

Cited By

Index Terms

Recommendations

Use of the q-Gaussian mutation in evolutionary algorithms

Multiobjective real-coded bayesian optimization algorithmrevisited: diversity preservation

A Novel Diversity-based Evolutionary Algorithm for the Traveling Salesman Problem