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

Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem

Han, Yu-Yan*; Liang, J. J.; Pan, Quan-Ke; Li, Jun-Qing; Sang, Hong-Yan; Cao, N. N.郑州大学
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY2013-7DOI: 10.1007/s00170-012-4493-5
38被引2阅读
引用收藏
分享

摘要

In this paper, three effective hybrid discrete artificial bee colony (hDABC1, hDABC2, hDABC3) algorithms are presented to solve the blocking flowshop scheduling problem with the objective of minimizing the total flowtime. The three hybrid DABC algorithms utilize discrete job permutations to represent food sources and apply discrete operators to generate new food sources for the employed bees, onlookers, and scouts, respectively. First, two heuristic rules called the MME-A and MME-B (variant of combination of minmax and NEH) are presented to construct an initial population with a certain level of quality and diversity. Second, a self-adaptive strategy is applied to employed bees. Third, the estimation of distribution algorithm implements explicit learning from selected individuals and then generates good solutions for onlooker bees. Last but not least, to improve the algorithms' local exploitation ability, a very efficient local search-based insertion neighborhood is carried out in three stages respectively, that is, hDABC1 algorithm is generated by applying a local search to the solution obtained in the employed bee stage. hDABC2 is designed by carrying out a local search in the onlooker bee stage, and hDABC3 is developed by applying a local search in the scout bee stage. Computational experiments on standard benchmark problems are conducted. The results and comparisons show that the proposed algorithms are very effective and efficient for the blocking flowshop scheduling problems with total flowtime criterion than the other algorithms.

学科与关键词

关键词
Blocking flowshopTotal flowtimeArtificial bee colony algorithmEstimation of distribution algorithm
相关
加载中…
  • An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers
    Zhang Su-jun; Gu Xing-sheng*Journal of Central South University, 2015, 22(9): 3471-3484.被引 15
  • Acceleration-based artificial bee colony optimizer for a distributed permutation flowshop scheduling problem with sequence-dependent setup times
    Yu, Yang*; Zhang, Feng-Qi; Huang, Jiang -PingAPPLIED SOFT COMPUTING, 2023, 135: 110029.被引 9
  • A discrete artificial bee colony algorithm with composite mutation strategies for permutation flow shop scheduling problem
    Li, X.; Yin, M.*Scientia Iranica, 2012, 19(6): 1921-1935.被引 35
查看全部 →

发表信息

论文状态
公开发表
期刊
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
发表日期
2013-07
卷期
第 67 卷, 第 1-4 期
页码
397-414
DOI
10.1007/s00170-012-4493-5
语言
ENGLISH
期刊等级
Q2
成果收录
SCIE
资助标注
National Natural Science Foundation of China [60905039]; Postdoctoral Science Foundation of China [20100480897]; Science Foundation of Shandong Province, China [BS2010DX005]; Project of Shandong Province Higher Educational Science and Technology Program [J10LG67, J09LJ29, J10LG25]

作者

  • H

    Han, Yu-Yan (通讯) (第一作者)

    liaocheng univ

  • L

    Liang, J. J.

    zhengzhou univ

查看全部 6 位作者收起作者
  • P

    Pan, Quan-Ke

    liaocheng univ

  • L

    Li, Jun-Qing

    liaocheng univ

  • S

    Sang, Hong-Yan

    liaocheng univ

  • C

    Cao, N. N.

    liaocheng univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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