Abstract

The characteristics of railway dangerous goods accidents are very complex. The rescue of railway dangerous goods accidents should consider the timeliness of rescue, the uncertainty of traffic environment and the diversity of rescue resources. Thus, the purpose of this paper is to confront the rescue resources scheduling problem of railway dangerous goods accident by considering factors such as rescue capacity, rescue demand and response time. Based on the analysis of travel time and reliability for rescue route, a multi-objective scheduling model of rescue resources based on travel time reliability is constructed in order to minimize the total arrival time of rescue resources and to maximize total reliability. The proposed model is more reliable than the traditional model due to the consideration of travel time reliability of rescue routes. Moreover, a two-stage algorithm is designed to solve this problem. A multi-path algorithm with bound constraints is used to obtain the set of feasible rescue routes in the first stage, and the NSGA-II algorithm is used to determine the scheduling of rescue resources for each rescue center. Finally, the two-stage algorithm is tested on a regional road network, and the results show that the designed two-stage algorithm is valid for solving the rescue resource scheduling problem of dangerous goods accidents and is able to obtain the rescue resource scheduling scheme in a short period of time.

Highlights

  • Dangerous goods include the substances and articles the carriage of which is prohibited by the Regulation Concerning the International Carriage of Dangerous Goods by Rail (RID) or authorized only under the conditions prescribed therein [1]

  • According to the travel characteristics of dangerous goods accident rescue, the travel time reliability of a rescue route is the probability that the rescue vehicle can reach the accident location within the maximum tolerable time, which can be expressed as follows

  • According to the above analysis, by considering the factors such as the rescue capacity, rescue demand and response time, the multi-objective scheduling model of rescue resources based on travel time reliability is constructed in order to minimize the total arrival time of rescue resources and to maximize total reliability

Read more

Summary

Introduction

Dangerous goods include the substances and articles the carriage of which is prohibited by the Regulation Concerning the International Carriage of Dangerous Goods by Rail (RID) or authorized only under the conditions prescribed therein [1]. Wu and Xiang [22] constructed a capacitated vehicle routing problem model suitable for emergency resource scheduling process and designed a simulated annealing-genetic algorithm (SA-GA). Many of the models developed for emergency resources scheduling are deterministic and had the minimization of travel time as one of the objectives; they ignored the rescue routing problem. Penna et al [34] proposed a generic hybrid heuristic framework to solve the vehicle routing problem after a natural disaster All these related investigations have given us much inspiration when studying the rescue resource scheduling problem. Set of rIenscdueexroouf tleinsIkbnsed,tewxeemoenfn inretEescr,sueemctci,eomnnts e,rVvr∈,amnVd anccident location s Set of intersections

Pavrameters
Analysis of Travel Time and Reliability
Link Travel Time and Intersection Delay
Travel Time of a Rescue Route
Route travel-time reliability
The objective function
The multi-objective rescue resource scheduling model
Solution Algorithms
Obtaining the Set of Feasible Routes
Determination of the boundary constraint
Multi-path algorithm
Determining Rescue Route and Rescue Resource Supply
Crossover Operator
ENir 5
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call