拖延
粒子群优化
数学优化
调度(生产过程)
分类
遗传算法
帕累托原理
计算机科学
计算
作业车间调度
算法
数学
地铁列车时刻表
操作系统
作者
Jianping Dou,Jun Li,Dan Xia,Xia Zhao
标识
DOI:10.1080/00207543.2020.1756507
摘要
To provide accurate capacity and functionality needed for each demand period (DP), a reconfigurable manufacturing system (RMS) is able to change its configuration with time. For the RMS with multi-part flow line configuration that concurrently produces multiple parts within the same family, the cost and delivery time are dependent on its configuration and relating scheduling for any DP. So far, the study on solution method for the integrated optimisation problem of configuration design and scheduling for RMS is scarce. To efficiently find solutions with tradeoffs between total cost and tardiness, a multi-objective particle swarm optimisation (MoPSO) based on crowding distance and external Pareto solution archive is presented to solve practical-sized problems. The devised encoding and decoding methods along with the particle updating mechanism of MoPSO ensure any particle a feasible solution. The comparison between MoPSO and ε-constraint method versus small-sized cases illustrates the effectiveness of MoPSO. The comparative results between MoPSO and nondominated sorting genetic algorithm II (NSGA-II) against eight problems show that the MoPSO outperforms the NSGA-II in both solution quality and computation efficiency for the integrated optimisation problem.
科研通智能强力驱动
Strongly Powered by AbleSci AI