Branch‐price‐and‐cut for the truck–drone routing problem with time windows

DOI10.1002/nav.22087zbMath1525.90064MaRDI QIDQ6054751

Hong-Qi Li, Feilong Wang

Publication date: 25 October 2023

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

zbMATH Keywords

routingtime windowbranch-price-and-cuttruck-drone combination

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Cites Work

• The vehicle routing problem with drones: several worst-case results
• Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
• A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
• Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: a review
• Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
• Column Generation
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints

This page was built for publication: Branch‐price‐and‐cut for the truck–drone routing problem with time windows