ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Hybrid quantum particle swarm optimization and variable neighborhood search for flexible job-shop scheduling problem

Xu, Yuanxing; Zhang, Mengjian; Yang, Ming; Wang, Deguang*贵州大学; 哈尔滨工程大学
JOURNAL OF MANUFACTURING SYSTEMS2024-4DOI: 10.1016/j.jmsy.2024.02.007
9被引16阅读
引用收藏
分享

摘要

The rise and integration of Industry 4.0 has led to a growing focus on the flexible job -shop scheduling problem (FJSP). As an extension of the classic job -shop scheduling problem, FJSP is recognized as an NPhard problem. Swarm intelligence algorithms provide a robust and adaptable approach for addressing the FJSP, generating approximate solutions near the optima within significantly less computing time. This study proposes a hybrid algorithm HQPSO-VNS that integrates quantum particle swarm optimization (QPSO) and variable neighborhood search (VNS) for efficiently addressing the FJSP. A chaotic encoding scheme suitable for QPSO is used to represent a scheduling solution. Nine new neighborhood structures are designed to increase the population diversity and local search capability of the algorithm. Additionally, to overcome the shortcoming in neighborhood disturbance, a new neighborhood transformation rule based on the length of the encoding sequence is developed. Finally, HQPSO-VNS and five state-of-the-art algorithms are tested on problem instances from Kacem, Brandimarte, and Dauzere-peres datasets, and an industrial case study. The experimental results indicate that HQPSO-VNS has faster convergence, better stability, and broader applicability.

学科与关键词

关键词
Flexible job-shop scheduling problemChaotic encodingQuantum particle swarm optimizationVariable neighborhood searchHybrid algorithm
相关
加载中…
  • A Review on Swarm Intelligence and Evolutionary Algorithms for Solving Flexible Job Shop Scheduling Problems
    Gao, Kaizhou; Cao, Zhiguang; Zhang, Le; Chen, Zhenghua; Han, Yuyan; Pan, Quanke*IEEE/CAA Journal of Automatica Sinica, 2019, 6(4): 904-916.被引 357
  • A new hybrid particle swarm optimization and parallel variable neighborhood search algorithm for flexible job shop scheduling with assembly process
    Fattahi, Parviz; Rad, Naeeme Bagheri; Daneshamooz, Fatemeh; Ahmadi, Samad*ASSEMBLY AUTOMATION, 2020.被引 37
  • Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem
    Ding, Haojie; Gu, Xingsheng*COMPUTERS & OPERATIONS RESEARCH, 2020, 121: 104951.被引 73
查看全部 →

发表信息

论文状态
公开发表
期刊
JOURNAL OF MANUFACTURING SYSTEMS
发表日期
2024-04
卷期
第 73 卷
页码
334-348
DOI
10.1016/j.jmsy.2024.02.007
语言
ENGLISH
成果收录
SCIE
资助标注
National Natural Science Foundation of China [62203132, 52265066, 62341303]; Guizhou Provincial Science and Technology Projects [ZK [2022] Yiban103]

作者

  • X

    Xu, Yuanxing (第一作者)

    guizhou univ

  • Z

    Zhang, Mengjian

    south china univ technol

查看全部 4 位作者收起作者
  • Y

    Yang, Ming

    guizhou univ

  • W

    Wang, Deguang (通讯)

    guizhou univ

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417