| 勤务编排问题的关联度识别型遗传算法 |
| |
| 引用本文： | 周琨,夏洪山. 勤务编排问题的关联度识别型遗传算法[J]. 南京理工大学学报(自然科学版), 2011, 0(4) |
| |
| 作者姓名： | 周琨 夏洪山 |
| |
| 作者单位： | 南京航空航天大学民航学院; |
| |
| 基金项目： | 国家自然科学基金(60672167) |
| |
| 摘 要： | 为了提高遗传算法求解勤务编排问题时的优化性能,提出一种关联度识别型遗传算法。算法根据勤务的组成结构定义基因关联度,以量化基因之间的联结关系。据此引入基因座优化算子,将勤务集合划分为若干子集合,依次调整各勤务子集对应的染色体结构,使关联度较强的变量基因位置较为靠近。基于这种染色体结构设计多点交叉算子,根据相邻基因的关联度选择交叉点位置,分基因片段完成交叉操作,以便于交叉算子高效交换积木块,达到提高遗传算法寻优效率的目的。实验结果证明,该算法能够有效地求解勤务编排问题。
|
| 关 键 词： | 勤务编排 遗传算法 基因关联度 积木块 |
Linkage Indentification Genetic Algorithm for Duty Planning |
| |
| ZHOU Kun,XIA Hong-shan. Linkage Indentification Genetic Algorithm for Duty Planning[J]. Journal of Nanjing University of Science and Technology(Nature Science), 2011, 0(4) |
| |
| Authors: | ZHOU Kun XIA Hong-shan |
| |
| Affiliation: | ZHOU Kun,XIA Hong-shan(College of Civil Aviation,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China) |
| |
| Abstract: | To improve the optimization performance of the genetic algorithm for duty planning,a linkage identification genetic algorithm is proposed.The algorithm defines linkage of genes based on the structure of duties,so that the relationship between different genes can be quantified.To optimize the structure of a chromosome,a locus-reordering operator is devised.The operator partitions the set of duties depending on linkage,and permutes genes with tight linkage sequentially.According to the optimized structure,a m... |
| |
| Keywords: | duty planning genetic algorithms gene linkage building blocks |
| 本文献已被 CNKI 等数据库收录！ |
|
