A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings
DOI10.1007/S00291-019-00563-YzbMATH Open1437.90032OpenAlexW2980205153WikidataQ127099406 ScholiaQ127099406MaRDI QIDQ2178909FDOQ2178909
Authors: Duygu Pamukcu, Burcu Balcik 
Publication date: 11 May 2020
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-019-00563-y
Recommendations
- A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty
- Multi-vehicle prize collecting arc routing for connectivity problem
- Decision making on post-disaster rescue routing problems from the rescue efficiency perspective
- Vehicle routing and resource distribution in postdisaster humanitarian relief operations
- A bi-objective metaheuristic for disaster relief operation planning
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- Integer Programming Formulation of Traveling Salesman Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
- A fast approximation algorithm for the multicovering problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- George Dantzig's contributions to integer programming
- The traveling salesman problem: An overview of exact and approximate algorithms
- The team orienteering problem
- Vehicle Routing
- Models, solutions and enabling technologies in humanitarian logistics
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Location Based Heuristic for General Routing Problems
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
- A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
- Glider routing and trajectory optimisation in disaster assessment
Cited In (4)
- A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty
- A predictive multistage postdisaster damage assessment framework for drone routing
- The role of drones in disaster response: a literature review of operations research applications
- A lexicographic maximin approach to the selective assessment routing problem
Uses Software
This page was built for publication: A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178909)
