Sequential heuristic for the two-dimensional bin-packing problem
作者： Yi-Ping Cui , Yaodong Cui , Tianbing Tang
DOI: 10.1016/J.EJOR.2014.06.032
关键词:
摘要: Abstract A heuristic approach for the two-dimensional bin-packing problem is proposed. The algorithm based on sequential procedure that generates each pattern to produce some items and repeats until all are produced. Both guillotine non-guillotine patterns can be used. Each obtained from calling a pattern-generation procedure, where objective maximize value. item values adjusted after generation of using value correction formula. compared with five published algorithms, 50 groups benchmark instances. results indicate most efficient in improving solution quality.
elsevier.com
sci-hub.se 参考文章(25)
Lijun Wei, Defu Zhang, Qingshan Chen, A least wasted first heuristic algorithm for the rectangular packing problem Computers & Operations Research. ,vol. 36, pp. 1608- 1614 ,(2009) , 10.1016/J.COR.2008.03.004
Joseph El Hayek, Aziz Moukrim, Stéphane Negre, New resolution algorithm and pretreatments for the two-dimensional bin-packing problem Computers & Operations Research. ,vol. 35, pp. 3184- 3201 ,(2008) , 10.1016/J.COR.2007.02.013
Christoforos Charalambous, Krzysztof Fleszar, A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts Computers & Operations Research. ,vol. 38, pp. 1443- 1451 ,(2011) , 10.1016/J.COR.2010.12.013
Mauro Dell'Amico, Silvano Martello, Daniele Vigo, A lower bound for the non-oriented two-dimensional bin packing problem Discrete Applied Mathematics. ,vol. 118, pp. 13- 24 ,(2002) , 10.1016/S0166-218X(01)00253-0
François Clautiaux, Antoine Jouglet, Joseph El Hayek, A new lower bound for the non-oriented two-dimensional bin-packing problem Operations Research Letters. ,vol. 35, pp. 365- 373 ,(2007) , 10.1016/J.ORL.2006.07.001
Wei Han, Julia A. Bennell, Xiaozhou Zhao, Xiang Song, Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints European Journal of Operational Research. ,vol. 230, pp. 495- 504 ,(2013) , 10.1016/J.EJOR.2013.04.048
Chung-Shou Liao, Chia-Hong Hsu, New lower bounds for the three-dimensional orthogonal bin packing problem European Journal of Operational Research. ,vol. 225, pp. 244- 252 ,(2013) , 10.1016/J.EJOR.2012.10.024
MarcoA. Boschetti, Aristide Mingozzi, The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds A Quarterly Journal of Operations Research. ,vol. 1, pp. 135- 147 ,(2003) , 10.1007/S10288-002-0006-Y
Andrea Lodi, Silvano Martello, Michele Monaci, Two-dimensional packing problems: A survey European Journal of Operational Research. ,vol. 141, pp. 241- 252 ,(2002) , 10.1016/S0377-2217(02)00123-6
Yaodong Cui, Liu Yang, Qiulian Chen, Heuristic for the rectangular strip packing problem with rotation of items Computers & Operations Research. ,vol. 40, pp. 1094- 1099 ,(2013) , 10.1016/J.COR.2012.11.020