Unmanned Aerial Vehicles (UAVs) have emerged as integral components in logistics systems, where their potential for efficient delivery services is being explored. However, the limited battery capacity of UAVs poses a significant challenge for long-distance delivery applications. In this paper, we investigate a hybrid problem involving UAV trajectory planning and charging scheduling for long-distance logistics systems with a charging network. In the problem under study, multiple UAVs are assigned long-distance delivery tasks. A UAV can stop at any charging station in the charging network to charge if it is in a low-energy state. An Ant Colony Optimization-based UAV Trajectory Planning and Charging Scheduling (ACO-TPCS) algorithm is proposed to minimize task completion time by optimizing UAV trajectory and charging plans. The main framework of the ACO-TPCS algorithm consists of several key components, including reachable graph construction, candidate flight path generation, pheromone matrix construction, ant generation, feasible solution generation, and pheromone update method. All these components are delicately designed. Through extensive experimentation and comparison with baseline algorithms, we demonstrate the effectiveness of the ACO-TPCS algorithm in addressing the problem under study.