A hybrid algorithm combining genetic algorithm and variable neighborhood search for process sequencing optimization of large-size problem

Abstract

ABSTRACT On the premise of satisfying the process priority relationship, there are many kinds of feasible sequencing schemes. How to obtain the optimal process sequencing meeting the process priority relationship has always been a popular research area in the field of CAPP (Computer-Aided Process Planning). Currently, some achievements have been made in the field of small and medium-size problems. For large-size problems, due to the explosion of solution space, the existing bionic algorithms are easy to fall into local optimum or even non-convergence. In this paper, a hybrid algorithm combining genetic algorithm and variable neighborhood search is proposed to solve the above problems. The basic idea is to decompose the complex and huge solution space into relatively simple multi-neighborhood spaces, and then search in each neighborhood space by genetic algorithm in turn. The global optimal solution is obtained when a solution is the best solution through all neighborhood spaces. Based on this idea, the hybrid algorithm framework and neighborhood construction rules are developed, and the implementation steps of the hybrid algorithm are detailed. Taking a real-world case as the case study, the feasibility and superiority of the proposed hybrid algorithm are demonstrated by algorithm comparison tests.