检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王炬成[1] 赵学涛 WANG Jucheng;ZHAO Xuetao(School of Naval Architecture&Ocean Engineering,Jiangsu University of Science and Technology,Zhenjiang 212100,Jiangsu,China)
机构地区:[1]江苏科技大学船舶与海洋工程学院,江苏镇江212100
出 处:《造船技术》2024年第1期1-7,27,共8页
基 金:工业和信息化部高技术船舶项目(编号:MC-201917-C09)。
摘 要:针对大型邮船舱室模块运输过程中存在的移运路线长、路线混乱、舱室模块易与障碍物发生碰撞等问题,提出应用加入动态搜索模型的蚁群算法对邮船舱室模块进行路线规划,为运输舱室模块提供清晰、便捷的移运路线。对主竖区的障碍物进行分析,建立模拟实际工况的栅格地图,采用改进蚁群算法寻找移运路径。对不同位置所经过的栅格地图和蚁群数量进行动态调整。采用模拟退火算法寻找蚁群算法的参数。采用离散点分析确定移运路径的主、支通道。仿真试验结果表明,应用改进蚁群算法建立主、支通道进行舱室模块移运可有效提高舱室模块的运输效率。In view of the problems such as long transport path,chaotic path,and easy collision with obstacles during the transport of large cruise ship cabin modules,an ant colony algorithm with dynamic search model is proposed for the path planning of cruise ship cabin modules,so as to provide the clear and convenient transport path for the transport of cabin modules.The obstacles in the main vertical zone are analyzed,the grid map simulating the actual working conditions is established,and the transport path is sought with the improved ant colony algorithm.The grid map of different locations and the number of ant colonies are dynamically adjusted.The parameters of the ant colony algorithm are sought with the simulated annealing algorithm.The main and branch channels of transport path are determined with the discrete point analysis.The simulation results show that establishing the main and branch channels for the transport of cabin modules with the improved ant colony algorithm can effectively improve the transport efficiency of cabin modules.
关 键 词:邮船 舱室模块 移运路径规划 改进蚁群算法 动态搜索模型 障碍物优化 模拟退火算法
分 类 号:U671.4[交通运输工程—船舶及航道工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.219.206.240