An exact solution method for the TSP with drone based on decomposition

DOI10.1016/J.COR.2020.105127MaRDI QIDQ2026993zbMATH OpenOpenAlexFDO

Authors Sebastián A. Vásquez, Gustavo Angulo, Mathias A. Klapp

Publication date 21 May 2021

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2020.105127

zbMATH Keywords

benders' decompositiondronestraveling salesmanvehicle routing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• The traveling salesman problem with release dates and drone resupply
• A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones
• Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
• A survey of truck-drone routing problem: literature review and research prospects
• Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem

Cites work

• A note on the prize collecting traveling salesman problem
• A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem
• A study on the traveling salesman problem with a drone
• Improving the integer L-shaped method
• Partitioning procedures for solving mixed-variables programming problems
• The Benders decomposition algorithm: a literature review
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse

Cited in

(23)

• An elliptical cover problem in drone delivery network design and its solution algorithms
• The multiple traveling salesman problem in presence of drone- and robot-supported packet stations
• A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones
• A survey of truck-drone routing problem: literature review and research prospects
• Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
• Polyhedral analysis and a new algorithm for the length constrained K-drones rural postman problem
• The traveling salesman problem with release dates and drone resupply
• Optimal and heuristic algorithms for the multi-objective vehicle routing problem with drones for military surveillance operations
• The vehicle routing problem with floating targets: formulation and solution approaches
• A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
• A variable neighborhood search for parcel delivery by vehicle with drone cycles
• The vehicle routing problem with drones and drone speed selection
• Planning robust drone-truck delivery routes under road traffic uncertainty
• A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty
• A new MILP formulation for the flying sidekick traveling salesman problem
• An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem
• Facility location decisions for drone delivery with riding: a literature review
• Collaborative truck multi-drone delivery system considering drone scheduling and en route operations
• Improved Benders decomposition for home healthcare vehicle and drone routing problem in two-echelon supply chains
• A literature review of drone-truck routing problems: challenges and future research directions
• Vehicle routing problem with drones and variable service times for agricultural virus monitoring
• A MILP and a genetic algorithm for the flying sidekick TSP with variable drone speeds
• Dynamic optimization of multi-truck and multi-drone collaborative delivery for emergency material distribution

This page was built for publication: An exact solution method for the TSP with drone based on decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2026993)