An effective hybrid honey bee mating optimization algorithm for integrated process planning and scheduling problems

Abstract

Process planning and scheduling are two of the most important functions of a manufacturing system. Traditionally, these two functions are executed separately. Since they are interrelated, conducting process planning and scheduling simultaneously will provide more advantages. In this paper, according to the characteristics of the integrated process planning and scheduling (IPPS) problem, a hybrid honey bee mating optimization (HBMO) algorithm, which combines the HBMO algorithm and variable neighborhood search (VNS), is proposed to settle the problem with makespan criterion. Different with conventional HBMO, we utilize VNS with two effective and efficient neighborhood structures in the algorithm to simulate the workers’ brood caring action to avoid premature convergence and to find more excellent broods. In addition, a novel individual initialization method is developed in the algorithm. The proposed algorithm is tested on typical benchmark instances taken from related literature, and the computational results are compared with those of other algorithms. Experimental results show the effectiveness and efficiency of the hybrid HBMO algorithm. New upper bounds have been captured for 16 instances, and most instances have been improved within reasonable CPU times.