Please use this identifier to cite or link to this item:
|Title:||Automatic discovery of optimisation search heuristics for two dimensional strip packing using genetic programming||Authors:||Nguyen, S.
|Issue Date:||2012||Citation:||Nguyen, S.,Zhang, M.,Johnston, M.,Tan, K.C. (2012). Automatic discovery of optimisation search heuristics for two dimensional strip packing using genetic programming. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7673 LNCS : 341-350. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-34859-4_34||Abstract:||This paper presents a genetic programming based hyper-heuristic (GPHH) for automatic discovery of optimisation heuristics for the two dimensional strip packing problem (2D-SPP). The novelty of this method is to integrate both the construction and improvement procedure into a heuristic which can be evolved by genetic programming (GP). The experimental results show that the evolved heuristics are very competitive and sometimes better than the popular state-of-the-art optimisation search heuristics for 2D-SPP. Moreover, the evolved heuristics can search for good packing solutions in a much more efficient way compared to the other search methods. © 2012 Springer-Verlag.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/69471||ISBN:||9783642348587||ISSN:||03029743||DOI:||10.1007/978-3-642-34859-4_34|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 20, 2020
checked on Feb 17, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.