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.
Sundar, Kaarthik, et al. "A branch-and-price algorithm for a team orienteering problem with fixed-wing drones." EURO Journal on Transportation and Logistics, vol. 11, Jan. 2022. https://doi.org/10.1016/j.ejtl.2021.100070
Sundar, Kaarthik, Sanjeevi, Sujeevraja, & Montez, Christopher Martin (2022). A branch-and-price algorithm for a team orienteering problem with fixed-wing drones. EURO Journal on Transportation and Logistics, 11. https://doi.org/10.1016/j.ejtl.2021.100070
Sundar, Kaarthik, Sanjeevi, Sujeevraja, and Montez, Christopher Martin, "A branch-and-price algorithm for a team orienteering problem with fixed-wing drones," EURO Journal on Transportation and Logistics 11 (2022), https://doi.org/10.1016/j.ejtl.2021.100070
@article{osti_1856144,
author = {Sundar, Kaarthik and Sanjeevi, Sujeevraja and Montez, Christopher Martin},
title = {A branch-and-price algorithm for a team orienteering problem with fixed-wing drones},
annote = {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.},
doi = {10.1016/j.ejtl.2021.100070},
url = {https://www.osti.gov/biblio/1856144},
journal = {EURO Journal on Transportation and Logistics},
issn = {ISSN 2192-4376},
volume = {11},
place = {United States},
publisher = {Elsevier},
year = {2022},
month = {01}}