A multi‐vehicle covering tour problem with speed optimization

DOI10.1002/net.22041zbMath1528.90059arXiv1909.12435OpenAlexW3162298321MaRDI QIDQ6065856

Joshua T. Margolis, Scott J. Mason, Yongjia Song

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.12435

zbMATH Keywords

vehicle routingheuristicspeed optimizationbranch-and-price algorithmcovering tourlabeling agorithmtarget surveillance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Cooperative control and optimization
• Approximation algorithms for the Geometric Covering Salesman Problem
• The time constrained maximal covering salesman problem
• The bi-objective stochastic covering tour problem
• Heuristics for the multi-vehicle covering tour problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
• Priority-based assignment and routing of a fleet of unmanned combat aerial vehicles
• Formulations and exact algorithms for the vehicle routing problem with time windows
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• Solving the close-enough arc routing problem
• The Generalized Covering Salesman Problem
• On the optimal detection of an underwater intruder in a channel using unmanned underwater vehicles
• State-of-the Art Review—Evolutionary Algorithms for Vehicle Routing
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
• A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Approximation results for min-max path cover problems in vehicle routing
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• Aircraft routing under the risk of detection
• What you should know about the vehicle routing problem
• Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
• The Covering Tour Problem
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
• Approximation algorithms for TSP with neighborhoods in the plane
• Controlling a Fleet of Unmanned Aerial Vehicles to Collect Uncertain Information in a Threat Environment
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• The Covering Salesman Problem
• Discrete-Variable Extremum Problems
• Vehicle Routing Problem with Time Windows