船体装配线划线路径规划的蚁群算法  

Ant colony algorithm for mark-line path planning

作　　者：吴俊杰[1] 纪卓尚[1] 常会青 

机构地区：[1]大连理工大学船舶CAD工程中心,辽宁大连116024 [2]中远船务集团工程有限公司技术中心,辽宁大连116113

出　　处：《哈尔滨工程大学学报》2012年第10期1205-1210,共6页Journal of Harbin Engineering University

基　　金：公益性行业(农业)科研专项基金资助项目(201003024)

摘　　要：船体零件装配线划线作业是与船体零件切割作业同时进行的,是现代造船模式中的一个重要环节.将船体零件划线路径规划问题作为广义旅行商问题进行分析,针对划线路径的特殊性,建立提出了改进的蚁群算法的路径规划模型,采用最大-最小蚁群算法进行优化,分析了算法中各参数取值对算法性能的影响,并同遗传算法作了比较.实验结果表明,基于蚁群算法的优化模型可以有效减少划线路径空走距离.实际应用表明可有效地减少作业时间,提高船厂生产效率.Hull parts mark-line marking, which is done with the numerical control cutting operations at the same time, was one of the important taches in modern shipbuilding. The marking path planning problem would be regarded as the traveling salesman problem. According to the special of the marking path, a planning model was proposed based on an improved ant colony optimization algorithm and max-min ant system was applied to optimize the problem. By analysis and simulation, the best value range and combinatorial optimization settings of parameters was given. Then the comparison with genetic algorithms was given. The simulation results show that the optimization model is effective, which can effectively reduce the idle marking path.

关 键 词：船体零件 配线划线 蚁群算法 旅行商问题 路径规划 

分 类 号：U671.99[交通运输工程—船舶及航道工程]