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

A hybrid harmony search algorithm with efficient job sequence scheme and variable neighborhood search for the permutation flow shop scheduling problems

Zhao, Fuqing*; Liu, Yang; Zhang, Yi; Ma, Weimin; Zhang, Chuck同济大学
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE2017-10DOI: 10.1016/j.engappai.2017.07.023
65被引8阅读
引用收藏
分享

摘要

The permutation flow shop scheduling problem (PFSSP), one of the most widely studied production scheduling problems, is a typical NP-hard combinatorial optimization problem. In this paper, a hybrid harmony search algorithm with efficient job sequence mapping scheme and variable neighborhood search (VNS), named HHS, is proposed to solve the PFFSP with the objective to minimize the makespan. First of all, to extend the HHS algorithm to solve the PFSSP effectively, an efficient smallest order value (SOV) rule based on random key is introduced to convert continuous harmony vector into a discrete job permutation after fully investigating the effect of different job sequence mapping schemes. Secondly, an effective initialization scheme, which is based on NEH heuristic mechanism combining with chaotic sequence, is employed with the aim of improving the solution's quality of the initial harmony memory (HM). Thirdly, an opposition-based learning technique in the selection process and the best harmony (best individual) in the pitch adjustment process are made full use of to accelerate convergence performances and improve solution accuracy. Meanwhile, the parameter sensitivity is studied to investigate the properties of HEIS, and the recommended values of parameters adopted in HHS are presented. Finally, by making use of a novel variable neighborhood search, the efficient insert and swap structures are incorporated into the HHS to adequately emphasize local exploitation ability. Experimental simulations and comparisons on both continuous and combinatorial benchmark problems demonstrate that the HE-IS algorithm outperforms the standard HS algorithm and other recently proposed efficient algorithms in terms of solution quality and stability.

学科与关键词

关键词
Permutation flow shop schedulingEvolution computationOptimizationOperation researchHarmony searchParameter sensitivity
相关
加载中…
  • A hybrid harmony search algorithm for the flexible job shop scheduling problem
    Yuan, Yuan; Xu, Hua*; Yang, JiadongAPPLIED SOFT COMPUTING, 2013, 13(7): 3259-3272.被引 133
  • A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers
    Pan, Quan-Ke; Wang, Ling; Gao, Liang*APPLIED SOFT COMPUTING, 2011, 11(8): 5270-5280.被引 61
  • A hybrid discrete biogeography-based optimization for the permutation flowshop scheduling problem
    Lin, Jian*International Journal of Production Research, 2016, 54(16): 4805-4814.被引 22
查看全部 →

发表信息

论文状态
公开发表
期刊
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
发表日期
2017-10
卷期
第 65 卷
页码
178-199
DOI
10.1016/j.engappai.2017.07.023
语言
ENGLISH
期刊等级
Q1
成果收录
SCIE
资助标注
National Natural Science Foundation of China [61663023]; Key Research Programs of Science and Technology Commission Foundation of Gansu Province [2017GS10817]; General and Special Program of the Postdoctoral Science Foundation of China; Science Foundation for Distinguished Youth Scholars of Lanzhou University of Technology; Lanzhou Science Bureau project [2012M521802, 2013T60889, J201405, 2013-4-64]

作者

  • Z

    Zhao, Fuqing (通讯) (第一作者)

    lanzhou univ technol

  • L

    Liu, Yang

    lanzhou univ technol

查看全部 5 位作者收起作者
  • Z

    Zhang, Yi

    xijing univ

  • M

    Ma, Weimin

    tongji univ

  • Z

    Zhang, Chuck

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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