.png){kind=icon}
Return
A hybrid heuristic algorithm for the 2D problem variable-sized bin packing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2014.03.049.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we consider the two-dimensional variable-sized bin packing problem (2DVSBPP) with guillotine constraint. 2DVSBPP is a well-known NP-hard optimization problem which has several real applications. A mixed bin packing algorithm (MixPacking) which combines a heuristic packing algorithm with the Best Fit algorithm is proposed to solve the single bin problem, and then a backtracking algorithm which embeds MixPacking is developed to solve the 2DVSBPP. A hybrid heuristic algorithm based on iterative simulated annealing and binary search (named HHA) is then developed to further improve the results of our Backtracking algorithm. Computational experiments on the benchmark instances for 2DVSBPP show that HHA has achieved good results and outperforms existing algorithms. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Packing
Guillotine constraint
Simulated annealing
Heuristic
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveOn the Impact of Formative Assessment on Student Motivation, Achievement, and Conceptual Change
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more