An efficient constraint handling methodology for multi-objective evolutionary algorithms

Fuente: Redalyc
Guardado en:
Detalles Bibliográficos
Autor principal: Mauricio Granada Echeverri
Formato: Artículo científico
Publicado: Universidad de Antioquia 2009
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1876427624249556992
author Mauricio Granada Echeverri
author_facet Mauricio Granada Echeverri
contents An efficient constraint handling methodology for multi-objective evolutionary algorithms Mauricio Granada Echeverri Jesús María López Lezama Ruben Romero Ingeniería multi objective algorithms Evolutionary algorithms constraint optimization This paper presents a new approach for solving constraint optimization problems (COP) based on the philosophy of lexicographical goal programming. A two-phase methodology for solving COP using a multi-objective strategy is used. In the first phase, the objective function is completely disregarded and the entire search effort is directed towards finding a single feasible solution. In the second phase, the problem is treated as a bi-objective optimization problem, turning the constraint optimization into a two-objective optimization. The two resulting objectives are the original objective function and the constraint violation degree. In the first phase a methodology based on progressive hardening of soft constraints is proposed in order to find feasible solutions. The performance of the proposed methodology was tested on 11 well-known benchmark functions. 2009 artículo científico 0120-6230 https://www.redalyc.org/articulo.oa?id=43019324014 http://www.redalyc.org/revista.oa?id=430 Revista Facultad de Ingeniería Universidad de Antioquia application/pdf Universidad de Antioquia Revista Facultad de Ingeniería Universidad de Antioquia (Colombia) Num.49
format Artículo científico
id redalyc_43019324014
institution Redalyc
language
publishDate 2009
publisher Universidad de Antioquia
spellingShingle An efficient constraint handling methodology for multi-objective evolutionary algorithms
Mauricio Granada Echeverri
Ingeniería
multi
objective algorithms
Evolutionary algorithms
constraint optimization
An efficient constraint handling methodology for multi-objective evolutionary algorithms Mauricio Granada Echeverri Jesús María López Lezama Ruben Romero Ingeniería multi objective algorithms Evolutionary algorithms constraint optimization This paper presents a new approach for solving constraint optimization problems (COP) based on the philosophy of lexicographical goal programming. A two-phase methodology for solving COP using a multi-objective strategy is used. In the first phase, the objective function is completely disregarded and the entire search effort is directed towards finding a single feasible solution. In the second phase, the problem is treated as a bi-objective optimization problem, turning the constraint optimization into a two-objective optimization. The two resulting objectives are the original objective function and the constraint violation degree. In the first phase a methodology based on progressive hardening of soft constraints is proposed in order to find feasible solutions. The performance of the proposed methodology was tested on 11 well-known benchmark functions. 2009 artículo científico 0120-6230 https://www.redalyc.org/articulo.oa?id=43019324014 http://www.redalyc.org/revista.oa?id=430 Revista Facultad de Ingeniería Universidad de Antioquia application/pdf Universidad de Antioquia Revista Facultad de Ingeniería Universidad de Antioquia (Colombia) Num.49
title An efficient constraint handling methodology for multi-objective evolutionary algorithms
topic Ingeniería
multi
objective algorithms
Evolutionary algorithms
constraint optimization
url https://www.redalyc.org/articulo.oa?id=43019324014