| 卫勤最短回路问题的遗传算法求解 |
| |
| 引用本文： | 蒋兴波,许开云,吴耀民.卫勤最短回路问题的遗传算法求解[J].解放军医院管理杂志,2010,17(3):247-249. |
| |
| 作者姓名： | 蒋兴波 许开云 吴耀民 |
| |
| 作者单位： | 1. 军医大学卫生勤务学系军队卫生事业管理研究所,上海,200433
2. 医院急诊科,上海,200433 |
| |
| 摘 要： | 本文采用了一种基于环形交叉算子和环形变异算子的改进遗传算法IGA（Improved Genetic Algorithm）,同时在遗传算法中结合贪心策略来解决卫勤最短回路问题（SCPHS）。对比试验结果表明,本文给出的算法能够在一个较短的时间内找到一个满意解;相对于文献中给出的其它算法,该算法更加有效。
|
| 关 键 词： | 卫勤最短回路问题 改进的遗传算法 环形交叉算子 环形变异算子 TSP |
The Genetic Algorithm for Solving The Shortest Circuit Problem of Health Support(SCPHS) |
| |
| JIANG Xing-bo,XU Kai-yun,WU Yao-min.The Genetic Algorithm for Solving The Shortest Circuit Problem of Health Support(SCPHS)[J].Hospital Administration Journal of Chinese People's Liberation Army,2010,17(3):247-249. |
| |
| Authors: | JIANG Xing-bo XU Kai-yun WU Yao-min |
| |
| Institution: | Institute of Military Health Management;Faculty of Health Service;Second Military Medical University;Shanghai 200433;Emergency Department;Changhai Hospital;Shanghai 200433 |
| |
| Abstract: | SCPHS belongs to TSP(Traveling Salesman Problem),which is a type NP-complete problem.In this paper,circular-based crossover operator and circular-based mutation operator were adopted in our genetic algorithm.With the combination of greedy strategy and improved genetic algorithm,SCPHS can be effectively solved.The comparison results showed that the satisfactory solution can be obtained in a shorter period of time by using the improved genetic algorithm and the algorithm is more effective than the existing al... |
| |
| Keywords: | TSP |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
