An effective hybrid graph and genetic algorithm approach to process planning optimization for prismatic parts

• Published in: International journal of advanced manufacturing technology Vol. 62; no. 9-12; pp. 1219 - 1232
• Main Authors: Huang, Weijun, Hu, Yujin, Cai, Ligang
• Format: Journal Article
• Language: English
• Published: London Springer-Verlag 01.10.2012; Springer Nature B.V
• Subjects: CAD; CAD/CAM; CAE) and Design; CAM; Combinatorial analysis; Computer aided design; Computer aided manufacturing; Computer integrated manufacturing; Computer-Aided Engineering (CAD; Engineering; Feasibility studies; Genetic algorithms; Graph theory; Heuristic methods; Industrial and Production Engineering; Manufacturing; Matrix methods; Matrix theory; Mechanical Engineering; Media Management; Mutation; Optimization; Original Article; Precedence constraints; Prismatic components; Process planning; Sequences; Sorting algorithms; Operation sequencing; Operation precedence graph; Process planning; Genetic algorithm; Optimization
• ISSN: 0268-3768; 1433-3015
• DOI: 10.1007/s00170-011-3870-9

Computer-aided process planning is an important interface between computer-aided design and computer-aided manufacturing in computer-integrated manufacturing environments. In this paper, the complicated process planning is modeled as a combinatorial optimization problem with constraints, and a hybrid graph and genetic algorithm (GA) approach has been developed. The approach deals with process planning problems in a concurrent manner by simultaneously considering activities such as sequencing operations, selecting manufacturing resources, and determining setup plans to achieve the global optimal objective. Graph theory accompanied with matrix theory, as the basic mathematical tool for operation sequencing, is embedded into the main frame of GA. The precedence constraints between operations are formulated in an operation precedence graph (OPG). The initial population composed of all feasible solutions is generated by an elaborately designed topologic sort algorithm to the OPG. A modified crossover operator guaranteeing only feasible offspring generated is used, two types of mutation strategies are adopted, and a heuristic algorithm is applied to adjust the infeasible plan generated by the mutation operator to the feasible domain. A case study has been carried out to demonstrate the feasibility and efficiency of the proposed approach.