›› 2014, Vol. 50 ›› Issue (11): 153-160.
• Article • Previous Articles Next Articles
LEI Weijun,;CHENG Xiaosheng,;DAI Ning,;GUO Baosu,;LI Xiangjia
Published:
Abstract: In order to increase the total machining efficiency in NC machining, multiple models are machined in a piece of blank frequently. To solve the machining path planning of multiple models, a method by adjusting the machining model and its connected points several times is presented. On the basis of simplifying the machining contour to the geometrical center of the machining model, genetic algorithm is adopted to plan the general machining route of the multiple models. On the situation of avoiding the interference between machining models, the posture and the start point of the machining model are transformed to shorten the machining length between adjacent models. To solve the problems of genetic algorithm premature and hard to jump out of local optimal solution, parent and child are set to participate in competition and adaptive genetic operators is adopted to improve the genetic algorithm. The experimental results show that this method can effectively minimize the overall processing length and the improved genetic algorithm has great convergence results.
Key words: multi-model machining;genetic algorithm;path planning
CLC Number:
TH164
TP391
LEI Weijun;CHENG Xiaosheng;DAI Ning;GUO Baosu;LI Xiangjia. Multi-model Machining Path Planning Based on Improved Genetic Algorithm[J]. , 2014, 50(11): 153-160.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://www.cjmenet.com.cn/EN/
http://www.cjmenet.com.cn/EN/Y2014/V50/I11/153