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.
Similar content being viewed by others
References
Weill R, Spur G, Eversheim W (1982) Survey of computer-aided process planning systems. Ann CIRP 31:539–551
Lin CJ, Wang HP (1993) Optimal operation planning and sequencing-minimization of tool change overs. Int J Prod Res 31:311–324
Koulamas C (1993) Operations sequencing and machining economics. Int J Prod Res 31(4):957–975
Bhaskara Reddy SV, Shunmugam MS, Narendran TT (1999) Operation sequencing in CAPP using genetic algorithms. Int J Prod Res 37(5):1063–1074
Li L, Fuh JYH, Zhang YF, Nee AYC (2005) Application of genetic algorithm to computer-aided process planning in distributed manufacturing environments. Robot Comput-Integr Manuf 21:568–578
Foerster H, Wischer G (1998) Simulated annealing for order spread minimization in sequencing cutting patterns. Eur J Oper Res 110:272–281
Li WD, Ong SK, Nee AYC (2004) Optimization of process plans using a constraint-based tabu search approach. Int J Prod Res 42(10):1955–1985
Krishna AG, Rao KM (2006) Optimisation of operations sequence in CAPP using an ant colony algorithm. Int J Adv Manuf Technol 29:159–164
Guo YW, Mileham AR, Owen GW, Li WD (2006) Operation sequencing optimization using a particle swarm optimization approach. Proc Inst Mech Eng, B: J Eng Manuf 220(B12):1945–1958
Mojtaba S, Reza T-M (2009) Application of genetic algorithm to computer-aided process planning in preliminary and detailed planning. Eng Appl Artif Intell. doi:10.1016/j.engappai.2009.04.005
Korde UP, Bora BC, Stelson KA, Riley DR (1992) Computer-aided process planning for turned parts using fundamental and heuristic principles. J Eng Ind 114:31–40
Maniezzo V, Colornia (1999) The ant system applied to the quadratic assignment problem. IEEE Trans Data Knowl Eng 11(5):769–778
Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680
Turkay DI, Huseyin F (1999) Optimisation of process planning functions by genetic algorithms. Int J Comput Ind Eng 36:281–308
Irani SA, Koo HY, Ranam S (1995) Feature based operation sequence generation in CAPP. Int J Prod Res 33:17–39
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Nallakumarasamy, G., Srinivasan, P.S.S., Venkatesh Raja, K. et al. Optimization of operation sequencing in CAPP using simulated annealing technique (SAT). Int J Adv Manuf Technol 54, 721–728 (2011). https://doi.org/10.1007/s00170-010-2977-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-010-2977-8