A Markov decision process model on dynamic routing for target surveillance
From MaRDI portal
Publication:2669763
DOI10.1016/J.COR.2022.105699OpenAlexW4206498615MaRDI QIDQ2669763
Scott J. Mason, Joshua T. Margolis, Yongjia Song
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105699
Cites Work
- Unnamed Item
- A survey of recent research on location-routing problems
- The orienteering problem: a survey
- A theory of rolling horizon decision making
- Location-routing: issues, models and methods
- Stochastic vehicle routing
- Combined location-routing problems: A synthesis and future research directions
- Heuristics for the multi-vehicle covering tour problem
- A review of dynamic vehicle routing problems
- A survey of network interdiction models and algorithms
- Diversion Issues in Real-Time Vehicle Dispatching
- Solving the close-enough arc routing problem
- A Graph Patrol Problem with Random Attack Times
- Patrolling Games
- A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
- An Algorithm for Deploying a Crime Directed (Tactical) Patrol Force
- The Covering Tour Problem
- Error Detecting and Error Correcting Codes
- Optimal patrol to uncover threats in time when detection is imperfect
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
This page was built for publication: A Markov decision process model on dynamic routing for target surveillance
