目的提出一种用于求解卫勤保障最短回路问题的有效算法。方法采用仅使用变异算子和选择算子来繁殖后代的单亲遗传算法(PGA)。该算法基于K-随机近邻算法,同时结合了随机两点位置互换、相邻两点位置互换、环形部分逆转、随机插入等4种变异算子,在选择操作过程中结合贪心策略,进一步提高PGA算法的“爬山”能力。结果通过对CTSP31以及多组TSP标准数据集的测试结果表明,该算法相对于文献中已有算法更加有效。结论该算法可作为今后开发计算机辅助软件的基础,为提高卫勤指挥的质量和速度而提供辅助优化决策。 Objective To propose an effective algorithm for solving the shortest circuit problem of medical service support. The method employs a single parent genetic algorithm (PGA) that uses only mutation operators and selection operators to breed offspring. The algorithm is based on K-stochastic neighbor algorithm and combines four kinds of mutation operators such as random two-point location swap, adjacent two-point location swaps, partial ring reversal and random insertion. Combining greedy strategies in the selection process, Improve the PGA algorithm “climbing ” ability. Results The test results of CTSP31 and multiple sets of TSP standard datasets show that this algorithm is more effective than the existing algorithms in the literature. Conclusion The algorithm can be used as the basis for the development of computer-aided software in the future. It can provide auxiliary optimization decision-making to improve the quality and speed of medical command.