.png){kind=icon}
返回
A hybrid genetic algorithm for no-wait flowshop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2010.06.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a hybrid genetic algorithm is proposed to solve the no-wait flowshop scheduling problem with the makespan objective. The proposed algorithm hybridizes the genetic algorithm and a novel local search scheme. The OA-crossover operator is designed to enhance the capability of intensification in the genetic algorithm. The proposed local search scheme combines two local search methods: the Insertion Search (IS) and a novel local search method called the Insertion Search with Cut-and-Repair (ISCR). These two local search methods play different roles in the search process. The Insertion Search is responsible for searching a small neighborhood while the Insertion Search with Cut-and-Repair is responsible for searching a large neighborhood. The experimental results show the advantage of combining the two local search methods. Extensive experiments were conducted to evaluate the proposed hybrid genetic algorithm and the results revealed that the proposed algorithm is very competitive. It obtained the same best solutions that were reported in the literature for all problems in the benchmark provided by Carlier (1978). Also, it improved 5 out of the 21 current best solutions reported in the literature and achieved the current best solutions for 14 of the remaining 16 problems in the benchmark presented by Reeves (1995). Furthermore, the proposed algorithm was applied to effectively solve the 120 problems in the benchmark provided by Taillard (1990). (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Genetic algorithm
Local search
Hybrid genetic algorithm
No-wait flowshop scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.1K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines
PREAI
分享收藏A hybrid genetic algorithm for the resource-constrained project scheduling problem一种求解资源受限项目调度问题的混合遗传算法
PREAI
分享收藏
查看更多内容