Journal of System Simulation
Abstract
Abstract: To solve the flexible job-shop scheduling problem (FJSP) more effectively, an improved chicken swarm optimization (ICSO) algorithm was proposed. A flexible job-shop scheduling model was established for the purpose of minimizing the machine makespan. The improved chicken swarm optimization algorithm was presented. Algorithm improved the update formula of chicks and combined the advantages of simulated annealing algorithm and dynamic inertia cosine weight strategy, which achieved an effective balance of global search and local exploration. According to simulating and testing four standard functions and a flexible job shop scheduling model and compared with particle swarm optimization (PSO) and chicken swarm optimization (CSO), makespan of the optimal value of ICSO is reduced by 12 and 7 respectively, and the mean value is reduced by 16.3 and 5.7, validating the effectiveness and the superiority of ICSO.
Recommended Citation
Xu, Shipeng; Wu, Dinghui; Fei, Kong; and Ji, Zhicheng
(2020)
"Solving Flexible Job-Shop Scheduling Problem by Improved Chicken Swarm Optimization Algorithm,"
Journal of System Simulation: Vol. 29:
Iss.
7, Article 14.
DOI: 10.16182/j.issn1004731x.joss.201707014
Available at:
https://dc-china-simulation.researchcommons.org/journal/vol29/iss7/14
First Page
1497
DOI Link
https://doi.org/10.16182/j.issn1004731x.joss.201707014
Last Page
1505
CLC
TP391.9
Recommended Citation
Xu Shipeng, Wu Dinghui, Kong Fei, Ji Zhicheng. Solving Flexible Job-Shop Scheduling Problem by Improved Chicken Swarm Optimization Algorithm[J]. Journal of System Simulation, 2017, 29(7): 1497-1505.
DOI
10.16182/j.issn1004731x.joss.201707014
Included in
Artificial Intelligence and Robotics Commons, Computer Engineering Commons, Numerical Analysis and Scientific Computing Commons, Operations Research, Systems Engineering and Industrial Engineering Commons, Systems Science Commons