EconPapers    
Economics at your fingertips  
 

A hybrid algorithm based on variable neighbourhood for the strip packing problem

Defu Zhang (), Yuxin Che, Furong Ye, Yain-Whar Si and Stephen C. H. Leung
Additional contact information
Defu Zhang: Xiamen University
Yuxin Che: Xiamen University
Furong Ye: Xiamen University
Yain-Whar Si: University of Macau
Stephen C. H. Leung: The University of Hong Kong

Journal of Combinatorial Optimization, 2016, vol. 32, issue 2, No 11, 513-530

Abstract: Abstract This paper addresses the strip packing problem, which has a wide range of real-world 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 least-waste 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 compared.

Keywords: Packing problem; Variable neighbourhood search; Heuristic algorithm; Combinatorial optimisation (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0036-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:32:y:2016:i:2:d:10.1007_s10878-016-0036-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0036-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:32:y:2016:i:2:d:10.1007_s10878-016-0036-6