DocumentCode :
694345
Title :
Improved new particle swarm algorithm solving job shop scheduling optimization problem
Author :
Xiaobing Liu ; Xuan Jiao ; Yanpeng Li ; Xu Liang
Author_Institution :
Sch. of Manage., Dalian Univ. of Technol., Dalian, China
fYear :
2013
fDate :
12-13 Oct. 2013
Firstpage :
148
Lastpage :
150
Abstract :
Particle swarm algorithm has a large number of applications, using particle swarm algorithm efficiency is much higher than other algorithm on the shop scheduling, compared with other algorithms, particle swarm algorithm is simple, and easy to implement, without gradient information, the global search ability is strong, less parameters etc in the continuous optimization and discrete optimization problems are showed good effect, because it is real number encoding rules applies to the solution of the optimization problem. But in the later stages of the algorithm, its speed is slow, aiming at this shortcoming, this paper has carried on the improvement to the algorithm, the improved algorithm in convergence and speed have been greatly improved.
Keywords :
job shop scheduling; particle swarm optimisation; continuous optimization; discrete optimization; job shop scheduling optimization problem; particle swarm algorithm; Algorithm design and analysis; Genetic algorithms; Job shop scheduling; Mobile communication; Particle swarm optimization; Search problems; Job shop Scheduling; Particle Swarm Optimization; Tabu search strategy;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Network Technology (ICCSNT), 2013 3rd International Conference on
Conference_Location :
Dalian
Type :
conf
DOI :
10.1109/ICCSNT.2013.6967083
Filename :
6967083
Link To Document :
بازگشت