检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:轩华 耿祝新 李冰 XUAN Hua;GENG Zhuxin;LI Bing(School of Management,Zhengzhou University,Zhengzhou 450001,China)
出 处:《郑州大学学报(工学版)》2025年第1期17-25,共9页Journal of Zhengzhou University(Engineering Science)
基 金:河南省科技研发计划联合基金资助项目(242103810046);河南省科技攻关计划项目(232102321093,232102321026);河南省哲学社会科学规划项目(2023BJJ085)。
摘 要:为解决生产阶段间带有无限缓冲和阻塞两种中间缓冲约束的混合流水线节能调度问题,考虑不相关并行机和多时间约束建立数学模型,结合问题特征提出一种改进多目标模因算法以同时最小化最大完工时间和机器总能耗。采用基于不相关机器分配的矩阵编码方案,利用基于Tent混沌映射的混合初始化策略生成初始元胞数组,全局优化算子应用基于参数的自适应遗传策略改进的非支配排序遗传算法,局部增强搜索算子应用一种融合自适应选择邻域搜索和多目标模拟退火的搜索策略以提高算法搜索能力。通过24种不同规模问题的算例实验,验证了所提算法求解该问题的有效性和优越性。实验结果表明:改进多目标模因算法在平均运行时间241.26 s内得到的平均IGD值为47.89,平均SP值为857.25,均低于其他3种对比算法。改进多目标模因算法所求解集具有较好的收敛性、多样性和分布性。To solve the hybrid flowline energy-saving scheduling problem with two intermediate buffer constraints,infinite buffer and blocking,between production stages,a mathematical model was formulated by considering the uncorrelated parallel machines and multiple time constraints.Taking into account the characteristics of the problem,an improved multi-objective memetic algorithm(IMOMA)was proposed to minimize simultaneously makespan and total energy consumption of the machines.The algorithm adopted a matrix encoding method based on uncorrelated machine assignment.Using a hybrid initialization strategy based on Tent chaotic map to generate the initial cell array,an non-dominated sorting genetic algorithm improved by parameter-based adaptive genetic strategy was applied for the global optimization operator,and a search strategy integrating adaptive selection neighborhood search and multi-objective simulated annealing was designed for the locally enhanced search operator to improve the algorithm′s search capability.The effectiveness and superiority of the proposed algorithm were verified through case experiments with 24 problem scales.The experimental results showed that the average IGD value of 47.89 and the average SP value of 857.25 obtained by IMOMA within the average running time of 241.26 s were lower than the other three comparison algorithms.So the solution set obtained by IMOMA had better convergence,diversity and distributivity.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.135.209.180