An efficient hyperheuristic for strip-packing problems

Ignacio Araya, Bertrand Neveu, María Cristina Riff

Resultado de la investigación: Capítulo del libro/informe/acta de congresoCapítulorevisión exhaustiva

16 Citas (Scopus)

Resumen

In this paper we introduce a hyperheuristic to solve hard strip packing problems. The hyperheuristic manages a sequence of greedy low-level heuristics, each element of the sequence placing a given number of objects. A low-level solution is built by placing the objects following the sequence of low-level heuristics. The hyperheuristic performs a hill-climbing algorithm on this sequence by testing different moves (adding, removing, replacing a low-level heuristic). The results we obtained are very encouraging and improve the results from the single heuristics tests. Thus, we conclude that the collaboration among heuristics is an interesting approach to solve hard strip packing problems.

Idioma originalInglés
Título de la publicación alojadaAdaptive and Multilevel Metaheuristics
EditoresCarlos Cotta, Marc Sevaux, Kenneth Sörensen
Páginas61-76
Número de páginas16
DOI
EstadoPublicada - 2008
Publicado de forma externa

Serie de la publicación

NombreStudies in Computational Intelligence
Volumen136
ISSN (versión impresa)1860-949X

Huella

Profundice en los temas de investigación de 'An efficient hyperheuristic for strip-packing problems'. En conjunto forman una huella única.

Citar esto