Una metodología eficiente para manejo de restricciones en algoritmos evolutivos multi-objetivo

Detalhes bibliográficos
Autor(a) principal: Echeverri, Mauricio Granada
Data de Publicação: 2009
Outros Autores: López Lezama, Jesús María, Romero, Ruben [UNESP]
Tipo de documento: Artigo
Idioma: spa
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://aprendeenlinea.udea.edu.co/revistas/index.php/ingenieria/article/viewArticle/15968
http://hdl.handle.net/11449/71119
Resumo: 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.
id UNSP_93ba20707fe5e3b4588efda89d0fd1c6
oai_identifier_str oai:repositorio.unesp.br:11449/71119
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Una metodología eficiente para manejo de restricciones en algoritmos evolutivos multi-objetivoAn efficient constraint handling methodology for multi-objective evolutionary algorithmsConstraint optimizationEvolutionary algorithmsMulti-objective algorithmsThis 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.Departamento de Ingeniería Eléctrica Universidad Tecnológica de Pereira Vereda la Julita, Pereira, RisaraldaGrupo Gimel. Facultad de Ingeniería Universidad de Antioquia, Calle 67 N. 53-108, MedellínDepartmento de Ingeniería Eléctrica Feis-Unesp-Ilha Solteira-Brasil, Avenida Brasil, 56 - Centro, 15385-000, Ilha Solteira - SPDepartmento de Ingeniería Eléctrica Feis-Unesp-Ilha Solteira-Brasil, Avenida Brasil, 56 - Centro, 15385-000, Ilha Solteira - SPVereda la JulitaUniversidad de AntioquiaUniversidade Estadual Paulista (Unesp)Echeverri, Mauricio GranadaLópez Lezama, Jesús MaríaRomero, Ruben [UNESP]2014-05-27T11:23:57Z2014-05-27T11:23:57Z2009-09-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article141-150application/pdfhttp://aprendeenlinea.udea.edu.co/revistas/index.php/ingenieria/article/viewArticle/15968Revista Facultad de Ingenieria, n. 49, p. 141-150, 2009.0120-6230http://hdl.handle.net/11449/71119WOS:0002690846000152-s2.0-703504122802-s2.0-70350412280.pdfScopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPspaRevista Facultad de Ingenieria0,172info:eu-repo/semantics/openAccess2024-01-02T06:17:34Zoai:repositorio.unesp.br:11449/71119Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-01-02T06:17:34Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Una metodología eficiente para manejo de restricciones en algoritmos evolutivos multi-objetivo
An efficient constraint handling methodology for multi-objective evolutionary algorithms
title Una metodología eficiente para manejo de restricciones en algoritmos evolutivos multi-objetivo
spellingShingle Una metodología eficiente para manejo de restricciones en algoritmos evolutivos multi-objetivo
Echeverri, Mauricio Granada
Constraint optimization
Evolutionary algorithms
Multi-objective algorithms
title_short Una metodología eficiente para manejo de restricciones en algoritmos evolutivos multi-objetivo
title_full Una metodología eficiente para manejo de restricciones en algoritmos evolutivos multi-objetivo
title_fullStr Una metodología eficiente para manejo de restricciones en algoritmos evolutivos multi-objetivo
title_full_unstemmed Una metodología eficiente para manejo de restricciones en algoritmos evolutivos multi-objetivo
title_sort Una metodología eficiente para manejo de restricciones en algoritmos evolutivos multi-objetivo
author Echeverri, Mauricio Granada
author_facet Echeverri, Mauricio Granada
López Lezama, Jesús María
Romero, Ruben [UNESP]
author_role author
author2 López Lezama, Jesús María
Romero, Ruben [UNESP]
author2_role author
author
dc.contributor.none.fl_str_mv Vereda la Julita
Universidad de Antioquia
Universidade Estadual Paulista (Unesp)
dc.contributor.author.fl_str_mv Echeverri, Mauricio Granada
López Lezama, Jesús María
Romero, Ruben [UNESP]
dc.subject.por.fl_str_mv Constraint optimization
Evolutionary algorithms
Multi-objective algorithms
topic Constraint optimization
Evolutionary algorithms
Multi-objective algorithms
description 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.
publishDate 2009
dc.date.none.fl_str_mv 2009-09-01
2014-05-27T11:23:57Z
2014-05-27T11:23:57Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://aprendeenlinea.udea.edu.co/revistas/index.php/ingenieria/article/viewArticle/15968
Revista Facultad de Ingenieria, n. 49, p. 141-150, 2009.
0120-6230
http://hdl.handle.net/11449/71119
WOS:000269084600015
2-s2.0-70350412280
2-s2.0-70350412280.pdf
url http://aprendeenlinea.udea.edu.co/revistas/index.php/ingenieria/article/viewArticle/15968
http://hdl.handle.net/11449/71119
identifier_str_mv Revista Facultad de Ingenieria, n. 49, p. 141-150, 2009.
0120-6230
WOS:000269084600015
2-s2.0-70350412280
2-s2.0-70350412280.pdf
dc.language.iso.fl_str_mv spa
language spa
dc.relation.none.fl_str_mv Revista Facultad de Ingenieria
0,172
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 141-150
application/pdf
dc.source.none.fl_str_mv Scopus
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1803047223632592896

Registros relacionados