Modeling the flying sidekick traveling salesman problem with multiple drones

DOI10.1002/net.22022OpenAlexW3126119621MaRDI QIDQ6065831

Roberto Montemanni, Stefano Novellani, Mauro Dell'Amico

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22022

zbMATH Keywords

branch-and-cutMILPformulationsUAVparcel deliveryaerial dronesdrone scheduling

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Enabling same-day delivery using a drone resupply model with transshipment points

Cites Work

• The vehicle routing problem with drones: several worst-case results
• Facet identification for the symmetric traveling salesman polytope
• A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem
• A truck and drones model for last-mile delivery: a mathematical model and heuristic approach
• Multi-visit drone routing problem
• Modelling the mobile target covering problem using flying drones
• The vehicle routing problem with drones: Extended models and connections
• A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
• A variable neighborhood search for flying sidekick traveling salesman problem

This page was built for publication: Modeling the flying sidekick traveling salesman problem with multiple drones