Photo from wikipedia
Abstract We investigate a single-vehicle parcel delivery problem in which customers may be served either by the vehicle or by a portable companion drone launched from the vehicle. The problem… Click to show full abstract
Abstract We investigate a single-vehicle parcel delivery problem in which customers may be served either by the vehicle or by a portable companion drone launched from the vehicle. The problem may be viewed as a Traveling Salesman Problem with Drone (TSP-D), and is modelled as a 0-1 mixed-integer program (MIP) that synchronizes vehicle and drone operations with the objective of minimizing the duration of the joint tour. Using a combination of valid inequalities, pre-processing, and other bound tightening strategies, we enhance the tractability of the proposed MIP formulation.
Journal Title: Journal of the Operational Research Society
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!