高级检索

遗传算法在快速成形轮廓路径规划中的应用

Application of Genetic Algorithm for Scanning Path Planning in Rapid Prototyping

  • 摘要: 以减少层片扫描中的空程运行时间为轮廓路径优化的目标,以轮廓路径与经典旅行商问题之优化的共性和不同为比对,在采用遗传算法实现快速成形轮廓路径的优化中,将轮廓路径的特点灵活应用到该算法的各个步骤中,有效地缩短了扫描路径中的空程距离,从而有利于提高成形速度和成形质量.

     

    Abstract: In this paper we study the way of reducing the back-play time in scanning process for optimizing the scanning path planning. Genetic algorithm (GA) is suitable to solve the optimization of complex problems such as group technology, reliability design, vehicle path selection and scheduling, transport, et al. Thus GA is utilized to settle the problem, based on the comparison between the optimization of scanning path and the optimization of traveling salesman problem (TSR). The features of scanning path are considered in achieving the method thoroughly including chromosome code, fitness function, cross operator, variation operator, choice way, control parameters, terminal condition and so on. The method can find optimized path and shorten the back-play time in scanning path. So it can improve efficiency and forming quality of RP system.

     

/

返回文章
返回