检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘璐[1,2] 宋海草[3] 姜天华 邓冠龙[4] 巩庆涛 LIU Lu;SONG Haicao;JIANG Tianhua;DENG Guanlong;GONG Qingtao(School of Transportation,Ludong University,Yantai 264025,China;Shandong Provincial Marine Aerospace Equipment Technological Innovation Center,Ludong University,Yantai 264025,China;School of Management Science and Engineering,Shandong Technology and Business University,Yantai 264005,China;School of Information and Electrical Engineering,Ludong University,Yantai 264025,China;ULASAN and Ocean College,Ludong University,Yantai 264025,China)
机构地区:[1]鲁东大学交通学院,山东烟台264025 [2]鲁东大学山东省海上航天装备技术创新中心,山东烟台264025 [3]山东工商学院管理科学与工程学院,山东烟台264005 [4]鲁东大学信息与电气工程学院,山东烟台264025 [5]鲁东大学蔚山船舶与海洋学院,山东烟台264025
出 处:《计算机集成制造系统》2024年第9期3125-3141,共17页Computer Integrated Manufacturing Systems
基 金:山东省重大创新工程资助项目(2020CXGC010702,2021CXGC010702);山东省自然科学基金面上资助项目(ZR2021MG008);山东省高等学校青创科技支持计划资助项目(2019KJN002);烟台市科技计划资助项目(2021XDHZ072);山东工商学院引进博士基金资助项目(BS201938)。
摘 要:节能调度是面向绿色制造的车间调度问题,已成为制造领域的研究热点。针对具有机器和工人双资源约束的柔性作业车间,综合考虑工人学习效应和工件运输时间的影响,以最小化车间能耗为目标,提出一种改进的生物迁徙算法(MBMA)。该算法采用基于工件-机器-工人的三段式编码方法表示调度解,并设计了一种种群初始化方法,以改善初始调度解的质量。考虑到基本生物迁徙算法无法直接应用于离散车间调度问题,提出一种基于交叉操作的离散迁徙算子,使算法能够直接在离散调度空间内进行搜索。此外,在迁徙算子中引入转换概率动态调整策略,以平衡算法探索与开发能力,另外增加了一种记忆池机制,避免算法过早收敛。对于个体更新算子,设计了一种局部搜索算法嵌入其中,以增强算法局部搜索能力。大量实验结果表明,MBMA算法的计算结果优于其他算法。Energy-saving scheduling is a workshop scheduling problem oriented to green manufacturing,which has become a research hot spot in the manufacturing field.Aiming at the flexible job shop with dual resource constraints of machine and worker,the effects of worker learning and job transportation time were considered simultaneously to minimize the energy consumption of the workshop,and a Modified Biology Migration Algorithm(MBMA)was proposed.In the algorithm,a job-machine-worker based three-segment encoding method was adopted to represent the scheduling solution,and a population initialization approach was design to improve the quality of initial scheduling solutions.Considering that the basic biology migration algorithm cannot be directly applied to the discrete workshop scheduling problem,a discrete biological migration operator based on crossover operations was proposed,by which the algorithm could search directly in the discrete scheduling domain.Furthermore,a dynamic adjustment strategy of the conversion probability was introduced into the migration operator to balance exploration and exploitation of the algorithm,and a memory pool mechanism was added to avoid the premature convergence.For the individual updating operator,a local search algorithm was designed and embedded to enhance the local search ability of the algorithm.Finally,a large number of experimental results showed that the computational results of MBMA were superior to other algorithms.
关 键 词:双资源约束 工人学习效应 工件运输时间 柔性作业车间 节能调度 生物迁徙算法 绿色制造
分 类 号:TH165[机械工程—机械制造及自动化] TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49