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

A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems

Pan, Quan-Ke; Wang, Ling*; Qian, Bin清华大学
COMPUTERS & OPERATIONS RESEARCH2009-8DOI: 10.1016/j.cor.2008.10.008
160被引11阅读
引用收藏
分享

摘要

This paper presents a novel discrete differential evolution (DDE) algorithm for solving the no-wait flow shop scheduling problems with makespan and maximum tardiness criteria. First, the individuals in the DDE algorithm are represented as discrete job permutations, and new mutation and crossover operators are developed based on this representation. Second, an elaborate one-to-one selection operator is designed by taking into account the domination status of a trial individual with its counterpart target individual as well as an archive set of the non-dominated solutions found so far. Third, a simple but effective local search algorithm is developed to incorporate into the DDE algorithm to stress the balance between global exploration and local exploitation. In addition, to improve the efficiency of the scheduling algorithm, several speed-up methods are devised to evaluate a job permutation and its whole insert neighborhood as well as to decide the domination status of a solution with the archive set. Computational simulation results based on the well-known benchmarks and statistical performance comparisons are provided. It is shown that the proposed DDE algorithm is superior to a recently published hybrid differential evolution (HDE) algorithm [Qian B, Wang I, Huang DX, Wang WL, Wang X. An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Computers & Operations Research 2009:36(1):209-33] and the well-known multi-objective genetic local search algorithm (IMMOGLS2) [Ishibuchi H, Yoshida I, Murata T. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation 2003;7(2):204-23] in terms of searching quality, diversity level, robustness and efficiency. Moreover, the effectiveness of incorporating the local search into the DDE algorithm is also investigated.

学科与关键词

关键词
Differential evolutionDiscrete differential evolution algorithmNo-wait flow shopMulti-objectiveInsert neighborhoodSpeed-up
相关
加载中…
  • Discrete differential evolution algorithm for distributed blocking flowshop scheduling with makespan criterion
    Zhang, Guanghui; Xing, Keyi*; Cao, FengENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2018, 76: 96-107.被引 100
  • An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure
    Li, Xiangtao; Yin, Minghao*ADVANCES IN ENGINEERING SOFTWARE, 2013, 55: 10-31.被引 126
  • A discrete differential evolution algorithm for the permutation flowshop scheduling problem
    Pan, Quan-Ke; Tasgetiren, Mehmet Fatih*; Liang, Yun-ChiaCOMPUTERS & INDUSTRIAL ENGINEERING, 2008, 55(4): 795-816.被引 231
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPUTERS & OPERATIONS RESEARCH
发表日期
2009-08
卷期
第 36 卷, 第 8 期
页码
2498-2511
DOI
10.1016/j.cor.2008.10.008
语言
ENGLISH
成果收录
SCIE
资助标注
National Science Foundation of China [60874075, 70871065, 60834004, 60774082]; National 863 Hi-Tech Randl) Plan [2007 AA04Z155]; State Key Laboratory of Digital Manufacturing Equipment and Technology (Huazhong University of Science and Technology); SRF; SEM; Postdoctoral Science Foundation of China [20070410791]

作者

  • P

    Pan, Quan-Ke (第一作者)

    liaocheng univ

  • W

    Wang, Ling (通讯)

    tsinghua univ

查看全部 3 位作者收起作者
  • Q

    Qian, Bin

    tsinghua univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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