IEEE

Solving 0-1 Knapsack and Bin Packing Problem Using Logical Social Group Optimization

Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...
IEEE

A multiobjective ant colony-based optimization algorithm for the bin packing problem with load balancing

Abstract: This paper presents ABLA, a novel multiobjective ant colony-based optimization algorithm to address the bin packing problem with load balancing. ABLA incorporates (1) a new probabilistic ...
University of Waterloo

Characterizing the optimality gap and the optimal packings for the bin packing problem

Elhedhli, S. , & Gzara, F. . (2015). Characterizing the optimality gap and the optimal packings for the bin packing problem. Optimization Letters, 9, 209–223 ...
Ars Technica

Best Fit Algorithm/bin packing problem

Does anyone have a code for the best fir algorigthm, it is a type of bin packing, or better yet, can anyone help me with this program?<BR><BR>Problem 1: CD Dubbing Optimization <BR><BR> A feature now ...
GitHub

3D Multi-Container Bin Packing Algorithm

실제 산업 제약조건을 고려한 다중 컨테이너 3D 빈 패킹 문제를 해결하는 2단계 멀티-휴리스틱 알고리즘 구현. bin_packing_3d/ ├── models/ # 핵심 데이터 구조 │ ├── item.py # Item, ItemType 클래스 ...