In *Studies in Computational Intelligence*, volume 136, pages 61-76, 2008.

doi abstract bibtex

doi abstract bibtex

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.

@inproceedings{10.1007/978-3-540-79438-7_3, 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.", year = "2008", title = "An efficient hyperheuristic for strip-packing problems", volume = "136", pages = "61-76", doi = "10.1007/978-3-540-79438-7\_3", booktitle = "Studies in Computational Intelligence" }

Downloads: 0