.png){kind=icon}
返回
Multi-objective colonial competitive algorithm for hybrid flowshop problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2016.06.034.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This study analyses the multi-objective optimization in hybrid flowshop problem, in which two conflicting objectives, makespan and total weighted tardiness, are considered to be minimized simultaneously. The multi-objective version of Colonial Competitive Algorithm (CCA) for real world optimization problem is introduced and investigated. In contrast to multi-objective problems solved by CCA, presented in the literature, which used the combination of the objectives as single objective, the proposed algorithm is established on Pareto solutions concepts. Another novelty of this paper is estimating the power of each imperialist by a probabilistic criterion for this multi objective algorithm. Besides that, the variable neighborhood search is implemented as an assimilation strategy. Performance of the algorithm is finally compared with a famous algorithm for scheduling problem, NSGA-II, and the multi-objective form of CCA [28]. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Colonial competition algorithm
Multi-objective
Hybrid flowshops
Pareto optimal solutions
Variable neighborhood search (VNS)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
Group scheduling in flexible flow shops: a hybridised approach of imperialist competitive algorithm and electromagnetic-like mechanism柔性流水车间中的组调度: 帝国主义竞争算法和类电磁机制的混合方法
PREAI
分享收藏
A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
PREAI
分享收藏
查看更多内容