2019/12/09 by Kaarthik Sundar, Sundar, Kaarthik, Sujeevraja Sanjeevi +3 · 1 citation
Engineering · #Assembly Line Balancing Optimization #FOS: Mathematics #Optimization and Control (math.OC) #Transportation and Mobility Innovations #Vehicle Routing Optimization Methods
paper · pdf · doi:10.48550/arxiv.1912.04353
openalex publication_date 2019/12/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper formulates a team orienteering problem with multiple fixed-wing drones and develops a branch-and-price algorithm to solve the problem to optimality. Fixed-wing drones, unlike rotary drones, have kinematic constraints associated with them, thereby preventing them to make on-the-spot turns and restricting them to a minimum turn radius. This paper presents the implications of these constraints on the drone routing problem formulation and proposes a systematic technique to address them in the context of the team orienteering problem. Furthermore, a novel branch-and-price algorithm with branching techniques specific to the constraints imposed due to fixed-wing drones are proposed. Extensive computational experiments on benchmark instances corroborating the effectiveness of the algorithms are also presented.