基于蚁群算法的作战补给车辆行驶线路规划研究
Driving route planning of combat supply vehicles based on ant colony algorithm
胡荣璞1
作者信息
- 1. 江南机电设计研究所 贵阳 550009
- 折叠
摘要
现代战争呈现高对抗、复杂性高和快速性等诸多特征,战场上时间就是生命,战场补给成为十分重要的一环,快速高效的战场补给能够有效支撑我方战斗力持续保持.对补给车辆如何能够寻找到最高效的行驶路线进行研究,将战场上需补给的装备或士兵抽象为坐标点,形成需行驶坐标地图,构建蚁群寻优模型,对最优补给车辆行驶路线进行规划求解,提供一种最小路程的行驶路线规划求解方法.
Abstract
Modern warfare presents many characteristics such as high confrontation,high complexity,and rapidity.Time is life on the battlefield,and battlefield supply is a very important link.Rapid and efficient battlefield supply can effectively support the continuous maintenance of our combat effectiveness.This paper studies how supply vehicles can find the most efficient driving routes.Abstract the various equipment or soldiers on the battlefield that need to be replenished as coordinate points to form a coordinate map that needs to be traveled,construct an ant colony optimization model,plan and solve the optimal driving route of the supply vehicle,and provide a planning and solving method for the driving route with the minimum distance.
关键词
线路规划/蚁群算法/补给车辆Key words
route planning/ant colony algorithm/supply vehicle引用本文复制引用
出版年
2024
NETL
NSTL
万方数据