Optimization of operation sequencing in CAPP using simulated annealing technique (SAT)

Abstract

Computer-aided process planning (CAPP) is an important interface between computer-aided design (CAD) and computer-aided manufacturing (CAM) in computer-integrated manufacturing environment. A problem in traditional CAPP system is that the multiple planning tasks are treated in a linear approach. This leads to an over constrained overall solution space and the final solution is normally far from optimal or even non-feasible. The operation-sequencing problem in process planning is considered to produce a part with the objective of minimizing the sum of machine, setup and tool change costs. In general, the problem has combinatorial characteristics and complex precedence relations, which makes the problem more difficult to solve. In this paper, the feasible sequences of operations are generated based on the precedence cost matrix and reward–penalty matrix using simulated annealing technique (SAT), a meta-heuristic. A number of benchmark case studies are carried out to demonstrate the feasibility and robustness of the proposed algorithm. This algorithm performs well on all the test problems, exceeding or matching the solution quality of the results reported in the literature for most problems. The main contribution of this work focuses on reducing the optimal cost with a lesser computational time along with generation of more alternate optimal feasible sequences. The proposed SAT integrates robustness, convergence and trapping out of local minima.