改进离散人工蜂群算法规划异形满版服饰图案切割路径  

Improved Discrete Artificial Bee Colony Algorithm Plans the Path of Laser Cutting for Full Version of Different Dress Patterns

作　　者：丁斌[1] 裘建新[2] 

机构地区：[1]上海工程技术大学机械工程学院,上海201600 [2]上海工程技术大学服装学院,上海201600

出　　处：《轻工机械》2016年第1期37-42,共6页Light Industry Machinery

基　　金：上海市科学技术委员会科研课题基金(11510501600);上海纺织控股(集团)公司技术创新项目基金(2012-X-11)

摘　　要：服饰图案切割路径规划是服饰图案自动切割技术的关键部分之一。文中用改进的离散人工蜂群算法实现了激光切割系统对异形满版服饰图案的切割工艺路径规划优化。首先,把满版服饰图案激光切割路径规划转化为广义旅行商问题求解,证明了路径规划转化成普通TSP问题比转化成第一类广义TSP问题更为有效,并给出了路径规划中"图案始切割点"的优化选择方法。然后结合部分匹配交叉和启发式变异搜索方法的人工蜂群算法求解TSP问题,证明了与A*算法及遗传算法相比,该方法更为优越。并且该方法已应用于激光切割机切割异形满版服饰图案路径规划的生产实践,运行可靠,比未规划时的工艺路线平均提高效率33.7%。该方法提供了一种解决TSP问题的新方法,具有一定的理论意义和价值。Planning the path of cutting dress patterns is one a key part of automatic cutting dress patterns technologies. In this paper,the improved artificial bee colony algorithm was used to plan the path of laser cutting system for the full version of different dress patterns. First,converted planning path for full version of different dress patterns to generalized TSP,and it was proved that transforming this problem into ordinary TSP was better than generalized TSP,and gave the optimization method to select ＂ pattern start cutting point ＂. And then combined partially matched crossover and mutation heuristic search of artificial bee colony algorithm to solve TSP. Finally,comparing with the A＊algorithm and genetic algorithm this method was more advantageous. This method is used to plan the path for cutting full version of different patterns in apparel production practices,and it is reliable,the average efficiency increases 33. 7 percent. This method provides a new method to solve TSP,and has a certain theoretical significance and value.

关 键 词：服饰图案切割 人工蜂群算法 部分匹配交叉 启发式变异搜索 路径规划 激光切割 

分 类 号：TS941.56[轻工技术与工程—服装设计与工程] TP29[自动化与计算机技术—检测技术与自动化装置]