A Cooperative Co-evolutionary Algorithm for solving Large-Scale Constrained Problems with Interaction Detection

Résultats de recherche: Contribution à un journal/une revueArticle

Résumé

Cooperative co-evolutionary algorithms have a huge potential in optimizing large-scale problems. In a such divide-and-conquer strategy, the decomposition step plays a crucial part in the performance of the algorithm. Automatic decomposition strategies that can uncover the interaction structure between decision variables have been introduced in recent years. However, such strategies for large-scale constrained problems are quite limited in number so far and yet, they are interesting for at least two reasons. On the one hand, they help to find a feasible region faster. On the other hand, they also improve the convergence rate for the optimization itself. In this paper, we propose a novel cooperative co-evolutionary algorithm, DGD-EA for Differential Grouping Evolutionary Algorithm, that performs an automatic decomposition of decision variables and allows to optimize large-scale constrained problems. Its performance is evaluated on a set of 10 benchmark functions specially created for this study.
langue originaleAnglais
Pages (de - à)697-704
Nombre de pages8
journalProceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '17)
Les DOIs
étatPublié - 15 juil. 2017

Empreinte digitale

Evolutionary algorithms
Decomposition

Citer ceci

@article{ec95700df2554a02abd43d825442f5bc,
title = "A Cooperative Co-evolutionary Algorithm for solving Large-Scale Constrained Problems with Interaction Detection",
abstract = "Cooperative co-evolutionary algorithms have a huge potential in optimizing large-scale problems. In a such divide-and-conquer strategy, the decomposition step plays a crucial part in the performance of the algorithm. Automatic decomposition strategies that can uncover the interaction structure between decision variables have been introduced in recent years. However, such strategies for large-scale constrained problems are quite limited in number so far and yet, they are interesting for at least two reasons. On the one hand, they help to find a feasible region faster. On the other hand, they also improve the convergence rate for the optimization itself. In this paper, we propose a novel cooperative co-evolutionary algorithm, DGD-EA for Differential Grouping Evolutionary Algorithm, that performs an automatic decomposition of decision variables and allows to optimize large-scale constrained problems. Its performance is evaluated on a set of 10 benchmark functions specially created for this study.",
keywords = "global optimization, large-scale optimization, constrained optimization problems, cooperative co-evolutionary algorythm, differential grouping, genetic algorithm",
author = "Julien Blanchard and Charlotte Beauthier and Timoteo Carletti",
year = "2017",
month = "7",
day = "15",
doi = "10.1145/3071178.3071187",
language = "English",
pages = "697--704",
journal = "Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '17)",
publisher = "Morgan Kaufmann Publishers, Inc.",

}

TY - JOUR

T1 - A Cooperative Co-evolutionary Algorithm for solving Large-Scale Constrained Problems with Interaction Detection

AU - Blanchard, Julien

AU - Beauthier, Charlotte

AU - Carletti, Timoteo

PY - 2017/7/15

Y1 - 2017/7/15

N2 - Cooperative co-evolutionary algorithms have a huge potential in optimizing large-scale problems. In a such divide-and-conquer strategy, the decomposition step plays a crucial part in the performance of the algorithm. Automatic decomposition strategies that can uncover the interaction structure between decision variables have been introduced in recent years. However, such strategies for large-scale constrained problems are quite limited in number so far and yet, they are interesting for at least two reasons. On the one hand, they help to find a feasible region faster. On the other hand, they also improve the convergence rate for the optimization itself. In this paper, we propose a novel cooperative co-evolutionary algorithm, DGD-EA for Differential Grouping Evolutionary Algorithm, that performs an automatic decomposition of decision variables and allows to optimize large-scale constrained problems. Its performance is evaluated on a set of 10 benchmark functions specially created for this study.

AB - Cooperative co-evolutionary algorithms have a huge potential in optimizing large-scale problems. In a such divide-and-conquer strategy, the decomposition step plays a crucial part in the performance of the algorithm. Automatic decomposition strategies that can uncover the interaction structure between decision variables have been introduced in recent years. However, such strategies for large-scale constrained problems are quite limited in number so far and yet, they are interesting for at least two reasons. On the one hand, they help to find a feasible region faster. On the other hand, they also improve the convergence rate for the optimization itself. In this paper, we propose a novel cooperative co-evolutionary algorithm, DGD-EA for Differential Grouping Evolutionary Algorithm, that performs an automatic decomposition of decision variables and allows to optimize large-scale constrained problems. Its performance is evaluated on a set of 10 benchmark functions specially created for this study.

KW - global optimization

KW - large-scale optimization

KW - constrained optimization problems

KW - cooperative co-evolutionary algorythm

KW - differential grouping

KW - genetic algorithm

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

U2 - 10.1145/3071178.3071187

DO - 10.1145/3071178.3071187

M3 - Article

SP - 697

EP - 704

JO - Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '17)

JF - Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '17)

ER -