The Mothership and Drone Routing Problem

The mothership and drone routing problem (MDRP) considers the routing of a two-vehicle tandem. The larger vehicle, which may be a ship or an airplane, is called the mothership ; the smaller vehicle, which may be a small boat or unmanned aerial vehicle, is called the drone . We assume that there exists a set of target locations T . For each t in T , the drone must launch from the mothership, visit t , and then return to the mothership to refuel. The drone has a limited range of R time units. In the MDRP, we assume that both mothership and drone operate in the “open seas” (i.e., using the Euclidean metric). We also introduce the mothership and infinite-capacity drone routing problem (MDRP-IC), where a drone launches from the mothership and visits one or more targets consecutively before returning to the mothership. Our exact approach uses branch and bound, where each node of the branch-and-bound tree corresponds to a potential subsequence of the order of target visits. A lower bound at each node is given by solving a second-order cone program, which optimally chooses a launch point and landing point for each target in the subsequence. A set of heuristics that also uses a second-order cone program as an embedded procedure is presented. We show that our schemes are flexible to accommodate a variety of additional constraints and/or objective functions. Computational results and interesting variants of the MDRP and MDRP-IC are also presented.

[1]  Chase C. Murray,et al.  The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery , 2015 .

[2]  Marie Schmidt,et al.  Optimization Approaches for the Traveling Salesman Problem with Drone , 2016, Transp. Sci..

[3]  Barrett W. Thomas,et al.  Same‐day delivery with heterogeneous fleets of drones and vehicles , 2018, Networks.

[4]  Stephen P. Boyd,et al.  Applications of second-order cone programming , 1998 .

[5]  Takashi Tsuchiya,et al.  Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions , 2000, Math. Program..

[6]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[7]  Murat Karakaya,et al.  Efficient route planning for an unmanned air vehicle deployed on a moving carrier , 2016, Soft Comput..

[8]  Andy M. Ham,et al.  Integrated scheduling of m-truck, m-drone, and m-depot constrained by time-window, drop-pickup, and m-visit using constraint programming , 2018, Transportation Research Part C: Emerging Technologies.

[9]  Yves Deville,et al.  Heuristic methods for the Traveling Salesman Problem with Drone , 2015, ArXiv.

[10]  Ángel Corberán,et al.  Drone arc routing problems , 2018, Networks.

[11]  Bruce L. Golden,et al.  Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey , 2018, Networks.

[12]  Bruce L. Golden,et al.  The vehicle routing problem with drones: Extended models and connections , 2017, Networks.

[13]  Anand Subramanian,et al.  A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem , 2016, INFORMS J. Comput..