Optimization of Operation Sequencing in CAPP Using Superhybrid Genetic Algorithms-Simulated Annealing Technique

Abstract EN

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 overconstrained overall solution space, and the final solution is normally far from optimal or even nonfeasible.

A single sequence of operations may not be the best for all the situations in a changing production environment with multiple objectives such as minimizing number of setups, maximizing machine utilization, and minimizing number of tool changes.

In general, the problem has combinatorial characteristics and complex precedence relations, which makes the problem more difficult to solve.

The main contribution of this work is to develop an intelligent CAPP system for shop-floor use that can be used by an average operator and to produce globally optimized results.

In this paper, the feasible sequences of operations are generated based on the precedence cost matrix (PCM) and reward-penalty matrix (REPMAX) using superhybrid genetic algorithms-simulated annealing technique (S-GENSAT), a hybrid metaheuristic.

Also, solution space reduction methodology based on PCM and REPMAX upgrades the procedure to superhybridization.

In this work, a number of benchmark case studies are considered to demonstrate the feasibility and robustness of the proposed super-hybrid algorithm.

This algorithm performs well on all the test problems, exceeding or matching the solution quality of the results reported in the literature.

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.

Also, the proposed S-GENSAT integrates solution space reduction, hybridization, trapping out of local minima, robustness, and convergence; it consistently outperformed both a conventional genetic algorithm and a conventional simulated annealing algorithm.