Dansk
DTU.dk
Index
Contact
Phone book
Internal Pages
DTU Alumni
Søgeord
Education
Education
MSc degree programme
PhD programmes
IMM courses
Coursebase DTU
Laboratories
Summer Schools
Welcome to DTU
DTU Informatics bookshop
Research
Research
Research areas
Algorithms and Logic
Cognitive Systems
Data Analysis
Dynamical Systems
---
Image Analysis & Computer Graphics
Language-Based Technology
Mathematical Statistics
Scientific Computing
Software Engineering
Research centers
Publications
Industrial collaboration
Industrial collaboration
Public sector consultancy
Advanced Technology Foundation Projects
Continuing education
Model-based Software Engineering Center
MT-Lab
PhD education
Software Development Center
Statistical Consulting Center
About DTU Informatics
About DTU Informatics
Contact
Employees
Facts about DTU Informatics
Getting to DTU Informatics
Advisory Board
Information material
Find the expert
Organisation
Vision
Available jobs
Library
Portalen DTU
Alumni association (in Danish)
News
News
Latest news
News Archive at DTU Informatics
Calendar at DTU Informatics
English
>
Research
>
Algorithms and Logic
>
Publications
Print
Research areas
Algorithms and Logic
Courses
People
Publications
Cognitive Systems
Data Analysis
Dynamical Systems
Embedded Systems Engineering
Image Analysis & Computer Graphics
Language-Based Technology
Mathematical Statistics
Scientific Computing
Software Engineering
Research centers
Publications
Title:
Analysis of Diversity-Preserving Mechanisms for Global Exploration
Type:
Journal articleJournal article
Participant(s):
Forfatter: Friedrich, Tobias
Technical University of Denmark
Forfatter: Oliveto, Pietro S.
Technical University of Denmark
Forfatter: Sudholt, Dirk
Technical University of Denmark
Author:
Witt, Carsten
(Cwisno: 53388)
Technical University of Denmark
Email:
---
Abstract:
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity-preserving mechanisms can enhance global exploration of the search space and enable crossover to find dissimilar individuals for recombination. We focus on the global exploration capabilities of mutation-based algorithms. Using a simple bimodal test function and rigorous runtime analyses, we compare well-known diversity-preserving mechanisms like deterministic crowding, fitness sharing, and others with a plain algorithm without diversification. We show that diversification is necessary for global exploration, but not all mechanisms succeed in finding both optima efficiently. Our theoretical results are accompanied by additional experiments for different population sizes.
Published:
in journal: Evolutionary Computation (ISSN: 1063-6560) (DOI: http://dx.doi.org/10.1162/evco.2009.17.4.17401), vol: 17, issue: 4, pages: 455-476, 2009
DOI:
10.1162/evco.2009.17.4.17401
See the publication in DTU Orbit
Top
Matematiktorvet
DTU - Building 303B
DK-2800 Kgs. Lyngby
---
Tel +45 4525 3031
EAN 5798000428515
Cookies