Grant: Discovery Grants Program - Individual
Dalhousie University
$17,000.00
Constraint handling in evolutionary algorithms
FY 2012-13
Summary
Optimisation problems are abundant in all areas of science and engineering. Solving an optimisation problem amounts to choosing values for a set of decision variables that result in the best solution possible. Often, optimisation problems are constrained in that there are restrictions on the values that the decision variables can take on.
Evolutionary algorithms (EAs) are optimisation strategies that see increasing use in many areas of application. They iteratively improve the quality of populations of candidate solutions by subjecting them to variation and selection. Their robustness in the face of non-differentiable or noisy objectives, along with the relative ease with which they can be adapted to poorly understood problems, often make EAs the method of choice where other approaches are not applicable or prone to failure.
A multitude of techniques for handling constraints in EAs have been proposed and are in common use. However, knowledge with regard to their respective capabilities and shortcomings is limited. Most crucially, the interaction between adaptive variation operators and constraint handling techniques is poorly understood. I will achieve an understanding of scaling properties of EAs for constrained optimisation by analysing their behaviour for sets of carefully selected test problems. The results obtained will complement, extend, and help explain the large body of empirical knowledge generated on large function testbeds that is available today. I will then use the insights gained to develop more capable EAs for constrained optimisation and systematically compare their capabilities with those of other direct search strategies.
Program
Discovery Grants Program - Individual
Recipient
Location
Nova Scotia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
298298-2012
Name nom
Arnold, Dirk
Department département
Computer Science, Faculty of
Organization id
79
Institution établissement
Dalhousie University
Province en
Nova Scotia
Province fr
Nouvelle-Écosse
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2012
Award amount
17000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2709
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Other computing methods
Research subject fr
Autres méthodes informatiques
Partie
1
Nb partie
5
Application title
Constraint handling in evolutionary algorithms
Keyword
NSERC
Application summary
Optimisation problems are abundant in all areas of science and engineering. Solving an optimisation problem amounts to choosing values for a set of decision variables that result in the best solution possible. Often, optimisation problems are constrained in that there are restrictions on the values that the decision variables can take on.
Evolutionary algorithms (EAs) are optimisation strategies that see increasing use in many areas of application. They iteratively improve the quality of populations of candidate solutions by subjecting them to variation and selection. Their robustness in the face of non-differentiable or noisy objectives, along with the relative ease with which they can be adapted to poorly understood problems, often make EAs the method of choice where other approaches are not applicable or prone to failure.
A multitude of techniques for handling constraints in EAs have been proposed and are in common use. However, knowledge with regard to their respective capabilities and shortcomings is limited. Most crucially, the interaction between adaptive variation operators and constraint handling techniques is poorly understood. I will achieve an understanding of scaling properties of EAs for constrained optimisation by analysing their behaviour for sets of carefully selected test problems. The results obtained will complement, extend, and help explain the large body of empirical knowledge generated on large function testbeds that is available today. I will then use the insights gained to develop more capable EAs for constrained optimisation and systematically compare their capabilities with those of other direct search strategies.