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

DOI10.1016/j.cor.2020.105127OpenAlexW3097153424MaRDI QIDQ2026993

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

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

vehicle routingtraveling salesmandronesbenders' decomposition

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (7)

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 ⋮ Optimal and heuristic algorithms for the multi-objective vehicle routing problem with drones for military surveillance operations ⋮ 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

Cites Work

• A note on the prize collecting traveling salesman problem
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Partitioning procedures for solving mixed-variables programming problems
• The Benders decomposition algorithm: a literature review
• 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

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