For many decades, the Vehicle Routing Problem (VRP) and its different variants have been studied and found applications in the real world. This paper briefly surveys VRP instances with applications to multi-objective Unmanned Aerial Vehicle (UAV) operations. Focusing on multi-objective multi-UAV mission planning problems, we try to take advantage of the literature in the VRP and its variants. We show that each military multi-UAV mission has its corresponding VRP variant. We present a novel algorithm that relies on an enhanced tree search algorithm to solve complex multi-UAV mission planning problems with complex constraints. In simulation, we introduce examples for practical problem sizes in military UAV applications.