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

Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem

Ding, Haojie; Gu, Xingsheng*华东理工大学
COMPUTERS & OPERATIONS RESEARCH2020-9DOI: 10.1016/j.cor.2020.104951
73被引12阅读
引用收藏
分享

摘要

The flexible job shop scheduling problem (FJSP) is a typical scheduling problem in practical production and has been proven to be a NP-hard problem. The study of FJSP is important to remarkably direct actual manufacturing processes. The paper proposes an improved particle swarm optimization (PSO) algorithm for solving FJSP and obtains beneficial solutions by improvement on encoding/decoding scheme, communication mechanism between particles, and alternate rules of candidate machines of operations. The innovation of encoding/decoding scheme proposes a novel designed chain encoding scheme and a corresponding effective decoding scheme. The chain-based encoding scheme can reasonably convert FJSP to an appropriate operation linked list and the novel designed decoding scheme owns the capacity of further explorering the solution space. The improvement of traditional PSO focuses on the innovation of information communication between particles, besides the modification of algorithm architecture. The amelioration of rules on operated machine selection is carried out based on the critical path of operations research (OR). It promotes algorithm efficiency by only alternating the candidate machines of operations on the critical path. In addition, much parameters tuning work is involved in a series of experiments. The study proposes some tuning schemes of parameters with exact mathematical methods, and these schemes can effectively help find more appropriate parameters. The final experiment results prove that the improved PSO exhibits remarkable ability to solve FJSP.

学科与关键词

关键词
Flexible job shop scheduling problemParticle swarm optimization algorithmEncoding and decoding schemesLocal searchOperations research
相关
加载中…
  • 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 SYSTEMS, 2024, 73: 334-348.被引 9
  • 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(3): 419-430.被引 20
  • 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
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPUTERS & OPERATIONS RESEARCH
发表日期
2020-09
卷期
第 121 卷
页码
104951
DOI
10.1016/j.cor.2020.104951
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
2区
成果收录
SCIE
资助标注
National Natural Science Foundation of China [61973120, 61573144, 61773165, 61673175]

作者

  • D

    Ding, Haojie (第一作者)

    east china univ sci & technol

  • G

    Gu, Xingsheng (通讯)

    east china univ sci & technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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