An Adaptive Variable Neighborhood Search for a Family of Set Covering Routing Problems with an Application in Disaster Relief Operations (opens in new tab)
This paper studies a variant of the Set Covering Routing Problem (SCRP) motivated by post-disaster humanitarian logistics. We consider a hybrid distribution concept in which the majority of transportation is performed by helicopters, while ground transport is limited to the last mile, addressing severe accessibility constraints in disaster-affected regions. The resulting problem integrates landing site location, routing, and covering decisions...
Read the original article