多路径交互环形过道布置问题建模及改进蚁狮算法优化  

Modeling of multi-path interactive annular corridor allocation problem and optimization of improved ant-lion algorithm

作　　者：王沙沙 张则强[1] 刘俊琦 陈凤 WANG Shasha;ZHANG Zeqiang;LIU Junqi;CHEN Feng(Key Laboratory of Sichuan Provincial Technology and Equipment of Rail Transit Operation and Maintenance,School of Mechanical Engineering,Southwest Jiaotong University,Chengdu 610031,China)

机构地区：[1]西南交通大学机械工程学院轨道交通运维技术与装备四川省重点实验室,四川成都610031

出　　处：《计算机集成制造系统》2021年第8期2237-2247,共11页Computer Integrated Manufacturing Systems

基　　金：国家自然科学基金资助项目(51205328,51675450);教育部人文社会科学研究青年基金资助项目(18YJC630255);四川省科技计划资助项目(2019YFG0285)。

摘　　要：为了结合生产中环形布局的特征分析不同交互路径对环形过道布置问题的影响,提出一种多路径交互环形过道布置问题,并构建其混合整数规划模型。设计了一种将随机行走机制与迭代机制融合的改进蚁狮算法,算法利用蚁狮衍生蚂蚁种群方式增强局部搜索能力,提高算法求解性能。通过精确求解小规模环形过道布置问题算例验证了模型的合理性与正确性。将该算法与遗传算法、禁忌搜索算法对所提问题求解的结果进行对比,表明改进蚁狮算法在求解质量与效率上更具有效性和优越性。To analyze the influence of different interactive paths on annular corridor allocation problem by combining with the characteristics of circular layout in production,a multi-path interactive annular corridor allocation problem was proposed,and its mixed integer programming model was constructed.An improved ant-lion optimizer algorithm was designed,which combined the random walk mechanism with the iterative mechanism.In the algorithm,ants were generated by ant lions to improve the local search ability of the algorithm.The rationality and correctness of the model were verified through solving small-scale examples of annular corridor allocation problem.Improved ant-lion optimizer was compared with genetic algorithm and tabu search algorithm,and the results showed that the proposed algorithm was effective and superior in solving quality and efficiency.

关 键 词：环形过道布置问题 多路径交互 混合整数规划模型 改进蚁狮算法 

分 类 号：TH181[机械工程—机械制造及自动化]