A hybrid chemical reaction optimisation algorithm for solving 3D packing problem. (7th April 2021)

• Record Type: Journal Article
• Authors: Su, Yaru; Ye, Yanming; Chen, Shuhao; Yang, Wenshuo
• Is Part Of: International journal of autonomous and adaptive communications systems. Volume 14:Number 1/2(2021)
• Page Start: 117
• Page End: 131
• Publication Date: 2021-04-07
• Subjects: 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; Adaptive computing systems -- Periodicals; Wireless communication systems -- Periodicals; Computer networks -- Periodicals; 004.6
• Languages: English
• ISSNs: 1754-8632

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).