基于单亲遗传算法求解卫勤保障最短回路问题

目的提出一种用于求解卫勤保障最短回路问题的有效算法。方法采用仅使用变异算子和选择算子来繁殖后代的单亲遗传算法(PGA)。该算法基于K-随机近邻算法,同时结合了随机两点位置互换、相邻两点位置互换、环形部分逆转、随机插入等4种变异算子,在选择操作过程中结合贪心策略,进一步提高PGA算法的爬山能力。结果通过对CTSP31以及多组TSP标准数据集的测试结果表明,该算法相对于文献中已有算法更加有效。结论该算法可作为今后开发计算机辅助软件的基础,为提高卫勤指挥的质量和速度而提供辅助优化决策。

Solving shortest circuit problem of military health support based on partheno-genetic algorithm

Objective To propose an effective algorithm for solving the shortest circuit problem of military health support. Methods Partheno-genetic algorithm ( PGA) ,which only used mutation operation and selection operation,was adopted in the present study. The algorithm was based on K-random-nearer-neighbor algorithm combined with two-random-point exchange,two-neighbor -point exchange,circular-based part inversion and random insertion mutation operations. Furthermore,greedy strategy was applied in selection to impr...