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

A discrete artificial bee colony algorithm with composite mutation strategies for permutation flow shop scheduling problem

Li, X.; Yin, M.*ne normal univ
Scientia Iranica2012-12DOI: 10.1016/j.scient.2012.10.034
35被引2阅读
引用收藏
分享

摘要

The Permutation Flow Shop Scheduling Problem (PFSSP) is an NP-hard problem of wide engineering and theoretical background. In this paper, a kind of discrete artificial bee colony with composite mutation strategies is presented to compensate the defects of the single mutation scheme that is easy to get into the local best for PFSSP, named CDABC. Firstly, to make ABC suitable for PFSSP, we regard each discrete job permutation as a food source and apply discrete operations to generate a new neighbourhood food source for different bees. Secondly, the Nawaz-Enscore-Ham (NEH) heuristic is combined with the random initialization to initialize the population with a certain quality and diversity. Thirdly, the composite mutation strategies are proposed to enable the DABC to solve the permutation flow shop scheduling. Finally, the fast local search is used for enhancing the best individual. Within our knowledge, there are few papers to discuss artificial bee colony algorithm about PFSSP with the objective of minimizing total flow time and maximum lateness of jobs. In this sense, our work can be viewed as a start point for researchers to develop ABC-based algorithms to solve PFSSP. Additionally, simulations and comparisons based on PFSSP benchmarks are carried out, which shows that our algorithm is very competitive. We have also evaluated our algorithm with the well known DMU problems. For the problems with the objective of minimizing makespan, the algorithm CDABC obtains 26 new upper bounds of the 40 instances, and for the problems with the objective of maximum lateness, CDABC obtains 137 new upper bounds of the 160 instances. These new upper bounds can be used for future algorithms to compare their results with ours.

学科与关键词

关键词
Artificial bee colonyMutation strategyPermutation flow shop scheduling problemDiscrete artificial bee colony
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
Scientia Iranica
发表日期
2012-12
卷期
第 19 卷, 第 6 期
页码
1921-1935
DOI
10.1016/j.scient.2012.10.034
语言
ENGLISH
成果收录
SCIE
资助标注
Opening Fund of Top Key Discipline of Computer Software and Theory in Zhejiang Provincial Colleges at Zhejiang Normal University [ZSDZZZZXK37]; Fundamental Research Funds for the Central Universities [11CXPY010]

作者

  • L

    Li, X. (第一作者)

  • Y

    Yin, M. (通讯)

    ne normal univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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