Develops an AVNS heuristic for an integrated set covering routing problem combining landing site selection, multi-vehicle routing and demand covering in a multi-depot capacitated setting, with tests on m-CTP/VRDAP benchmarks and a 2024 Afghanistan flood case.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Adaptive Variable Neighborhood Search for a Family of Set Covering Routing Problems with an Application in Disaster Relief Operations
Develops an AVNS heuristic for an integrated set covering routing problem combining landing site selection, multi-vehicle routing and demand covering in a multi-depot capacitated setting, with tests on m-CTP/VRDAP benchmarks and a 2024 Afghanistan flood case.