首页|改进的多目标樽海鞘算法求解车间调度问题

改进的多目标樽海鞘算法求解车间调度问题

扫码查看
原文链接
  • 万方数据
  • 维普
针对柔性作业车间调度问题,文中提出一种结合衰减因子和交叉变异算子的改进型多目标樽海鞘优化算法.为便于算法求解,使用等长的双层编码方式,并引入基于升序排列规则的转换机制,实现个体位置向量与调度解之间的转换.采用混沌映射和基于规则的混合方法生成较优的初始种群.在个体位置更新中引入衰减因子和交叉变异算子增强算法的全局搜索能力.使用调度问题标准算例和实际算例测试算法求解性能,并与其他算法进行对比.结果表明,改进型多目标樽海鞘算法求解能力较原算法具有明显提升,验证了改进算法求解柔性作业车间调度问题的有效性.
Improved Multi-Objective Salp Swarm Algorithm for Solving Flexible Job Shop Scheduling Problem
In view of the flexible job shop scheduling problem,an improved multi-objective salp swarm algo-rithm combining decay factor and cross-variance operator is proposed.To facilitate the solution of the algorithm,a two-layer coding method of equal length is used and a conversion mechanism based on ascending order rules is intro-duced to achieve the conversion between individual position vectors and scheduling solutions.Chaotic mapping and a hybrid rule-based approach are used to generate a better initial population.A decay factor and a cross-variance operator are introduced in the position update of individuals to enhance the global search capability of the algorithm.The algorithm's solution performance is tested using standard and real-life examples of the scheduling problem and compared with other algorithms.The results show that the solution capability of the proposed improved multi-objec-tive salp swarm algorithm is significantly improved over the original algorithm,verifying the effectiveness of the im-proved algorithm in solving the flexible job shop scheduling problem.

multi-objective salp swarm algorithmbi-objective flexible job shop schedulingtwo-layer cod-ingascending order rulesdiscretized schedulingchaotic mappingdecay factorcrossover operatorvariational op-erator

魏郁、万卫兵

展开 >

上海工程技术大学 电子电气工程学院,上海 201620

多目标樽海鞘算法 双目标柔性作业车间调度 双层编码 升序排列规则 离散化调度 混沌映射 衰减因子 交叉算子 变异算子

2025

10.16180/j.cnki.issn1007-7820.2025.01.002

电子科技
西安电子科技大学

电子科技

影响因子：0.367
ISSN：1007-7820
年,卷(期)：2025.38(1)