Title: A hybrid chemical reaction optimisation algorithm for solving 3D packing problem

Authors: Yaru Su; Yanming Ye; Shuhao Chen; Wenshuo Yang

Addresses: School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, 310018, China ' School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, 310018, China ' School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, 310018, China ' School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, 310018, China

Abstract: This paper combines the chemical reaction optimisation algorithm with the greedy algorithm to solve the three-dimensional bin packing problem (3D-BPP). Traditionally, the 3D-BPP is solved with algorithms based on particle swarm optimisation, genetic algorithm, or simulated annealing algorithm, etc. The chemical reaction optimisation algorithm is proposed in recent years, which has the advantages of traditional simulated annealing algorithm and has a faster convergence speed. After making appropriate adjustments to the chemical reaction optimisation algorithm, the experiment was performed on classic 320 examples. The results show that the proposed algorithm outperforms the existing algorithms such as greedy variable neighbourhood descent (GVND) and biased random key genetic algorithm (BRKGA).

Keywords: three-dimensional packing; chemical reaction optimisation algorithm; heuristic algorithm; 3D-BPP; three-dimensional bin packing problem; greedy algorithm; GVND; greedy variable neighbourhood descent; greedy CRO algorithm.

DOI: 10.1504/IJAACS.2021.114296

International Journal of Autonomous and Adaptive Communications Systems, 2021 Vol.14 No.1/2, pp.117 - 131

Received: 25 Jun 2019
Accepted: 15 Jan 2020
Published online: 15 Apr 2021 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article