Multidepot UAV Routing Problem with Weapon Configuration and Time Window

الملخص EN

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.