Abstract
Process planning is a function that establishes the technological requirements necessary to convert a part from its raw material to the finished form. Generally, the result of process planning is delivered to the workshop to guide the manufacturing process in the form of process plan. However, a part always has multi alternative process plans for the processing means and techniques are not unique, therefore, optimization and selection of process plans is an important task of flexible process planning. In this paper, the flexibility of process planning and the AND/OR network adopted to represent the flexibility of process plans were described, and a mathematical model for the optimization of flexible process planning based on the AND/OR network was established. On this basis, a new heuristic method, called cross-entropy (CE) approach, was proposed to optimize flexible process planning. In order to facilitate the implementation of the CE-based approach, the new sample representation and probability distribution parameter were introduced; meanwhile, the new sample generation mechanism was presented and the updating expression of probability distribution parameter was deduced. Case studies, used for comparing this approach with genetic algorithm (GA) and genetic programming (GP)-based approach, were discussed to indicate the performance and adaptability of the proposed CE-based approach in terms of the solution quality and computational efficiency of the algorithm. The results show that the CE-based approach is effective for the optimization research of flexible process planning.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Xu X, Wang LH, Newman ST (2011) Computer-aided process planning–A critical review of recent developments and future trends. Int J Comput Integ Manuf 24(1):1–31
Kumar M, Rajotia S (2006) Integration of process planning and schedulin g in a job shop environment. Int J Adv Manuf Technol 28:109–116
Yip HD, Dutta D (1996) A genetic algorithm application for sequencing operations in process planning for parallel machining. IIE Trans 28(1):55–68
Zhang F, Zhang YF, Nee AYC (1997) Using genetic algorithms in process planning for job shop machining. IEEE Trans Evol Comput 1(4):278–289
Qiao L, Wang XY, Wang SC (2000) A GA-based approach to machining operation sequencing for prismatic parts. Int J Prod Res 38(14):3283–3303
Ma GH, Zhang, Nee AYC (2000) A simulated annealing-based optimization algorithm for process planning. Int J Prod Res 38(12):2671–2687
Lee DH, Kiritsis D, Xirouchakis P (2001) Search heuristics for operation sequencing in process planning. Int J Prod Res 39(16):3771–3788
Li WD, Mcmahon CA (2007) A simulated annealing-based optimization approach for integrated process planning and scheduling. Int J Comput Integ Manuf 20(1):80–95
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
Li WD, Ong SK, Nee AYC (2002) Hybrid genetic algorithm and simulated annealing approach for the optimization of process plans for prismatic parts. Int J Prod Res 40(8):1899–1922
Kusiak A, Finke G (1988) Selection of process plans in automated manufacturing systems. IEEE J Rob Aut 4(4):397–402
Bhaskaran K (1990) Process plan selection. Int J Prod Res 28(8):1527–1539
Zhang HC, Huang SH (1994) A fuzzy approach to process plan selection. Int J Prod Res 32(6):1265–1279
Sormaz D, Khoshnevis B (2003) Generation of alternative process plans in integrated manufacturing systems [J]. J Intell Manuf 14(6):509–526
Lee KH, Junq MY (1994) Petri net application in flexible process planning. Comput Ind Eng 27(1–4):505–508
Seo Y, Egbelu PJ (1996) Process plan selection based on product mix and production volume. Int J Prod Res 34(9):2369–2655
Li XY, Shao XY, Gao L (2008) Optimization of flexible process planning by genetic programming. Int J Adv Manuf Tech l 38:143–153
Shao XY, Li XY, Gao L, Zhang CY (2009) Integration of process planning and scheduling—a modified genetic algorithm-based approach. Comput Oper Res 36(6):2082–2096
Rubinstein RY (1999) The cross-entropy method for combinatorial and continuous optimization. Meth and Comput App Prob 1(2):127–190
Rubinstein RY, Kroese DP (2004) The cross-entropy method: A unified approach to Monte Carlo simulation randomized optimization and Machine Learning. Springer, Verlag
Alon G, Kroese D, Raviv T, Rubinstein RY (2005) Application of the cross entropy method for optimal buffer allocation in a simulation based environment. Ann Oper Res 134(1):137–151
Chepuri K, Mello HDT (2005) Solving the vehicle routing problem with stochastic demands using the cross-entropy method. Ann Oper Res 134(1):153–181
Jedrzejowicz P, Skakovski A (2010) A cross-entropy-based population-learning algorithm for discrete continuous scheduling with continuous resource discretization. Neu Comput 73(4–6):655–660
Kroese DP, Rubinstein RY, Thomas T (2007) Application of the cross-entropy method to clustering and vector quantization. J Glob Opt 37(1):137–157
Qiao LH, Kao ST, Zhang YZ (2011) Manufacturing process modeling using process specification language. Int J Adv Manuf Tech 55(5–8):549–563
Ho YC, Moodie CL (1996) Solving cell formation problems in a manufacturing environment with flexible processing and routing capabilities. Int J Prod Res 34(10):2901–2923
Qiao LH, Lv SP (2012) An improved genetic algorithm for integrated process planning and scheduling. Int J Adv Manuf Tech 58(5–8):727–740
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lv, S., Qiao, L. A cross-entropy-based approach for the optimization of flexible process planning. Int J Adv Manuf Technol 68, 2099–2110 (2013). https://doi.org/10.1007/s00170-013-4815-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-013-4815-2