Differential evolution for a constrained combinatorial optimisation problem

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Differential evolution (DE) has been extensively applied to
continuous problems, its mechanics naturally lending themselves to such.
While some efforts have been made to adapt it to combinatorial problems, these
have largely been problem specific and have not dealt extensively with
constraint handling beyond penalty approaches. In this paper, a simple and
generic strategy, relying on pre-developed heuristic units, is applied to DE and
the generalised assignment problem. In addition, a simple, parameter-free
approach to adapting control parameters is used. The results are competitive
with other well established meta-heuristics. However, there is still scope for
further improvement in the way that DE may be applied to constrained
combinatorial optimisation.
Original languageEnglish
Pages (from-to)279-297
Number of pages19
JournalInternational Journal of Metaheuristics
Volume1
Issue number4
DOIs
Publication statusPublished - 2011

Fingerprint

Combinatorial optimization
Constrained optimization
Mechanics

Cite this

@article{ce7df116366c4ed3bc0c5ef8443175ca,
title = "Differential evolution for a constrained combinatorial optimisation problem",
abstract = "Differential evolution (DE) has been extensively applied tocontinuous problems, its mechanics naturally lending themselves to such.While some efforts have been made to adapt it to combinatorial problems, thesehave largely been problem specific and have not dealt extensively withconstraint handling beyond penalty approaches. In this paper, a simple andgeneric strategy, relying on pre-developed heuristic units, is applied to DE andthe generalised assignment problem. In addition, a simple, parameter-freeapproach to adapting control parameters is used. The results are competitivewith other well established meta-heuristics. However, there is still scope forfurther improvement in the way that DE may be applied to constrainedcombinatorial optimisation.",
author = "Marcus Randall",
year = "2011",
doi = "10.1504/IJMHEUR.2011.044302",
language = "English",
volume = "1",
pages = "279--297",
journal = "International Journal of Metaheuristics",
issn = "1755-2176",
publisher = "Inderscience Publishers",
number = "4",

}

Differential evolution for a constrained combinatorial optimisation problem. / Randall, Marcus.

In: International Journal of Metaheuristics, Vol. 1, No. 4, 2011, p. 279-297.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Differential evolution for a constrained combinatorial optimisation problem

AU - Randall, Marcus

PY - 2011

Y1 - 2011

N2 - Differential evolution (DE) has been extensively applied tocontinuous problems, its mechanics naturally lending themselves to such.While some efforts have been made to adapt it to combinatorial problems, thesehave largely been problem specific and have not dealt extensively withconstraint handling beyond penalty approaches. In this paper, a simple andgeneric strategy, relying on pre-developed heuristic units, is applied to DE andthe generalised assignment problem. In addition, a simple, parameter-freeapproach to adapting control parameters is used. The results are competitivewith other well established meta-heuristics. However, there is still scope forfurther improvement in the way that DE may be applied to constrainedcombinatorial optimisation.

AB - Differential evolution (DE) has been extensively applied tocontinuous problems, its mechanics naturally lending themselves to such.While some efforts have been made to adapt it to combinatorial problems, thesehave largely been problem specific and have not dealt extensively withconstraint handling beyond penalty approaches. In this paper, a simple andgeneric strategy, relying on pre-developed heuristic units, is applied to DE andthe generalised assignment problem. In addition, a simple, parameter-freeapproach to adapting control parameters is used. The results are competitivewith other well established meta-heuristics. However, there is still scope forfurther improvement in the way that DE may be applied to constrainedcombinatorial optimisation.

U2 - 10.1504/IJMHEUR.2011.044302

DO - 10.1504/IJMHEUR.2011.044302

M3 - Article

VL - 1

SP - 279

EP - 297

JO - International Journal of Metaheuristics

JF - International Journal of Metaheuristics

SN - 1755-2176

IS - 4

ER -