A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone

DOI10.1287/ijoc.2018.0826OpenAlexW2940865666WikidataQ127997537 ScholiaQ127997537MaRDI QIDQ5138267

Bruce L. Golden, Edward A. Wasil, Stefan Poikonen

Publication date: 3 December 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2018.0826

zbMATH Keywords

algorithmsvehicle routingtraveling salesmanbranch and boundinteger490 networks-graphs630 programming970 transportation

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (27)

The pickup and delivery problem with alternative locations and overlapping time windows ⋮ A survey of truck-drone routing problem: literature review and research prospects ⋮ Spatiotemporal Data Set for Out-of-Hospital Cardiac Arrests ⋮ Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions ⋮ The last-mile delivery process with trucks and drones under uncertain energy consumption ⋮ The min-cost parallel drone scheduling vehicle routing problem ⋮ A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips ⋮ A variable neighborhood search for parcel delivery by vehicle with drone cycles ⋮ Branch‐price‐and‐cut for the truck–drone routing problem with time windows ⋮ Modeling the flying sidekick traveling salesman problem with multiple drones ⋮ Parcel delivery cost minimization with time window constraints using trucks and drones ⋮ The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements ⋮ A multi-visit flexible-docking vehicle routing problem with drones for simultaneous pickup and delivery services ⋮ Exact models for the flying sidekick traveling salesman problem ⋮ The two‐echelon routing problem with truck and drones ⋮ Robust traveling salesman problem with drone: balancing risk and makespan in contactless delivery ⋮ Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery ⋮ A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone ⋮ The vehicle routing problem with drones and drone speed selection ⋮ A new MILP formulation for the flying sidekick traveling salesman problem ⋮ A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup ⋮ Last‐mile delivery with drone and lockers ⋮ The Mothership and Drone Routing Problem ⋮ Van-based robot hybrid pickup and delivery routing problem ⋮ Optimization in multimodal freight transportation problems: a survey ⋮ Multi-visit drone routing problem ⋮ A multi-objective humanitarian pickup and delivery vehicle routing problem with drones

Cites Work

• Unnamed Item
• The vehicle routing problem with drones: several worst-case results
• A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
• On a routing problem
• The vehicle routing problem with drones: Extended models and connections

This page was built for publication: A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone