.png){kind=icon}
返回
Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2018.12.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Distributed assembly permutation flowshop scheduling problem (DAPFSP) has important applications in modem assembly systems. In this paper, we present three variants of the discrete invasive weed optimization (DIWO) for the DAPFSP with total flowtime criterion. For solving such a problem, we present a two-level representation that consists of a product permutation and a number of job sequences. We introduce neighbourhood operators for both the product permutation and job sequences. We design effective local search procedures respectively for product-permutation-based neighbourhood and job-sequence-based neighbourhood. By combining the problem-specific knowledge and the idea of invasive weed optimization, we present three DIWO-based algorithms: a two-level discrete invasive weed optimization (TDIWO), a discrete invasive weed optimization with hybrid search operators (HDIWO), and a HDIWO with selection probability. The algorithms explore the two neighbourhoods in quite a different way. We calibrate the presented DIWO algorithms by means of the design of experimental method, and carry out a comprehensive computational campaign based on the 810 benchmark instances in the literature. The numerical experiments show that the presented DIWO algorithms perform significantly better than the other competing algorithms in the literature. Among the proposed algorithms, HDIWO is the best one.
Keyword:
Flowshop
Assembly system
Meta-heuristics
Invasive weed optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
Local optimization of dynamic programs with guaranteed satisfaction of path constraints保证满足路径约束的动态程序的局部优化.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAI分享收藏分享收藏
查看更多内容