Drone arc routing problems. Issue 4 (24th October 2018)

• Record Type: Journal Article
• Authors: Campbell, James F.; Corberán, Ángel; Plana, Isaac; Sanchis, José M.
• Is Part Of: Networks. Volume 72:Issue 4(2018)
• Page Start: 543
• Page End: 559
• Publication Date: 2018-10-24
• Subjects: cutting path problems -- drones -- rural postman problem; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21858
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract: In this article, we present some drone arc routing problems (Drone ARPs) and study their relation with well‐known postman ARPs. Applications for Drone ARPs include traffic monitoring by flying over roadways, infrastructure inspection such as by flying along power transmission lines, pipelines or fences, and surveillance along linear features such as coastlines or territorial borders. Unlike the postmen in traditional ARPs, drones can travel directly between any two points in the plane without following the edges of the network. As a consequence, a drone route may service only part of an edge, with multiple routes being used to cover the entire edge. Thus the Drone ARPs are continuous optimization problems with an infinite number of feasible solutions. In order to solve them as a discrete optimization problem, we approximate each curve in the plane by a polygonal chain, thus allowing the vehicle to enter and leave each curve only at the points of the polygonal chain. If the capacity of the vehicles is unlimited, the resulting problem is a rural postman problem (RPP). We propose an algorithm that iteratively solves RPP instances with an increasing number of points of the polygonal chain and present results on several sets of instances. We also briefly discuss the case in which the drones have limited capacity and several drones are needed.