跳到主要导航 跳到搜索 跳到主要内容

Variable neighborhood based memetic algorithm for distributed assembly permutation flowshop

  • CAS - Academy of Mathematics and System Sciences
  • Beihang University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

The Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP) is a typical NP-hard optimization problem and represents an important area in multiple distributed production systems. This paper proposes a memetic algorithm based on Variable Neighborhood Search (VNS) for DAPFSP with the criterion to minimize the maximum completion time (i.e., makespan). Particularly, an efficient initialization based on the Nawaz-Enscore-Ham (NEH) heuristic is applied for sequencing the order of products. Then, several new neighborhoods (intra-product, inter-product) are proposed and incorporated into VNS for perturbation of the job assignment to factories, as well as the adjustment of job sequence in each factory. Simulation results and comparisons demonstrate that the Variable Neighborhood based Memetic Algorithm could yield satisfactory searching performances.

源语言英语
主期刊名2016 IEEE Congress on Evolutionary Computation, CEC 2016
出版商Institute of Electrical and Electronics Engineers Inc.
1682-1686
页数5
ISBN(电子版)9781509006229
DOI
出版状态已出版 - 14 11月 2016
活动2016 IEEE Congress on Evolutionary Computation, CEC 2016 - Vancouver, 加拿大
期限: 24 7月 201629 7月 2016

出版系列

姓名2016 IEEE Congress on Evolutionary Computation, CEC 2016

会议

会议2016 IEEE Congress on Evolutionary Computation, CEC 2016
国家/地区加拿大
Vancouver
时期24/07/1629/07/16

学术指纹

探究 'Variable neighborhood based memetic algorithm for distributed assembly permutation flowshop' 的科研主题。它们共同构成独一无二的学术指纹。

引用此