Improved cat swarm optimization algorithm for assembly sequence planning

Abstract

Assembly sequence planning (ASP) is a combinatorial optimization problem in which the order for each part and subassembly is determined. This order is then incorporated into an incrementally expanding subassembly and eventually results in a final assembly. To address this problem, we propose an improved cat swarm optimization (CSO) algorithm and redefine some basic CSO concepts and operations according to ASP characteristics. The feasibility and the stability of this improved CSO are verified through an assembly experiment. The improved CSO is also compared with particle swarm optimization. Experimental results show that the proposed algorithm effectively solves the ASP problem; thus, the application of the proposed algorithm should enhance ASP level.