An efficient hyperheuristic for strip-packing problems

Araya, I.; Neveu, B; Riff M.C.

Abstract

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. © 2008 Springer-Verlag Berlin Heidelberg.

Más información

Título según SCOPUS: An efficient hyperheuristic for strip-packing problems
Título de la Revista: SERVICE ORIENTATION IN HOLONIC AND MULTI-AGENT MANUFACTURING
Volumen: 136
Editorial: SPRINGER-VERLAG BERLIN
Fecha de publicación: 2008
Página de inicio: 61
Página final: 76
URL: http://www.scopus.com/inward/record.url?eid=2-s2.0-45949092127&partnerID=q2rCbXpz
Notas: SCOPUS