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

An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure

Li, Xiangtao; Yin, Minghao*吉林大学
ADVANCES IN ENGINEERING SOFTWARE2013-1DOI: 10.1016/j.advengsoft.2012.09.003
126被引3阅读
引用收藏
分享

摘要

The permutation flow shop problem (PFSSP) is an NP-hard problem of wide engineering and theoretical background. In this paper, a differential evolution (DE) based memetic algorithm, named ODDE, is proposed for PFSSP. First, to make DE suitable for PFSSP, a new LRV rule based on random key is introduced to convert the continuous position in DE to the discrete job permutation. Second, the NEH heuristic was combined the random initialization to the population with certain quality and diversity. Third, to improve the global optimization property of DE, a DE approach based on measure of population's diversity is proposed to tuning the crossover rate. Fourth, to improve the convergence rate of DE, the opposition-based DE employs opposition-based learning for the initialization and for generation jumping to enhance the global optimal solution. Fifth, the fast local search is used for enhancing the individuals with a certain probability. Sixth, the pairwise based local search is used to enhance the global optimal solution and help the algorithm to escape from local minimum. Additionally, simulations and comparisons based on PFSSP benchmarks are carried out, which show that our algorithm is both effective and efficient. We have also evaluated our algorithm with the well known DMU problems. For the problems with the objective of minimizing makespan, the algorithm ODDE obtains 24 new upper bounds of the 40 instances, and for the problems with the objective of maximum lateness, ODDE 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.

学科与关键词

关键词
Differential evolutionPermutation flow shop schedulingMemetic algorithmLocal searchDiversity measureOpposition based search
相关
加载中…
  • An effective differential evolution algorithm for permutation flow shop scheduling problem
    Liu, Ying; Yin, Minghao*; Gu, WenxiangAPPLIED MATHEMATICS AND COMPUTATION, 2014, 248: 143-159.被引 39
  • A self-guided differential evolution with neighborhood search for permutation flow shop scheduling
    Shao, Weishi; Pi, Dechang*EXPERT SYSTEMS WITH APPLICATIONS, 2016, 51: 161-176.被引 38
  • A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
    Pan, Quan-Ke; Wang, Ling*; Qian, BinCOMPUTERS & OPERATIONS RESEARCH, 2009, 36(8): 2498-2511.被引 160
查看全部 →

发表信息

论文状态
公开发表
期刊
ADVANCES IN ENGINEERING SOFTWARE
发表日期
2013-01
卷期
第 55 卷
页码
10-31
DOI
10.1016/j.advengsoft.2012.09.003
语言
ENGLISH
期刊等级
Q2
成果收录
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]; Natural Science Foundation of Jilin Province [20110104]

作者

  • L

    Li, Xiangtao (第一作者)

    ne normal univ

  • Y

    Yin, Minghao (通讯)

    jilin univ · ne normal univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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