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

作者简介:

通讯作者:

中图分类号:

基金项目:

全军“十一五”科技攻关课题(08G078).


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

Fund Project:

Supported by Key Research Project of “11th Five-year” of PLA(08G078).

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

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

    Abstract:

    ObjectiveTo propose an effective algorithm for solving the shortest circuit problem of military health support.MethodsPartheno-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 improve the hill-climbing capability of PGA.ResultsThe simulation results of CTSP31 and standard dataset from TSP library indicated that the PGA was more effective than existing algorithms from the literature.ConclusionPGA can serve as a basis for further development of a computer-assisted program,and it provides optimized decision-making scheme for improving the quality and speed of military medical service disposition.

    参考文献
    相似文献
    引证文献
相关视频

分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2009-07-01
  • 最后修改日期:2009-11-20
  • 录用日期:2009-11-27
  • 在线发布日期: 2010-02-01
  • 出版日期:
文章二维码
重要通知
友情提醒: 近日发现论文正式见刊或网络首发后,有人冒充我刊编辑部名义给作者发邮件,要求添加微信,此系诈骗行为!可致电编辑部核实:021-81870792。
            《海军军医大学学报》编辑部
关闭