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

DOI10.1002/NAV.22087MaRDI QIDQ6054751zbMATH OpenFDO

Authors Hong-Qi Li, Feilong Wang

Publication date 25 October 2023

Published in Naval Research Logistics (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) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup
• Parcel delivery cost minimization with time window constraints using trucks and drones
• Trucks and drones cooperation in the last‐mile delivery process
• Truck and drone routing problem with synchronization on arcs
• The truck–drone routing optimization problem: mathematical model and a VNS approach

Cites work

• A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
• A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
• Column Generation
• 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
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• The vehicle routing problem with drones: several worst-case results

Cited in

(8)

• Facility location decisions for drone delivery with riding: a literature review
• A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup
• A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone
• Truck and drone routing problem with synchronization on arcs
• Parcel delivery cost minimization with time window constraints using trucks and drones
• A new MILP formulation for the flying sidekick traveling salesman problem
• Last‐mile delivery with drone and lockers
• Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network

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

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