.png){kind=icon}
返回
Hybrid genetic algorithm approach for precedence-constrained sequencing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2011.11.019.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The objective of precedence-constrained sequencing problem (PCSP) is to locate the optimal sequence with the shortest traveling time among all feasible sequences. Various methods for effectively solving the PCSP have been suggested. This paper proposes a new concept of hybrid genetic algorithm (HGA) with adaptive local search scheme in order that the PCSP should be effectively solved. By the use of the adaptive local search scheme, the local search is automatically adapted into the loop of genetic algorithm. Two types of the PCSP are presented and analyzed to compare the efficiency among the proposed HGA approach and other competing conventional approaches. Finally, it is proved that the proposed HGA approach outperforms the other competing conventional approaches. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Precedence-constrained sequencing problem
Hybrid genetic algorithm
Adaptive local search
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
An efficient genetic algorithm for the traveling salesman problem with precedence constraints具有优先约束的旅行商问题的有效遗传算法
PREAI
分享收藏
分享收藏
查看更多内容