Authors: Defu Zhang Yuxin Che Furong Ye YainWhar Si Stephen C H Leung
Publish Date: 2016/06/13
Volume: 32, Issue: 2, Pages: 513-530
Abstract
This paper addresses the strip packing problem which has a wide range of realworld applications Our proposed algorithm is a hybrid metaheuristic that combines an improved heuristic algorithm with a variable neighbourhood search Different neighbourhoods are constructed based on the concept of block patterns The proposed algorithm has three interesting features First a leastwaste strategy is used to improve the constructive heuristics Second a better sorting sequence is selected to generate an initial solution Finally different neighbourhoods are constructed based on block patterns The computational results from a diverse set of problem instances show that the proposed algorithm performs better than algorithms reported in the literature for most of the problem sets comparedDefu Zhang would like to thank his supervisor Prof Wenqi Huang who taught him a great deal about research This work was in memory of Prof Wenqi Huang and was partially supported by the National Nature Science Foundation of China Grant no 61272003 Research Committee of University of Macau MYRG041Y1L1 FST13SYW and a grant from City University of Hong Kong Project No 7004149 The authors would like to thank the reviewers for their valuable comments that help improve this paper
Keywords: