检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:高帅[1] 管兴胤[1] 郝帅 叶洋 GAO Shuai;GUAN Xingyin;HAO Shuai;YE Yang(Northwest Institute of Nuclear Technology,Xi'an 710024,China)
出 处:《工业工程》2022年第6期71-81,共11页Industrial Engineering Journal
摘 要:针对工业实际中设施物流交互点与其靠过道边线中点存在不重合的情况,提出一种考虑设施左右镜像情况的过道布置问题(MFCAP),建立该问题的整数规划模型,并提出一种适用于MFCAP的改进离散蝴蝶优化算法。该算法在标准蝴蝶优化算法的基础上对编码方法和相关操作进行离散化构造,通过自适应模式切换概率提高算法的搜索速度,采用精英增强进化、反向扩散灾变等方法提高算法的搜索精度。为验证所提模型的正确性,采用分支定界法和改进离散蝴蝶优化算法对小规模MFCAP算例进行精确求解。为验证所提算法的有效性,将改进离散蝴蝶优化算法与其他启发式算法在较大规模算例中的求解结果进行对比。结果表明,所提改进离散蝴蝶优化算法在应用于MFCAP时具有较高的寻优质量和寻优效率,是求解MFCAP问题的一种有效方法。In view of the fact that the logistics interaction point of the facility in the industrial design does not overlap with the midpoint of the aisle sideline, an aisle layout problem that considers the left and right mirror images of the facility is proposed. The integer programming model of the problem is established, and an improved discrete butterfly optimization algorithm suitable for MFCAP is proposed. Based on the standard butterfly optimization algorithm, the algorithm discretizes the encoding method and related operations, improves the search speed of the algorithm through adaptive mode switching probability, and uses methods such as elite enhanced evolution and reverse diffusion catastrophe to improve the search accuracy of the algorithm. In order to verify the correctness of the proposed model, branch and bound algorithm and improved discrete butterfly optimization algorithm are used to accurately solve small-scale MFCAP examples. In order to verify the effectiveness of the proposed algorithm, the improved discrete butterfly optimization algorithm is compared with other heuristic algorithms in medium and large-scale calculation examples. The results show that the proposed improved discrete butterfly optimization algorithm has high quality and efficiency when applied to MFCAP, and it is an effective method to solve the MFCAP problem.
关 键 词:过道布置问题(CAP) 蝴蝶优化算法 整数规划模型 可镜像设施(MF)
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.222.218.204