考虑物料装卸点的过道布置问题及改进灰狼算法求解方法  

Improved grey wolf algorithm for corridor allocation problem considering material loading and unloading points

作　　者：计丹 张则强[1,2] 刘俊琦 陈凤 方潇悦 JI Dan;ZHANG Zeqiang;LIU Junqi;CHEN Feng;FANG Xiaoyue(School of Mechanical Engineering,Southwest Jiaotong University,Chengdu 610031,China;Sichuan Provincial Key Laboratory of Technology and Equipment of Rail Transit Operation and Maintenance,Chengdu 610031,China)

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

出　　处：《计算机集成制造系统》2024年第1期300-315,共16页Computer Integrated Manufacturing Systems

基　　金：国家自然科学基金资助项目(52375268,52342505);教育部人文社会科学研究规划基金资助项目(23YJA630139);四川省自然科学基金资助项目(24NSFSC7130);中央高校基本科研业务费专项资金资助项目(2682023CX009)。

摘　　要：针对制造和服务系统中假定物料装卸点重合以及设施间物流量对称的不足,结合实际生产布局对过道布置问题进行拓展,以最小化物流成本为目标,提出考虑物料装卸点及非对称流量的过道布置问题,并建立混合整数规划模型。根据问题与模型的特征,设计一种改进灰狼算法进行求解,该算法采用双层整数编码生成初始解,通过将收敛因子非线性化、比例权重动态化对原始灰狼算法进行改进。通过融合反向学习机制和种群更新机制进一步扩大搜索解空间,并添加双阈值停止准则降低多余的迭代次数。将该算法与LINGO求解器对5~49不同规模算例的计算结果进行比较,证明了模型的正确性以及算法的有效性。最后,运用该算法对初始过道布置问题进行求解,并与其他算法的求解结果进行比对,进一步证明了所提算法的优越性。To solve the problem of corridor layout in manufacturing and service system,which assumed that the material loading and unloading points were overlapped and the material flow between facilities was symmetrical,the corridor allocation problem was extended in combination with the actual production layout.To minimize the logistics cost,the corridor allocation problem considering the material loading and unloading points and asymmetric flow was proposed,and the mixed integer programming model was established.According to the characteristics of the problem and model,an improved grey wolf algorithm was designed to solve the problem.The algorithm used double-layer integer coding to generate the initial solution,and improved the original grey wolf algorithm by nonlinear convergence factor and dynamic proportional weight.By combining the reverse learning mechanism and the population updating mechanism,the search solution space was further expanded,and the double threshold stop criterion was added to reduce the number of redundant iterations.Compared with LINGO solver,the results of 5~49 different scale examples showed that the model was correct and the algorithm was effective.Finally,the algorithm was used to solve the initial corridor allocation problem,and the results were compared with other algorithms,which further demonstrated the advantage of the proposed algorithm.

关 键 词：物料装卸点 非对称流量 过道布置问题 混合整数规划模型 灰狼算法 

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