General subpopulation framework and taming the conflict inside populations

Danilo Vasconcellos Vargas, Junichi Murata, Hirotaka Takano, Alexandre Cláudio Botazzo Delbem

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Structured evolutionary algorithms have been investigated for some time. However, they have been under explored especially in the field of multi-objective optimization. Despite good results, the use of complex dynamics and structures keep the understanding and adoption rate of structured evolutionary algorithms low. Here, we propose a general subpopulation framework that has the capability of integrating optimization algorithms without restrictions as well as aiding the design of structured algorithms. The proposed framework is capable of generalizing most of the structured evolutionary algorithms, such as cellular algorithms, island models, spatial predator-prey, and restricted mating based algorithms. Moreover, we propose two algorithms based on the general subpopulation framework, demonstrating that with the simple addition of a number of single-objective differential evolution algorithms for each objective, the results improve greatly, even when the combined algorithms behave poorly when evaluated alone at the tests. Most importantly, the comparison between the subpopulation algorithms and their related panmictic algorithms suggests that the competition between different strategies inside one population can have deleterious consequences for an algorithm and reveals a strong benefit of using the subpopulation framework.

Original languageEnglish
Pages (from-to)1-36
Number of pages36
JournalEvolutionary Computation
Volume23
Issue number1
DOIs
Publication statusPublished - Mar 16 2015

Fingerprint

Evolutionary Algorithms
Evolutionary algorithms
Island Model
Predator-prey
Conflict
Framework
Differential Evolution Algorithm
Complex Dynamics
Complex Structure
Multi-objective Optimization
Optimization Algorithm
Multiobjective optimization
Restriction
Design
Strategy

All Science Journal Classification (ASJC) codes

  • Computational Mathematics

Cite this

General subpopulation framework and taming the conflict inside populations. / Vargas, Danilo Vasconcellos; Murata, Junichi; Takano, Hirotaka; Delbem, Alexandre Cláudio Botazzo.

In: Evolutionary Computation, Vol. 23, No. 1, 16.03.2015, p. 1-36.

Research output: Contribution to journalArticle

Vargas, Danilo Vasconcellos ; Murata, Junichi ; Takano, Hirotaka ; Delbem, Alexandre Cláudio Botazzo. / General subpopulation framework and taming the conflict inside populations. In: Evolutionary Computation. 2015 ; Vol. 23, No. 1. pp. 1-36.
@article{8ab6e3267c124cf3a2c6f8dd6351831d,
title = "General subpopulation framework and taming the conflict inside populations",
abstract = "Structured evolutionary algorithms have been investigated for some time. However, they have been under explored especially in the field of multi-objective optimization. Despite good results, the use of complex dynamics and structures keep the understanding and adoption rate of structured evolutionary algorithms low. Here, we propose a general subpopulation framework that has the capability of integrating optimization algorithms without restrictions as well as aiding the design of structured algorithms. The proposed framework is capable of generalizing most of the structured evolutionary algorithms, such as cellular algorithms, island models, spatial predator-prey, and restricted mating based algorithms. Moreover, we propose two algorithms based on the general subpopulation framework, demonstrating that with the simple addition of a number of single-objective differential evolution algorithms for each objective, the results improve greatly, even when the combined algorithms behave poorly when evaluated alone at the tests. Most importantly, the comparison between the subpopulation algorithms and their related panmictic algorithms suggests that the competition between different strategies inside one population can have deleterious consequences for an algorithm and reveals a strong benefit of using the subpopulation framework.",
author = "Vargas, {Danilo Vasconcellos} and Junichi Murata and Hirotaka Takano and Delbem, {Alexandre Cl{\'a}udio Botazzo}",
year = "2015",
month = "3",
day = "16",
doi = "10.1162/EVCO_a_00118",
language = "English",
volume = "23",
pages = "1--36",
journal = "Evolutionary Computation",
issn = "1063-6560",
publisher = "MIT Press Journals",
number = "1",

}

TY - JOUR

T1 - General subpopulation framework and taming the conflict inside populations

AU - Vargas, Danilo Vasconcellos

AU - Murata, Junichi

AU - Takano, Hirotaka

AU - Delbem, Alexandre Cláudio Botazzo

PY - 2015/3/16

Y1 - 2015/3/16

N2 - Structured evolutionary algorithms have been investigated for some time. However, they have been under explored especially in the field of multi-objective optimization. Despite good results, the use of complex dynamics and structures keep the understanding and adoption rate of structured evolutionary algorithms low. Here, we propose a general subpopulation framework that has the capability of integrating optimization algorithms without restrictions as well as aiding the design of structured algorithms. The proposed framework is capable of generalizing most of the structured evolutionary algorithms, such as cellular algorithms, island models, spatial predator-prey, and restricted mating based algorithms. Moreover, we propose two algorithms based on the general subpopulation framework, demonstrating that with the simple addition of a number of single-objective differential evolution algorithms for each objective, the results improve greatly, even when the combined algorithms behave poorly when evaluated alone at the tests. Most importantly, the comparison between the subpopulation algorithms and their related panmictic algorithms suggests that the competition between different strategies inside one population can have deleterious consequences for an algorithm and reveals a strong benefit of using the subpopulation framework.

AB - Structured evolutionary algorithms have been investigated for some time. However, they have been under explored especially in the field of multi-objective optimization. Despite good results, the use of complex dynamics and structures keep the understanding and adoption rate of structured evolutionary algorithms low. Here, we propose a general subpopulation framework that has the capability of integrating optimization algorithms without restrictions as well as aiding the design of structured algorithms. The proposed framework is capable of generalizing most of the structured evolutionary algorithms, such as cellular algorithms, island models, spatial predator-prey, and restricted mating based algorithms. Moreover, we propose two algorithms based on the general subpopulation framework, demonstrating that with the simple addition of a number of single-objective differential evolution algorithms for each objective, the results improve greatly, even when the combined algorithms behave poorly when evaluated alone at the tests. Most importantly, the comparison between the subpopulation algorithms and their related panmictic algorithms suggests that the competition between different strategies inside one population can have deleterious consequences for an algorithm and reveals a strong benefit of using the subpopulation framework.

UR - http://www.scopus.com/inward/record.url?scp=84924804158&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84924804158&partnerID=8YFLogxK

U2 - 10.1162/EVCO_a_00118

DO - 10.1162/EVCO_a_00118

M3 - Article

C2 - 24437665

AN - SCOPUS:84924804158

VL - 23

SP - 1

EP - 36

JO - Evolutionary Computation

JF - Evolutionary Computation

SN - 1063-6560

IS - 1

ER -