摘要
基于柔性制造系统的Petri网模型,以制造期最小为优化目标,将死锁避免策略嵌入粒子群算法中,提出一种无死锁改进粒子群调度算法.该算法将粒子与工件的工序序列相对应,以位置数值的大小表示对应工件工序在执行顺序中的优先级.采用一步向前看的死锁避免策略方法对序列的可行性进行验证,提出一种跳出局部极值的策略.实例仿真结果表明了粒子群调度算法的可行性和有效性,以及改进粒子群调度算法的优越性.
Based on Petri net models of flexible manufacturing systems and embedding the optimal deadlock avoidance policy into the particle swarm optimization（PSO） algorithm, a deadlock-free modified PSO scheduling algorithm is proposed to minimize the makespan. A particle is corresponded to a part sequence which is a permutation with repetition of parts. Real numbers in components of a position vector indicate priorities of the corresponding part operations. The feasibility of sequences is checked with the one-step look-ahead method in the optimal deadlock control policy, and a strategy for jumping out local optima is proposed. Experimental results show the effectiveness and feasibility of the particle swarm optimization for solving deadlock-free scheduling of flexible manufacturing systems and the modified particle swarm scheduling algorithm can perform much better.
出处
《控制与决策》
EI
CSCD
北大核心
2014年第8期1345-1353,共9页
Control and Decision
基金
国家自然科学基金项目(50975224)
关键词
制造系统
PETRI网
死锁避免策略
调度
粒子群算法
manufacturing system
Petri nets
deadlock avoidance policy
scheduling
particle swarm optimization
