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).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Autonomous and Adaptive Communications Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
