On utilizing infeasibility in multiobjective evolutionary algorithms
Loading...
Authors
Author (Corporation)
Publication date
2009
Typ of student thesis
Course of study
Collections
Type
04B - Conference paper
Editors
Barichard, Vincent
Ehrgott, Matthias
Gandibleux, Xavier
T'Kindt, Vincent
Editor (Corporation)
Supervisor
Parent work
Multiobjective programming and goal programming. Theoretical results and practical applications
Special issue
DOI of the original publication
Link
Series
Series number
Volume
Issue / Number
Pages / Duration
113-122
Patent number
Publisher / Publishing institution
Springer
Place of publication / Event location
Berlin
Edition
Version
Programming language
Assignee
Practice partner / Client
Abstract
In this article, we consider the problem of infeasible solutions (i.e. solutions which violate one or several restrictions of an optimization problem) which can hardly be avoided when new solutions are generated by stochastic and other means during the run of an optimization algorithm. Since typical approaches for dealing with infeasibility such as using a repair mechanism, a punishment approach, or a simple recalculation of solutions are not fully satisfying in many problems, we suggest a new approach of tolerating and actively using infeasible solutions within the framework of multiobjective evolutionary algorithms.
The novel evolutionary algorithm allows solving a multiobjective optimization problem (MOP) with continuous variables by approximating the efficient set. The algorithm uses populations of variable size and new rules for selecting solutions for the subsequent generations. In particular, some of the selected solutions may be infeasible such that the Pareto front is approached at the same time from two sides, the feasible set and a subset of the infeasible set. Since the considered in feasible solutions correspond to a dual optimization problem, we call the new algorithm primaldual multiobjective optimization algorithm, or PDMOEA. The algorithm is demonstrated by considering a numerical test problem and is compared with two other approaches for dealing with infeasibility. The example shows a specific strength of the new approach: By tunneling through infeasible regions, the population may more easily extent to new separated parts of the Pareto set.
Keywords
feasibility, multiobjective optimization, constrained optimization, efficient set, evolutionary algorithm, infeasible solutions, optimization problems
Event
7th International Conference on Multi-Objective Programming and Goal Programming 2006
Exhibition start date
Exhibition end date
Conference start date
Conference end date
Date of the last check
ISBN
978-3-540-85645-0
978-3-540-85646-7
978-3-540-85646-7
ISSN
Language
English
Created during FHNW affiliation
Unknown
Strategic action fields FHNW
Publication status
Published
Review
No peer review
Open access category
License
Citation
Hanne, T. (2009). On utilizing infeasibility in multiobjective evolutionary algorithms. In V. Barichard, M. Ehrgott, X. Gandibleux, & V. T’Kindt (eds.), Multiobjective programming and goal programming. Theoretical results and practical applications (pp. 113–122). Springer. https://doi.org/10.1007/978-3-540-85646-7