Spatial coverage in routing and path planning problems

DOI10.1016/j.ejor.2022.02.031OpenAlexW4213235338MaRDI QIDQ2083923

Anne Meyer, Katharina Glock

Publication date: 17 October 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.02.031

zbMATH Keywords

vehicle routing problemorienteering problemcovering tour probleminformative path planningclose-enough vehicle routing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

A three-stage stochastic optimization model integrating 5G technology and UAVs for disaster management

Cites Work

• Orienteering problem: a survey of recent variants, solution approaches and applications
• Time constrained maximal covering salesman problem with weighted demands and partial coverage
• Near-optimal continuous patrolling with teams of mobile information gathering agents
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
• A heuristic procedure for the capacitated \(m\)-ring-star problem
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
• The multi-vehicle probabilistic covering tour problem
• The bi-objective covering tour problem
• The median tour and maximal covering tour problems: Formulations and heuristics
• Approximation algorithms for the Geometric Covering Salesman Problem
• Variable neighborhood tabu search and its application to the median cycle problem.
• Solving the multi-vehicle multi-covering tour problem
• A novel discretization scheme for the close enough traveling salesman problem
• A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
• Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
• The multi-vehicle cumulative covering tour problem
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
• The set orienteering problem
• A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands
• The bi-objective stochastic covering tour problem
• The vehicle routing-allocation problem: A unifying framework
• Heuristics for the multi-vehicle covering tour problem
• Locating median cycles in networks
• A matheuristic for the distance-constrained close-enough arc routing problem
• On the distance-constrained close enough arc routing problem
• A biased random-key genetic algorithm for the set orienteering 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
• Informative path planning as a maximum traveling salesman problem with submodular rewards
• An efficient evolutionary algorithm for the ring star problem
• A unified solution framework for multi-attribute vehicle routing problems
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• Solving the close-enough arc routing problem
• The Generalized Covering Salesman Problem
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
• Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
• Optimal routing and process scheduling for a mobile service facility
• The Capacitated m-Ring-Star Problem
• Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
• A tabu search algorithm for the single vehicle routing allocation problem
• Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
• Efficient Informative Sensing using Multiple Robots
• The Covering Tour Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Approximation algorithms for TSP with neighborhoods in the plane
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• The stochastic close-enough arc routing problem
• Efficient heuristics for Median Cycle Problems
• The Covering Salesman Problem
• The travelling salesman problem with neighbourhoods: MINLP solution
• An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
• An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
• Clustered coverage orienteering problem of unmanned surface vehicles for water sampling
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spatial coverage in routing and path planning problems