A hybrid biogeography-based optimization algorithm for three-dimensional bin size designing and packing problem

•A three-dimensional bin size designing and packing problem is investigated.•A novel hybrid algorithm is proposed to solve the problem.•Experiments are carried out on a practical bin packing application.•The performance of the hybrid algorithm is assessed and reviewed.•This is the first study to dis...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers & industrial engineering Ročník 180; s. 109239
Hlavní autori: Chen, Mingzhou, Huo, Jiazhen, Duan, Yongrui
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Ltd 01.06.2023
Predmet:
Differential evolution
Hybrid biogeography-based optimization
Packing method
Three-dimensional bin size designing and packing problem
Differential evolution
Three-dimensional bin size designing and packing problem
Hybrid biogeography-based optimization
Packing method
ISSN:0360-8352, 1879-0550
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•A three-dimensional bin size designing and packing problem is investigated.•A novel hybrid algorithm is proposed to solve the problem.•Experiments are carried out on a practical bin packing application.•The performance of the hybrid algorithm is assessed and reviewed.•This is the first study to discuss the bin size design aspect of the problem. The three-dimensional bin packing problem (3D-BPP) plays a critical role in logistics activities. Prior studies focus on 3D-BPP in cases where bin size is predetermined. However, bin volume utilization can be improved significantly by optimizing bin size. In this study, we propose a novel three-dimensional bin size designing and packing problem (3D-BSDPP) and a hybrid biogeography-based optimization (HBBO) algorithm to address the problem by maximizing bin volume utilization by optimizing the bin size. The HBBO combines a differential evolution algorithm with basic biogeography-based optimization to improve exploration ability, and a novel local search strategy involving three specific local search operators is proposed to accelerate the HBBO convergence. Finally, a novel heuristic packing method is employed to find a high-quality packing solution. The proposed algorithm is evaluated through experiments carried out on a practical bin packing application. The results indicate that the proposed algorithm outperforms existing algorithms in solving the 3D-BSDPP.
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2023.109239