• CN:11-2187/TH
  • ISSN:0577-6686

机械工程学报 ›› 2021, Vol. 57 ›› Issue (17): 263-272.doi: 10.3901/JME.2021.17.263

• 数字化设计与制造 • 上一篇    

扫码分享

求解分布式柔性作业车间调度的混合蛙跳算法

孟磊磊1, 张彪1, 任亚平2, 张超勇3   

  1. 1. 聊城大学计算机学院 聊城 252059;
    2. 暨南大学智能科学与工程学院 珠海 519070;
    3. 华中科技大学数字制造装备与技术国家重点实验室 武汉 430074
  • 收稿日期:2020-09-05 修回日期:2020-11-05 发布日期:2021-11-16
  • 通讯作者: 张超勇(通信作者),男,1972年出生,博士,教授,博士研究生导师。主要研究方向为车间调度、网络化制造和绿色制造。E-mail:zcyhust@mail.hust.edu.cn
  • 作者简介:孟磊磊,男,1991年出生,博士,讲师。主要研究方向为车间调度、刀具磨损、绿色制造。E-mail:mengleilei@lcu-cs.com
  • 基金资助:
    国家自然科学基金资助项目(51861165202,51575211,51705263)。

Hybrid Shuffled Frog-leaping Algorithm for Distributed Flexible Job Shop Scheduling

MENG Leilei1, ZHANG Biao1, REN Yaping2, ZHANG Chaoyong3   

  1. 1. School of Computer Science, Liaocheng University, Liaocheng 252059;
    2. School of Intelligent Systems Science and Engineering, Jinan University, Zhuhai 519070;
    3. State Key Lab of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan 430074
  • Received:2020-09-05 Revised:2020-11-05 Published:2021-11-16

摘要: 针对分布式柔性作业车间(Distributed flexible job shop scheduling problem,DFJSP)最小化最大完工时间问题,提出一种混合蛙跳算法。在该算法中,编码采用基于工序序列和工厂序列的部分解空间编码方案,机床选择在解码过程中通过规则确定。引入变邻域搜索算法提升蛙跳算法的局部搜索能力。为了弥补部分解空间编码不能探索整个解空间的缺点,引入针对关键工厂的全解空间禁忌搜索,从而扩大算法解空间、进一步提升算法的局部搜索能力。通过对基准实例的求解,并与现有的最先进算法进行对比,验证了所提算法的有效性和优越性。

关键词: 分布式调度, 柔性作业车间, 蛙跳算法, 最大完工时间

Abstract: Aiming at the distributed flexible job shop scheduling problem (DFJSP) with minimizing makespan, a hybrid shuffled frog-leaping algorithm (HSFLA) is proposed. In this algorithm, the encoding adopts the scheme of partial solution space based on the operation and factory sequences, and the machine selection is determined in the decoding process with a rule. A variable neighborhood search (VNS) algorithm is introduced to improve the local search ability of HSFLA. To make up for the shortcoming that the partial space encoding method cannot search the full solution space, a tabu search algorithm of full solution space is introduced in critical factory to expand the solution space and further improve the local search ability of HSFLA. By solving benchmark instances and comparing HSFLA with the existing state-of-the-art algorithms, the effectiveness and superiority of HSFLA are proved.

Key words: distributed scheduling, flexible job shop, shuffled frog-leaping algorithm, makespan

中图分类号: