A Quantum-PSO Algorithm for No-Wait Flow shop Scheduling Problem

被引:5
作者
Chang, Junlin [1 ]
An, Fengshuan [1 ]
Su, Pizhao [1 ]
机构
[1] China Univ Min & Technol, Sch Informat & Elect Engn, Xuzhou 221008, Jiangsu, Peoples R China
来源
2010 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-5 | 2010年
关键词
no-wait; quantum evolutionary; Quantum angle; PARTICLE SWARM OPTIMIZATION;
D O I
10.1109/CCDC.2010.5499096
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a quantum-PSO algorithm (QPSO) based on quantum-inspired evolutionary algorithm (QEA) was proposed for the no-wait flow shop scheduling problem with makespan criterion. Based on adopting quantum angle to encode the quantum chromosome;, the individuals and group's optimal information carried by particles were used to guide the update of quantum rotation gate to simplify operation and accelerate algorithm convergence speed. Meanwhile, a kind of conversion mechanism was proposed to solve the mapping problem from binary coding with quantum collapse to job sorting. In addition, quantum chromosomal catastrophe, crossover and mutation operation were adopted to avoid being trapped at local optimum. Simulation results demonstrate that the new method outperforms to other intelligent algorithms in terms of solution quality and convergence rate.
引用
收藏
页码:179 / +
页数:2
相关论文
共 11 条
[1]   New heuristics for no-wait flowshops to minimize makespan [J].
Aldowaisan, T ;
Allahverdi, A .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (08) :1219-1231
[2]  
[Anonymous], PARTICLE SWARM OPTIM
[3]   Genetic algorithms applied to the continuous flow shop problem [J].
Chen, CL ;
Neppalli, RV ;
Aljaber, N .
COMPUTERS & INDUSTRIAL ENGINEERING, 1996, 30 (04) :919-929
[4]   Quantum-inspired evolutionary algorithm for a class of combinatorial optimization [J].
Han, KH ;
Kim, JH .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (06) :580-593
[5]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[6]   An effective hybrid particle swarm optimization for no-wait flow shop scheduling [J].
Liu, Bo ;
Wang, Ling ;
Jin, Yi-Hui .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 31 (9-10) :1001-1011
[7]   A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem [J].
Pan, Quan-Ke ;
Tasgetiren, M. Fatih ;
Liang, Yun-Chia .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (09) :2807-2839
[8]   Approximative procedures for no-wait job shop scheduling [J].
Schuster, CJ ;
Framinan, JM .
OPERATIONS RESEARCH LETTERS, 2003, 31 (04) :308-318
[9]  
Wang L, 2008, CONTROL DECISION, V12, P1321
[10]  
Wang Ling, 2005, Control and Decision, V20, P156