You can view the full text of this article for free using the link below.

Title: Dual neighbourhood discrete artificial bee colony algorithm for the convex polygons packing problem with constraints of equilibrium

Authors: Zhendong Huang; Renbin Xiao

Addresses: School of Information Management and Statistics, Hubei University of Economics, Wuhan 430205, China ' School of Automation, Huazhong University of Science and Technology, Wuhan 430074, China

Abstract: For the optimal packing problem of convex polygons in a circular container with performance constraint, a hybrid algorithm which combines an improved ripple exploratory heuristic algorithm (IREHA) with dual-neighbourhood discrete artificial bee colony algorithm (DDABC) is proposed. IREHA improves search efficiency of the original REHA. Because of the excellent performance of artificial bee colony algorithm, which can not be directly used to optimise the discrete packing order, DDABC based on discrete dual neighbourhood structure is designed to combine with IREHA to form hybrid algorithm. The numerical experiments show that the hybrid algorithm is very effective.

Keywords: equilibrium constraints; packing optimisation; heuristic; discrete artificial bee colony algorithm; dual neighbourhood.

DOI: 10.1504/IJICA.2018.090821

International Journal of Innovative Computing and Applications, 2018 Vol.9 No.1, pp.1 - 12

Available online: 16 Mar 2018 *

Full-text access for editors Access for subscribers Free access Comment on this article