SciELO - Scientific Electronic Library Online

 
vol.16 número3Procedimiento divide y vencerás para el diseño de territorios comercialesBúsqueda de entorno variable multiobjetivo para resolver el problema de particionamiento de datos espaciales con características poblacionales índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

  • Não possue artigos similaresSimilares em SciELO

Compartilhar


Computación y Sistemas

versão On-line ISSN 2007-9737versão impressa ISSN 1405-5546

Resumo

GOMEZ, Juan Carlos  e  TERASHIMA-MARIN, Hugo. Building General Hyper-Heuristics for Multi-Objective Cutting Stock Problem. Comp. y Sist. [online]. 2012, vol.16, n.3, pp.321-334. ISSN 2007-9737.

In this article we build multi-objective hyper-heuristics (MOHHs) using the multi-objective evolutionary algorithm NSGA-II for solving irregular 2D cutting stock problems under a bi-objective minimization schema, having a trade-off between the number of sheets used to fit a finite number of pieces and the time required to perform the placement of these pieces. We solve this problem using a multi-objective variation of hyper-heuristics called MOHH, whose main idea consists of finding a set of simple heuristics which can be combined to find a general solution, where a single heuristic is applied depending on the current condition of the problem instead of applying a unique single heuristic during the whole placement process. MOHHs are built after going through a learning process using the NSGA-II, which evolves combinations of condition-action rules producing at the end a set of Pareto-optimal MOHHs. We test the approximated MOHHs on several sets of benchmark problems and present the results.

Palavras-chave : Hyper-heuristics; multi-objective; optimization; evolutionary computation; cutting problems.

        · resumo em Espanhol     · texto em Inglês     · Inglês ( pdf )

 

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