The r‐interdiction selective multi‐depot vehicle routing problem
From MaRDI portal
Publication:6067891
DOI10.1111/itor.12669OpenAlexW2942350322MaRDI QIDQ6067891
Necati Aras, Mir Ehsan Hesam Sadati, Deniz Aksen
Publication date: 17 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12669
Related Items (5)
A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection ⋮ An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ Modeling bluffing behavior in signaling security games ⋮ The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic ⋮ A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information
Cites Work
- A hybrid algorithm for a class of vehicle routing problems
- The budget constrained \(r\)-interdiction median problem with capacity expansion
- The multi-depot vehicle routing problem with inter-depot routes
- Future paths for integer programming and links to artificial intelligence
- Implicit depot assignments and rotations in vehicle routing heuristics
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- An Introduction to Tabu Search
- Shortest-path network interdiction
- The Mixed Integer Linear Bilevel Programming Problem
- Solution of a Large-Scale Traveling-Salesman Problem
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Computer Solutions of the Traveling Salesman Problem
- Removing Arcs from a Network
- Optimal interdiction of a supply network
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The r‐interdiction selective multi‐depot vehicle routing problem
