摘要
指派问题在军事领域非常常见,军事指派问题一般是用匈牙利法来进行求解,匈牙利法复杂且难于编程实现,根据指派问题的特点将其与旅行商问题联系起来,提出了一种改进的蚁群算法。仿真证明了该算法解决军事领域指派问题的可行性和先进性。
Assignment problem is a common problem in military field, and Hungarian algorithm is a common algorithm for this problem, but Hungarian algorithm is complicated and difficult to be programmed. So, base on the relation between the traveling salesman problem and the military assignment problem, an improved ant colony algorithm for the assignment problem is proposed in this article, simulations show that the algorithm is effective and advanced.
出处
《兵工自动化》
2013年第6期27-30,共4页
Ordnance Industry Automation
关键词
蚁群算法
旅行商问题
信息素
军事指派问题
ant colony algorithm
traveling salesman problem
pheromone
military assignment problem
