共 50 条
A decomposition-based heuristic for a multicrew coordinated road restoration problem
被引:20
作者:
Akbari, Vahid
[1
]
Sadati, Mir Ehsan Hesam
[2
,3
]
Kian, Ramez
[4
]
机构:
[1] Univ Nottingham, Nottingham Univ Business Sch, Jubilee Campus, Nottingham NG8 1BB, England
[2] Sabanci Univ, Fac Engn & Nat Sci, Istanbul, Turkey
[3] Sabanci Univ, Smart Mobil & Logist Lab, Istanbul, Turkey
[4] Nottingham Trent Univ, Nottingham Business Sch, Nottingham NG1 4FQ, England
关键词:
Disaster management;
Humanitarian logistics;
Road restoration;
Network connectivity;
Heuristics;
Relief distribution;
ROUTING PROBLEM;
REPAIR CREW;
ALGORITHM;
ACCESSIBILITY;
CONNECTIVITY;
EMERGENCY;
MODEL;
D O I:
10.1016/j.trd.2021.102854
中图分类号:
X [环境科学、安全科学];
学科分类号:
08 ;
0830 ;
摘要:
Natural disasters disrupt the connectivity of road networks by blocking road segments, which impedes efficient distribution of relief materials to the affected area. We study the problem of finding coordinated paths for clearing teams so that the connectivity of the road network is regained in the shortest time. We provide an efficient novel heuristic algorithm for this problem. In our algorithm, the problem is first pre-processed to define a binary problem to generate initial solutions, and then several rich and problem-specific neighborhood search moves are applied to improve the derived initial solutions. We provide several analytical results which facilitate the design of our algorithm. The performance of our proposed algorithm is assessed by different numerical experiments, and a comparison with existing algorithms from the literature using instances from Istanbul road networks. The results demonstrate that our algorithm performs notably better, both in terms of speed, and proximity to optimal solution.
引用
收藏
页数:19
相关论文
共 50 条