|Table of Contents|

Multi-strategy particle swarm optimization for solvingpermutation flow-shop scheduling problem(PDF)

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
2019年01期
Page:
48-
Research Field:
Publishing date:

Info

Title:
Multi-strategy particle swarm optimization for solvingpermutation flow-shop scheduling problem
Author(s):
Tang Kezong1Zhan Tangsen1Li Zuoyong2Shu Yun1
1.School of Information Engineering,Jingdezhen Ceramic Institute,Jingdezhen 333403,China; 2.Industrial Robot Application of Fujian University Engineering Research Center,Minjiang University,Fuzhou 350121,China
Keywords:
particle swarm optimization permutation flow-shop scheduling problem multi-strategy particle swarm optimization method diversity
PACS:
TP391.41
DOI:
10.14177/j.cnki.32-1397n.2019.43.01.007
Abstract:
In order to improve the search performance of combinatorial optimization problem for particle swarm optimization,a multi-strategy particle swarm optimization method is proposed for solving permutation flow-shop scheduling problems based on various combinatorial optimization strategies. The proposed method uses information entropy to measure the population diversity of particle group through the sub interval of gravitational value partition. At the same time,the global optimal particle selection is selected by ant routing selection strategy and considering the distance between particles and the mass of inertia. In addition,a novel mutation is designed to guide particle swarm to jump out of the local optimal solution area and enhance the global search ability of particle swarm. The simulation results of test problems show that the multi-strategy particle swarm optimization can effectively accelerate the search performance and convergence speed of the optimal solution,and it can be effectively applied to solve the permutation flow-shop scheduling problem.

References:

[1] 王凌,邓瑾,王圣尧. 分布式车间调度优化算法研究综述[J]. 控制与决策,2016,31(1):1-11.
Wang Ling,Deng Jin,Wang Shengyao. Survey on optimization algorithms for distributed shop scheduling[J]. Control and Decision,2016,31(1):1-11.
[2]赵莉. 基于改进量子粒子群算法的云计算资源调度[J]. 南京理工大学学报,2016,40(2):223-228.
Zhao Li. Cloud computing resource scheduling based on improved quantum particle swarm optimization algorithm[J]. Journal of Nanjing University of Science and Technology,2016,40(2):223-228.
[3]Kennedy J,Eberhart R C. Particle swarm optimization[C]//Proceedings of IEEE International Conference on Neural Networks. Perth,Australia:IEEE Press,1995:1942-1948.
[4]张静,王万良,徐新黎,等. 混合粒子群算法求解多目标柔性作业车间调调度问题[J]. 控制理论与应用,2012,29(6):715-722.
Zhang Jing,Wang Wanliang Xu Xinli,et al. Hybrid particle-swarm optimization for multi-objective flexible job-shop scheduling problem[J]. Control Theory & Applications,2012,29(6):715-722.
[5]戴月明,王明慧,王春,等. 骨干双粒子群算法求解柔性作业车间调度问题[J]. 系统仿真学报,2017,29(6):1268-1276.
Dai Yueming,Wang Minghui,Wang Chun,et al. Double bare bones particle swarm algorithm for solving flexible job-shop scheduling problem[J]. Journal of System Simulation,2017,29(6):1268-1276.
[6]Li D,Deng N. Solving permutation flow shop scheduling problem with a cooperative multi-swarm PSO algorithm[J]. Journal of Information & Computational Science,2012,9(4):977-987.
[7]Le Z,Wang Jinnan. A PSO-based hybrid metaheuristic for permutation flowshop scheduling problems[J]. The Scientific World Journal,2014,36(6):1-8.
[8]Bewoor L,Prakash V C,Sapkal S. Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard No-wait flow shop scheduling problems[J]. Algorithms,2017,10(4):121-137.
[9]张其亮,陈永生,韩斌. 改进的粒子群算法求解置换流水车间调度问题[J]. 计算机应用,2012,32(4):1022-1024.
Zhang Qiliang,Cheng Yongsheng,Han Bing. Improved particle swarm optimization for permutation flowshop scheduling problem[J]. Journal of Computation Applications,2012,32(4):1022-1024.

[10]刘勇,马良. 置换流水车间调度问题的中心引力优化算法求解[J]. 运筹与管理,2017,26(9):46-51.
Liu Yong,Ma Liang. Solving permutation flow-shop scheduling problem by central force optimization algorithm[J]. Operations Research and Management Science,2017,26(9):46-51.
[11]顾文斌,唐敦兵,郑堃,等. 基于激素调节机制改进型自适应粒子群算法在置换流水车间调度中的应用研究[J]. 机械工程学报,2012,48(14):177-182.
Gu Wenbin,Tang Dunbing,Zheng Kun,et al. Research on permutation flow-shop scheduling problem based on improved adaptive particle swarm optimization algorithm with hormone modulation mechanism[J]. Journal of Mechanical Engineering,2012,48(14):177-182.
[12]Liu Bo,Wang Ling,Jin Yihui. An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers[J]. Computers & Operations Research,2008,35(9):2791-2806.

Memo

Memo:
-
Last Update: 2019-02-28