SciELO - Scientific Electronic Library Online

 
 número49Methodological proposal for locating water quality monitoring stations in distribution networks using geographic information systemsPreparation and evaluation of a bone paste for medical applications índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Artigo

Indicadores

Links relacionados

  • Em processo de indexaçãoCitado por Google
  • Não possue artigos similaresSimilares em SciELO
  • Em processo de indexaçãoSimilares em Google

Compartilhar


Revista Facultad de Ingeniería Universidad de Antioquia

versão impressa ISSN 0120-6230
versão On-line ISSN 2357-53280

Resumo

GRANADA ECHEVERRI, Mauricio; LOPEZ LEZAMA, Jesús María  e  ROMERO, Ruben. An efficient constraint handling methodology for multi-objective evolutionary algorithms. Rev.fac.ing.univ. Antioquia [online]. 2009, n.49, pp.141-150. ISSN 0120-6230.

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.

Palavras-chave : Evolutionary algorithms; multi-objective algorithms; constraint optimization.

        · resumo em Espanhol     · texto em Inglês

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons