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 条
  • [21] Study and Application of an Improved Particle Swarm Optimization in Job-Shop Scheduling Problem
    Ying Mingfeng
    PROCEEDINGS OF THE FIRST INTERNATIONAL WORKSHOP ON EDUCATION TECHNOLOGY AND COMPUTER SCIENCE, VOL I, 2009, : 971 - 974
  • [22] Hybrid discrete particle swarm optimization for multi-objective flexible job-shop scheduling problem
    Xinyu Shao
    Weiqi Liu
    Qiong Liu
    Chaoyong Zhang
    The International Journal of Advanced Manufacturing Technology, 2013, 67 : 2885 - 2901
  • [23] Hybrid discrete particle swarm optimization for multi-objective flexible job-shop scheduling problem
    Shao, Xinyu
    Liu, Weiqi
    Liu, Qiong
    Zhang, Chaoyong
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 67 (9-12): : 2885 - 2901
  • [24] An Improved Multi-Population Hybrid Particle Swarm Optimization for Flexible Job-Shop Scheduling Problem
    Chen, Wen-xian
    Luo, De-lin
    Guo, Jian-min
    Chen, Jin
    PROCEEDING OF THE 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT TECHNOLOGIES, 2009, : 620 - 624
  • [25] Discrete quantum-behaved particle swarm optimization for job-shop scheduling
    Xie, L. (leix@iipc.zju.edu.cn), 1600, Zhejiang University (46):
  • [26] Hybrid of human learning optimization algorithm and particle swarm optimization algorithm with scheduling strategies for the flexible job-shop scheduling problem
    Ding, Haojie
    Gu, Xingsheng
    NEUROCOMPUTING, 2020, 414 (414) : 313 - 332
  • [27] Flexible Job-shop Scheduling Problems Resolution Inspired from Particle Swarm Optimization
    Boukef, Hela
    Benrejeb, Mohamed
    Borne, Pierre
    STUDIES IN INFORMATICS AND CONTROL, 2008, 17 (03): : 241 - 252
  • [28] An Improved Gaming Particle Swarm Optimization Algorithm for Flexible Job-shop Scheduling Problems
    Gu X.
    Ding H.
    Ding, Haojie (hero_ding1978@163.com), 1782, Science Press (48): : 1782 - 1789
  • [29] Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization
    Huang, Song
    Tian, Na
    Wang, Yan
    Ji, Zhicheng
    SPRINGERPLUS, 2016, 5
  • [30] A DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM TO MAXIMIZING PRODUCTION
    Lian, Zhigang
    Lin, Weitian
    Gao, Yejun
    Jiao, Bin
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2014, 10 (02): : 729 - 740