Journal of System Simulation
Abstract
Abstract: To solve the flexible job-shop scheduling problem (FJSP), a chaotic-encode quantum PSO (CQPSO) algorithm is proposed. Aiming at the premature convergence of particles to local optimum in standard QPSO, the methods for computing the adaptive contraction-expansion coefficient and mean best position using fitness values of associated particles are proposed to improve the global search ability of QPSO. Through chaotic boundary variation strategy, the probability of a large number of particles gathering at the boundary is reduced and the population diversity is increased to enhance the ability of searching the optimal solution. According to the iterative property of QPSO, a chaotic-encode strategy is designed. The proposed CQPSO is applied to solve FJSP and the result is compared with QPSO, PSO, and hybrid genetic algorithm result on several benchmarks to confirm the performance. The experimental results show that CQPSO has the better stability and the stronger optimization ability.
Recommended Citation
Xu, Yuanxing; Zhang, Mengjian; and Wang, Deguang
(2024)
"Chaotic-encode Quantum PSO Algorithm for Flexible Job-shop Scheduling Problem,"
Journal of System Simulation: Vol. 36:
Iss.
10, Article 13.
DOI: 10.16182/j.issn1004731x.joss.23-0740
Available at:
https://dc-china-simulation.researchcommons.org/journal/vol36/iss10/13
First Page
2371
Last Page
2382
CLC
TP278; TP391.9
Recommended Citation
Xu Yuanxing, Zhang Mengjian, Wang Deguang. Chaotic-encode Quantum PSO Algorithm for Flexible Job-shop Scheduling Problem[J]. Journal of System Simulation, 2024, 36(10): 2371-2382.
DOI
10.16182/j.issn1004731x.joss.23-0740
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