.png){kind=icon}
.png){kind=icon}
Return
A new heuristic algorithm for the one-dimensional bin-packing problem
.png){kind=icon}
PRE
AI
DOI：10.1080/095372899232894.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We describe a new heuristic algorithm to solve the one-dimensional bin-packing problem. The proposed algorithm is optimal if the sum of requirements of items is less than or equal to twice the bin capacity. Our computational results show that effectiveness of the proposed algorithm in finding optimal or near-optimal solutions is superior to that of the FFD and BFD algorithms, specifically for those so called 'difficult' problems that require an optimal solution to fill most of the bins: if not all, exactly to capacity.
Keywords:
heuristic algorithm
bin-packing
optimization
parallel machine scheduling
empirical results
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
P
IF:
5.4
Papers:
2.6K
Citations:
8.1K
Organization
No organization information available