摘要
为了解决战时道路抢修顺序缺少定量数据的参考,文中提出了一种基于车辆路径问题的模型。模型采用多约束多目标规划,并给了相应的算例,采用了蚁群算法进行求解。结果表明:此种方法易于实现、适应性强,能够更方便、更有效地为决策者提供决策支持。
In order to give the commander which road section should be repaired first,this paper introduces a new method via vehicle routing problem. It gives an example in detail. It calculates the optimal road before and after the selective attack. The results show that this method is easy to realize. This method is effective for commander to make decision.
出处
《物流工程与管理》
2015年第1期101-104,共4页
Logistics Engineering and Management
基金
全军军事学研究生资助课题(2012JY002-295)
关键词
抢修
车辆路径
选择性攻击
蚁群算法
rush repair
vehicle routing problem
selective attack
ant colony algorithm
