Exact methods for the Selective Assessment Routing Problem

Joan Salvà Soler; Vera C. Hemmelmayr; Günther R. Raidl

doi:10.1007/s10100-024-00943-y

Exact methods for the Selective Assessment Routing Problem

Joan Salvà Soler, Vera C. Hemmelmayr, Günther R. Raidl

Institute for Transport and Logistics Management

Publication: Scientific journal › Journal article › peer-review

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.

Original language	German
Journal	Central European Journal of Operations Research
DOIs	https://doi.org/10.1007/s10100-024-00943-y
Publication status	E-pub ahead of print - 2024

Access to Document

10.1007/s10100-024-00943-yLicence: CC BY

Check availability

University Library Catalogue

Cite this

@article{7e3bc29bcd83468982c9c280249e932f,

title = "Exact methods for the Selective Assessment Routing Problem",

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.",

author = "{Salv{\`a} Soler}, Joan and Hemmelmayr, {Vera C.} and Raidl, {G{\"u}nther R.}",

year = "2024",

doi = "10.1007/s10100-024-00943-y",

language = "Deutsch",

journal = "Central European Journal of Operations Research",

issn = "1613-9178",

publisher = "Springer",

}

TY - JOUR

T1 - Exact methods for the Selective Assessment Routing Problem

AU - Salvà Soler, Joan

AU - Hemmelmayr, Vera C.

AU - Raidl, Günther R.

PY - 2024

Y1 - 2024

N2 - 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.

AB - 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.

U2 - 10.1007/s10100-024-00943-y

DO - 10.1007/s10100-024-00943-y

M3 - Originalbeitrag in Fachzeitschrift

SN - 1613-9178

JO - Central European Journal of Operations Research

JF - Central European Journal of Operations Research

ER -