.png){kind=icon}
.png){kind=icon}
Return
Ripple spreading algorithm: a new method for solving multi-objective shortest path problems with mixed time windows
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-023-01260-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In emergency management, the transportation scheduling of emergency supplies and relief personnel can be regarded as the multi-objective shortest path problem with mixed time window (MOSPPMTW), which has high requirements for timeliness and effectiveness, but the current solution algorithms cannot simultaneously take into account the solution accuracy and computational speed, which is very unfavorable for emergency path decision-making. In this paper, we establish MOSPPMTW matching emergency rescue scenarios, which simultaneously enables the supplies and rescuers to arrive at the emergency scene as soon as possible in the shortest time and at the smallest cost. To solve the complete Pareto optimal surface, we present a ripple spreading algorithm (RSA), which determines the complete Pareto frontier by performing a ripple relay race to obtain the set of Pareto optimal path solutions. The proposed RSA algorithm does not require an initial solution and iterative iterations and only needs to be run once to obtain the solution set. Furthermore, we prove the optimality and time complexity of RSA and conduct multiple sets of example simulation experiments. Compared with other algorithms, RSA performs better in terms of computational speed and solution quality. The advantage is especially more obvious in the computation of large-scale problems. It is applicable to various emergency disaster relief scenarios and can meet the requirements of fast response and timeliness.
Keywords:
Emergency rescue
Ripple spreading algorithm
Mixed time windows
Multi-objective shortest path problem
Pareto optimal paths
Journal
IF:
4.6
Papers:
2.1K
Citations:
6.6K