The orienteering problem with heterogeneous drones

DOI10.1002/NET.70050MaRDI QIDQ7346560zbMATH OpenFDO

Authors Chun Cheng, Zixiang Yu, Lina Yu, Qinxiao Yu

Publication date 11 September 2026

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NET.70050

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Mixed integer programming (90C11)

Cites work

• A branch-and-price algorithm for robust drone-vehicle routing problem with time windows
• A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows
• A competitive heuristic algorithm for vehicle routing problems with drones
• A probabilistic heuristic for a computationally difficult set covering problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
• Clustered coverage orienteering problem of unmanned surface vehicles for water sampling
• Compact formulations of the Steiner traveling salesman problem and related problems
• Drone location and vehicle fleet planning with trucks and aerial drones
• Integer Programming Formulation of Traveling Salesman Problems
• Multi-visit drone routing problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Team Orienteering with Time-Varying Profit
• The min-cost parallel drone scheduling vehicle routing problem
• The orienteering problem
• The Orienteering Problem with Time Windows
• The team orienteering problem
• The two‐echelon routing problem with truck and drones

This page was built for publication: The orienteering problem with heterogeneous drones

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