Abstract
Aiming at the problems of hereditability and reusability for process planning data in the enterprises, a novel method for discovering typical process sequence by applying granular computing and similarity algorithm based on part features is put forward. Firstly, a calculating model of process sequence similarity is built through the analysis and comparison of part features, including machining features and topological relations between features, and a fuzzy similarity matrix of all the process sequences is established. Afterwards, according to the theory of fuzzy quotient space, which is one of the theoretical models of granular computing, a process sequence quotient space family with hierarchical structure is constructed. The granularity of every process sequence quotient space is measured by information entropy, and the information gain, which means the difference of information entropy between two adjacent quotient spaces, is calculated. Finally, a quotient space with the bigger information gain as well as the higher minimal process sequence similarity in process information granules is determined as an optimal process information granular layer, in which some typical process sequences are acquired from process information granules by using longest common subsequence algorithm. An application example verifies the feasibility and validity of the proposed method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Liu XJ, Yi H, Ni ZH (2013) Application of ant colony optimization algorithm in process planning optimization. J Intell Manuf 24:1–13
Li SJ, Liu Y, Li Y, Landers RG, Tang L (2013) Process planning optimization for parallel drilling of blind holes using a two phase genetic algorithm. J Intell Manuf 24:791–804
Lian KL, Zhang CY, Shao XY, Gao L (2012) Optimization of process planning with various flexibilities using an imperialist competitive algorithm. Int J Adv Manuf Technol 59:815–828
Huang WJ, Hu YJ, Cai LG (2012) An effective hybrid graph and genetic algorithm approach to process planning optimization for prismatic parts. Int J Adv Manuf Technol 62:1219–1232
Nallakumarasamy G, Srinivasan PSS, Venkatesh Raja K, Malayalamurthi R (2011) Optimization of operation sequencing in CAPP using simulated annealing technique (SAT). Int J Adv Manuf Technol 54:721–728
Yusof Y, Latif K (2014) Survey on computer-aided process planning. Int J Adv Manuf Technol 75:77–89
Li XY, Gao L, Wen X (2013) Application of an efficient modified particle swarm optimization algorithm for process planning. Int J Adv Manuf Technol 67:1355–1369
Kafashi S (2011) Integrated setup planning and operation sequencing (ISOS) using genetic algorithm. Int J Adv Manuf Technol 56:589–600
Chen YF, Huang ZD, Chen LP, Wang QF (2006) Parametric process planning based on feature parameters of parts. Int J Adv Manuf Technol 28:727–736
Liu SN, Zhang ZM, Tian XT (2006) Applying hierarchical clustering to discover thetypical process route. Mater Sci Forum 532–533:949–952
Liu SN, Zhang ZM, Tian XT (2007) A typical process route discovery method based on clustering analysis. Int J Adv Manuf Technol 35:186–194
Zhang H, Qiu LM, Zhang SY, Hu XX (2013) Typical product process route extraction method based on intelligent clustering analysis. Comput Integr Manuf Syst 19:490–498
Tong YF, Li DB, Li CB, Yu MJ (2008) A feature-extraction-based process-planning system. Int J Adv Manuf Technol 38: 1192–1200
Mccormack AD, Ibrahim RN (2002) Process planning using adjacency-based feature extraction. Int J Adv Manuf Technol 20:817–823
Lin AC, Lin SY, Diganta D, Lu WF (1998) An integrated approach to determining the sequence of machining operations for prismatic parts with interacting features. J Mater Process Tech 73: 234–250
Lin TY (2000) Data mining and machine oriented modeling: a granular computing approach. Appl Intell 13:113–124
Lin TY (1999) Data mining: granular computing approach. Lect Notes Artif Intell 1574:24–33
Yao YY (2007) The art of granular computing. Lect Notes Artif Intell 4585:101–112
Pal SK, Meher SK (2013) Natural computing: a problem solving paradigm with granular information processing. Appl Soft Comput 13:3944–3955
Zhang B, Zhang L (1992) Theory of problem solving and its applications. Elsevier Science Publishers, North-Holland
Zhang L, Zhang B (2003) The quotient space theory of problem solving. Lect Notes Comput Sci 2639:11–15
Zhang L, Zhang B (2005) Fuzzy reasoning model under quotient space structure. Inform Sci 173:353–364
Zhang L, Zhang B (2005) The structure analysis of fuzzy sets. Int J Approx Reason 40:92–108
Tang XQ, Zhu P, Cheng JX (2008) Cluster analysis based on fuzzy quotient space. Chinese J Softw 19:861–868
Tang XQ, Zhu P, Cheng JX (2010) The structural clustering and analysis of metric based on granular space. Pattern Recogn 43:3768–3786
Zhang ZF (2012) Manufacturing complexity and its measurement based on entropy models. Int J Adv Manuf Technol 62: 867–873
Moreira C, Wichert A (2013) Finding academic experts on a multisensor approach using Shannons entropy. Expert Syst Appl 40:5740–5754
Stern H, Shmueli M, Berman S (2013) Most discriminating segment—longest common subsequence (MDSLCS) algorithm for dynamic hand gesture classification. Pattern Recogn Lett 34:1980–1989
Tasi CS, Huang YM, Liu CH, Huang YM (2012) Applying VSM and LCS to develop an integrated text retrieval mechanism. Expert Syst Appl 39:3974–3982
Liu JJ, Wang YL, Lee RCT (2008) Finding a longest common subsequence between a run-length-encoded string and an uncompressed string. J Complexity 24:173–184
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhou, D., Dai, X. A method for discovering typical process sequence using granular computing and similarity algorithm based on part features. Int J Adv Manuf Technol 78, 1781–1793 (2015). https://doi.org/10.1007/s00170-014-6772-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-014-6772-9