基于蚁群算法的维修保障资源应急调度研究

在保障资源损毁后,将现有保障资源整合成机动保障小组,按照一定的机动路线巡回实施支援保障,可以最大限度的节省现存保障资源,提高保障效能。实施机动巡回的资源调度,需要确定机动保障小组的数量以及机动的路线,这类问题可归结为带约束条件的组合优化问题。应用蚁群算法建立了机动巡回保障优化数学模型,给出了算法的实现步骤。案例结果表明,该算法可以快速、有效求得巡回保障的优化解,得到巡回保障过程中的较优方案。

Study of the Ant-Colony-Algorithm-Based Rush-Dispatch of Maintenance and Support Resources

When support resources are,to some extent,damaged or lost,the remaining support resources may be integrated into mobile support groups,which will practice patrol support along certain routes,thus saving the existing support resources to the greatest extent and improving their support efficiency and capability.To practice the mobile patrol dispatch of support resources,the number of the mobile support groups to be needed and the routes of the mobile patrol support have to determined first,which might be classified as a problem of combination optimization with limitation conditions.A mathematical model for the optimization of mobile patrol support is established by means of the Ant Colony Algorithm method in the paper,with the implementation steps of the calculation presented.The results of some practical examples show that by the calculation method the optimized solution to the patrol support may be quickly and effectively worked out,thus obtaining the comparatively good scheme for mobile patrol support.