卫勤最短回路问题的遗传算法求解  

The Genetic Algorithm for Solving The Shortest Circuit Problem of Health Support(SCPHS)

作　　者：蒋兴波[1] 许开云[2] 吴耀民[1] 

机构地区：[1]第二军医大学卫生勤务学系军队卫生事业管理研究所,上海200433 [2]长海医院急诊科,上海200433

出　　处：《解放军医院管理杂志》2010年第3期247-249,共3页Hospital Administration Journal of Chinese People's Liberation Army

摘　　要：本文采用了一种基于环形交叉算子和环形变异算子的改进遗传算法IGA(Improved Genetic Algorithm),同时在遗传算法中结合贪心策略来解决卫勤最短回路问题(SCPHS)。对比试验结果表明,本文给出的算法能够在一个较短的时间内找到一个满意解;相对于文献中给出的其它算法,该算法更加有效。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 algorithms from the literature.

关 键 词：卫勤最短回路问题 改进的遗传算法 环形交叉算子 环形变异算子 TSP 

分 类 号：R197.32[医药卫生—卫生事业管理]