文献类型：期刊文献

中文题名：解决零等待多产品厂调度问题的改进粒子群算法

英文题名：Improved particle swarm optimization algorithm for multiproduct batch plant scheduling problem with zero wait policy

作者：李振[1];徐震浩[1];顾幸生[1]

机构：[1]华东理工大学化工过程先进控制和优化技术教育部重点实验室,上海200237

年份：2014

卷号：20

期号：7

起止页码：1654

中文期刊名：计算机集成制造系统

外文期刊名：Computer Integrated Manufacturing Systems

收录：CSTPCD;;EI(收录号：20144000082018);Scopus;北大核心:【北大核心2011】；CSCD:【CSCD2013_2014】；

基金：国家自然科学基金资助项目(61104178;61174040)~~

语种：中文

中文关键词：零等待;调度;多产品厂;创新因子;粒子群优化算法

外文关键词：zero wait; scheduling; multi-product ; innovation factors; particle swarm optimization

摘要：针对零等待多产品厂调度问题的总流程时间最小化问题,提出一种改进粒子群算法。在该类问题中,产品在每台设备上的操作包括调整、加工和移除三部分,并以零等待方式进行生产。对生产过程的特殊性建立了调度问题的数学模型,在分析了标准粒子群算法所固有的缺陷的基础上提出一种带有创新因子的改进粒子群算法。通过在粒子的位置更新公式中加入创新因子,提高了粒子的随机性,使粒子不再单纯跟踪个体极值和群体极值,避免了粒子快速聚集到群体极值周围,同时扩大了搜索范围,使粒子获得了更好的"探索"能力,增强了种群在进化过程中的多样性,防止算法陷入局部最优,提高了算法的全局搜索能力。通过对不同规模问题的仿真求解,改进算法的优化结果明显优于标准粒子群算法和遗传算法,表明了改进算法的有效性和优越性。最后,仿真讨论了非零调整时间和非零移除时间对调度结果的影响。
Aiming at the minimum total flow time of muhiproduct batch plant schedule problem with Zero Wait （ZW） policy, an improved particle swarm optimization was proposed. In these scheduling problems, the operation of products on any machine consisted of setup, processing and removal. For the specificity of production process, the math ematieal model of scheduling problem was built. Based on analyzing the inherent drawback of Standard Particle Swarm Optimization （SPSO）, a new improved particle swarm optimization with innovation factors was declared. By adding innovation factor in the position update formula, the randomness of the particles were increased, which made particles no longer track individual extreme and global extreme solely, keep the particles away from the densely area to extend the search space and improve the population diversity in the process of evolution. It could prevent the par- ticles fall into local best and enhance the global research ability. Through the simulated solution, the improved algo- rithm was proved to have more remarkable performance than SPSO and GA, and the influence of non-zero transfer time and setup time on scheduling problem was analyzed.