.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Colonial competition algorithm
Multi-objective
Hybrid flowshops
Pareto optimal solutions
Variable neighborhood search (VNS)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
PREAI
ShareSave
View more