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.
Influenced by external factors, the speed of vehicles in the traffic network is changing all the time, which makes the traditional static shortest route unable to meet the real logistics distribution needs. Considering that the existing research on time-dependent shortest path problems (TDSPP) do not include the topological information of the traffic network, it is unable to reflect the spatial and temporal dynamic characteristics of the traffic network during the vehicle travelling process and is unable to update to the changes of the vehicle speed in real time, and poor scalability. Therefore, we used the structural RNN (SRNN) model containing topological information of the road network is used to predict time-varying speeds in the traffic road network. We proposed an SRNN-RSA framework for solving the TDSPP problem, which achieves a synergistic evolution between the real-time vehicle speed change process and the RSA solving process, and the scalability of the proposed SRNN-RSA is demonstrated and validated using different real data. Compared with other algorithms, the results show that SRNN-RSA has the lowest error with the actual situation, which can balance the solution accuracy and calculation speed and is more consistent with the real traffic road network, with better stability and expandability.