Abstract: This paper proposes a hybrid Harmony Search algorithm for the bin-packing problem. The bin-packing problem is a well-known NP-Hard optimization problem. The proposed algorithm (called BPHS) ...
Abstract: The online 3D bin packing problem (O3D-BPP) is a very difficult and challenging combinatorial optimization problem. In the classic O3D-BPP problem, the agent only knows the information of ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results