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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
