An evolutionary hyperheuristic to solve strip-packing problems

14Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we introduce an evolutionary hyperheuristic approach to solve difficult strip packing problems. We have designed a genetic based hyperheuristic using the most recently proposed low-level heuristics in the literature. Two versions for tuning parameters have also been evaluated. The results obtained are very encouraging showing that our approach outperforms the single heuristics and others well-known techniques. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Garrido, P., & Riff, M. C. (2007). An evolutionary hyperheuristic to solve strip-packing problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4881 LNCS, pp. 406–415). Springer Verlag. https://doi.org/10.1007/978-3-540-77226-2_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free