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

摘要

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.