Featured Application: The improved model can effectively adapt to the problem of UAV swarm reconnaissance task allocation. On the basis of ensuring the optimization of reconnaissance reward, the UAV resources should be distributed as much as possible to reasonably complete the overall combat mission.Abstract: This paper is devoted to the unmanned aerial vehicle (UAV) mission allocation problem. To solve this problem in a more realistic battlefield environment, an improved mathematical model for UAV mission allocation is proposed. Being different from previous formulations, this model not only considers the difference in the importance of the target but also the constraints of the time window. In addition, an indicator of reconnaissance reward is added to this model. Each target area has a different importance, just as the strategic value of each region is different in combat. In this paper, we randomly generate the value factor for each reconnaissance area. To solve the mathematical model with different operational intentions, a dimensionality reduction process for which the reconnaissance reward is the optimization objective is presented. Finally, based on the improved model, the simulation result with Lingo is compared with that of non-dominated sorting genetic algorithm with elite strategy (NSGA-II) and genetic algorithm (GA) to verify the reliability and the effectiveness of the improved method. Appl. Sci. 2019, 9, 2184 2 of 17 an improved genetic algorithm for the UAV mission planning problem with limited resources, and the simulation results were analyzed and verified [14]. Lanah et al. presented a maximum coverage stochastic orienteering problem with time windows (MCS-OPTW) planning approach for mission planning and showed the simulation data [15]. Zhu et al. proposed a new reconnaissance mission planning model and used a genetic algorithm with the UAVs' task sequence to solve the model [16]. The existing reconnaissance mission models used the shortest path as the objective function and only considered a single task sequence assignment without considering the reconnaissance time allocation of the UAV. In reality, the allocation of reconnaissance time is often the decisive factor in determining the success of the reconnaissance mission and the core indicator that the commander is concerned about. The new model proposed in this paper considers the reconnaissance reward maximization as the objective function. By considering the allocation of each UAV's reconnaissance time resource, the reconnaissance time allocation and task sequence allocation are considered simultaneously.The UAV mission planning problem is the extended multiple Dubins traveling salesmen problem (MDTSP), which is a typical NP-hard combinatorial optimization problem. Some studies translated related models into a mixed integer linear programming (MILP) and achieved good results [17][18][19]. The time window was first applied to the vehicle routing problem (VRP) problem model. Righini and Salani systematically introduced the VRP with time wind...