Abstract
In recent wars, there is an increasing trend that unmanned aerial vehicles (UAVs) are utilized to conduct military attacking missions. In this paper, we investigate a novel multidepot UAV routing problem with consideration of weapon configuration in the UAV and the attacking time window of the target. A mixed-integer linear programming model is developed to jointly optimize three kinds of decisions: the weapon configuration strategy in the UAV, the routing strategy of target, and the allocation strategy of weapons to targets. An adaptive large neighborhood search (ALNS) algorithm is proposed for solving the problem, which is tested by randomly generated instances covering the small, medium, and large sizes. Experimental results confirm the effectiveness and robustness of the proposed ALNS algorithm.
Highlights
With the development of information technologies, artificial intelligence, and new materials, as well as their wide application in unmanned aerial vehicles (UAVs), the abilities of UAVs on autonomously flying, endurance, and stealth have been greatly improved
Motivated by the practical requirement in military mission planning of UAV, we investigated the multidepot UAV routing problem with weapon configuration and time window (MD-URP-WC&TW), which can be viewed as a new extension on the traditional vehicle routing problem (VRP)
This paper focuses on the mathematical model and solution algorithm design for a multidepot UAV routing problem with consideration of weapon configuration in UAV and time window of the target
Summary
With the development of information technologies, artificial intelligence, and new materials, as well as their wide application in unmanned aerial vehicles (UAVs), the abilities of UAVs on autonomously flying, endurance, and stealth have been greatly improved. The weapons delivered to a target are not deterministic and are impacted by the weapon configuration and routing strategies of the UAV, while the types and quantities of products delivered to each customer are deterministic in the general VRP problem. Motivated by the practical requirement in military mission planning of UAV, we investigated the multidepot UAV routing problem with weapon configuration and time window (MD-URP-WC&TW), which can be viewed as a new extension on the traditional VRP. In MD-URP-WC&TW, three kinds of decisions should be cooperatively optimized, which are the weapon configuration strategy in the UAV, the routing strategy of target, and the allocation strategy of weapons to targets The interaction among these decisions makes the modelling and solution of the problem more complex.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
