DocumentCode :
2539691
Title :
An Approach of Obtaining Global and Near-global Optimal Process Plans Based on GA Considering Operations Precedence Constraints
Author :
Guangru Hua ; Xiaoliang Fan
Author_Institution :
Dept. of Mech. Eng., North China Electr. Power Univ., Baoding, China
fYear :
2010
fDate :
13-15 Dec. 2010
Firstpage :
308
Lastpage :
311
Abstract :
An approach is proposed to obtain global and near-global optimal process plans based on genetic algorithm. During the procedure of initializing and mutating populations, operations precedence constraints are employed by constraint adjustment algorithm to ensure each chromosome stays in feasible domain. Operations precedence constraints can be generated automatically from the selected alternative machining processes for each feature. Through comparing those optimal process plan candidates created from genetic algorithm, the global and near-global optimal process plans could be obtained. A case study has been conducted to demonstrate the effectiveness of the proposed approach.
Keywords :
constraint theory; genetic algorithms; machining; GA; constraint adjustment algorithm; genetic algorithm; machining process; near global optimal process plan; operation precedence constraint; Biological cells; Drilling; Gallium; Milling; Optimization; Process planning; constraint adjustment algorithm; genetic algorithm; operations precedence constraints; optimal process plans;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Genetic and Evolutionary Computing (ICGEC), 2010 Fourth International Conference on
Conference_Location :
Shenzhen
Print_ISBN :
978-1-4244-8891-9
Electronic_ISBN :
978-0-7695-4281-2
Type :
conf
DOI :
10.1109/ICGEC.2010.83
Filename :
5715431
Link To Document :
بازگشت