Quantum particle swarm optimization with chaotic encoding schemes for flexible job-shop scheduling problem

被引:0
|
作者
Xu, Yuanxing [1 ]
Wang, Deguang [1 ]
Zhang, Mengjian [2 ]
Yang, Ming [1 ]
Liang, Chengbin [1 ]
机构
[1] Guizhou Univ, Sch Elect Engn, Guiyang 550025, Peoples R China
[2] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510006, Peoples R China
基金
中国国家自然科学基金;
关键词
Flexible job-shop scheduling problem; Quantum particle swarm optimization; Quantum theory; Chaos theory; Encoding and decoding; META-HEURISTIC ALGORITHM; HYBRID GENETIC ALGORITHM; LOCAL SEARCH; MACHINE;
D O I
10.1016/j.swevo.2024.101836
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Effective scheduling inflexible job-shop environments is crucial for improving production efficiency, reducing costs, and minimizing energy consumption. Quantum particle swarm optimization (QPSO) is an advanced optimization technique inspired by quantum mechanics and particle swarm optimization (PSO). It enhances the exploration and exploitation capabilities of PSO by incorporating quantum principles. The encoding schemes inflexible job-shop scheduling problem (FJSP) significantly influence the quality of scheduling solutions. This study presents a comprehensive investigation on the application of QPSO enhanced with chaotic encoding schemes to solve FJSP. Although recent research has demonstrated the potential of QPSO in the context of FJSP, there remains a gap in understanding the effectiveness of various chaotic encoding schemes. This study addresses this gap by systematically evaluating fourteen chaotic maps and incorporating them as encoding schemes within the QPSO framework for FJSP. Through comprehensive experiments on benchmark datasets and industrial case studies, we demonstrate that QPSO with chaotic encoding schemes not only significantly improves solution quality but also accelerates convergence compared to traditional two-layer encoding scheme. The findings indicate that the integration of chaotic encoding schemes into QPSO represents a promising approach for effectively solving complex FJSP. These results provide valuable insights for both researchers and practitioners in the field of scheduling optimization, highlighting the potential of combining quantum theory and chaos theory to advance the state-of-the-art in scheduling algorithms.
引用
收藏
页数:22
相关论文
共 50 条
  • [41] Investigation of particle swarm optimization for job shop scheduling problem
    Liu, Zhixiong
    ICNC 2007: THIRD INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 3, PROCEEDINGS, 2007, : 799 - 803
  • [42] Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems
    Liu, Hongbo
    Abraham, Ajith
    Choi, Okkyung
    Moon, Seong Hwan
    SIMULATED EVOLUTION AND LEARNING, PROCEEDINGS, 2006, 4247 : 197 - 204
  • [43] Job-Shop Scheduling Based on Improved Particle Swarm
    Chen, Qun-xian
    FUZZY INFORMATION AND ENGINEERING, VOLUME 2, 2009, 62 : 97 - 105
  • [44] Particle swarm optimization with controllable diversity of flexible job-shop scheduling with lot-splitting production
    Qu, Xinhuai
    Liu, Dong
    Ding, Birong
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2014, 26 (01): : 121 - 130
  • [46] A novel particle swarm optimization-based approach for job-shop scheduling
    Ge, H. W.
    Lu, Y. H.
    Zhou, Y.
    Guo, X. C.
    Liang, Y. C.
    COMPUTATIONAL METHODS, PTS 1 AND 2, 2006, : 1093 - +
  • [47] A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS
    Ge, H. W.
    Liang, Y. C.
    Zhou, Y.
    Guo, X. C.
    INTERNATIONAL JOURNAL OF COMPUTATIONAL METHODS, 2005, 2 (03) : 419 - 430
  • [48] A dual similar particle swarm optimization algorithm for job-shop scheduling with penalty
    Lian, Zhigang
    Gu, Xingsheng
    Jiao, Bin
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 7312 - 7316
  • [49] A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
    Lian, Zhigang
    Jiao, Bin
    Gu, Xingsheng
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 183 (02) : 1008 - 1017
  • [50] Minimizing makespan in Job-shop Scheduling Problem Using an Improved Adaptive Particle Swarm Optimization Algorithm
    Gu, Wenbin
    Tang, Dunbing
    Zheng, Kun
    PROCEEDINGS OF THE 2012 24TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2012, : 3189 - 3193