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 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.
Highlights
This section presents a brief overview of the Computer-aided process planning (CAPP) and importance of sequencing, a short description of the complexity of this class of problem, and the need for global search techniques to efficiently solve it.Process planning is defined as the activity of deciding which manufacturing processes and machines should be used to perform the various operations necessary to produce a component, and the sequence that the processes should follow
To determine the optimal sequence, various classical techniques like branch and bound methods, linear programming, and dynamics programming have been extensively discussed in detail [2–4], and demonstrated a strategy for CAPP in the single-machine case using a feature precedence graph to represent the relative costs of set-up changes required for any two consecutive operations
[11] investigated the application of constrained-based tabu search approach for optimization of process plans. Further it was investigated by Krishna and Rac [12] using Ant colony algorithm (ACA) and found that the computational time has considerably reduced
Summary
We present a brief overview of the CAPP and importance of sequencing, a short description of the complexity of this class of problem, and the need for global search techniques to efficiently solve it. To determine the optimal sequence, various classical techniques like branch and bound methods, linear programming, and dynamics programming have been extensively discussed in detail [2–4], and demonstrated a strategy for CAPP in the single-machine case using a feature precedence graph to represent the relative costs of set-up changes required for any two consecutive operations. [11] investigated the application of constrained-based tabu search approach for optimization of process plans Further it was investigated by Krishna and Rac [12] using Ant colony algorithm (ACA) and found that the computational time has considerably reduced. Salehi et al [14] again applied genetic algorithms to generate the optimal sequence of manufacturing operations in preliminary and detailed planning. Wang et al [16] applied hybrid particle swarm optimization for process planning problem and suggested that the algorithm has shown the capability for attaining a good quality of solution. Essence of both the algorithms are merged together to activate the superhybrid algorithm
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
