粒子群优化
计算机科学
数学优化
流水车间调度
调度(生产过程)
增强学习
多群优化
多目标优化
作业车间调度
分布式计算
人工智能
数学
算法
机器学习
计算机网络
强化学习
布线(电子设计自动化)
作者
Chen Li,Wenqiang Zhang,Lin Lin
标识
DOI:10.1109/icsmd60522.2023.10490584
摘要
This study addresses the distributed flow-shop scheduling problem (DFSP) and aims to minimize the makespan and the total processing time. Although many intelligent algorithms have been proposed to solve DFSP, the efficiency and quality of these solutions still need further improvement to meet higher production requirements. Therefore, a hybrid particle swarm optimization with enhanced directional search and Q-learning-based variable neighborhood search is proposed. The directional search quickly explores the particle swarm in multiple directions, which enhances the convergence ability in different areas of Pareto front. The Q-learning-based variable neighborhood local search prevents the proposed algorithm from falling into a local optimum. The comparative results and statistical analysis of the experiments demonstrate the superior convergence and distribution performance of the proposed algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI