Exact methods for the Selective Assessment Routing Problem
Open Access
- 15 October 2024
- journal article
- research article
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 34 (1) , 95-123
Abstract
The Selective Assessment Routing Problem (SARP) is a problem in humanitarian logistics addressing the site selection and routing decisions of rapid needs assessment teams which aim to evaluate the post-disaster conditions of different community groups, each carrying a distinct characteristic. The aim is to construct an assessment plan that maximizes the covering of different characteristics in a balanced way. We explore exact approaches based on mixed integer linear programming. Different mathematical formulations are presented, and theoretical results regarding their strengths are derived. The models are experimentally evaluated on a set of test instances including a real-world scenario.Keywords
Funding Information
- TU Wien
This publication has 13 references indexed in Scilit:
- A unifying framework for selective routing problemsEuropean Journal of Operational Research, 2024
- A lexicographic maximin approach to the selective assessment routing problemOR Spectrum, 2022
- A multi-cover routing problem for planning rapid needs assessment under different information-sharing settingsOR Spectrum, 2019
- Site selection and vehicle routing for post-disaster rapid needs assessmentTransportation Research Part E: Logistics and Transportation Review, 2017
- The vehicle routing problem: State of the art classification and reviewComputers & Industrial Engineering, 2016
- Chapter 10: Vehicle Routing Problems with Profits2014
- Selective vehicle routing problems under uncertainty without recourseTransportation Research Part E: Logistics and Transportation Review, 2014
- An exact algorithm for team orienteering problems4OR, 2006
- A heuristic for the multiple tour maximum collection problemComputers & Operations Research, 1994
- The orienteering problemNaval Research Logistics (NRL), 1987