Abstract

Considering the uncertainty of urban emergency rescue time, it is difficult for emergency vehicles to maintain a 100% service level continuously. The biggest challenge is to minimize driving distance and costs when the number of vehicles available for deployment is uncertain. In this study, considering the limitation of emergency vehicles, a new integrated emergency vehicle scheduling model for large-scale urban emergency rescue was developed, which is able to tackle multiple emergency tasks at the same time, achieving the shortest path and the lowest cost. Then, the emergency scheduling was simulated in seven urban areas of H City in China to verify the applicability of the proposed model, during which a fast non-dominated sorting multi-objective genetic algorithm with elite strategy was used to solve this model. Moreover, the corresponding algorithm test was conducted to verify the feasibility of the Pareto solution and demonstrate its effectiveness. Moreover, the simulation results show that the used algorithm can reduce computing time by 14.27%, compared with the genetic algorithm. Finally, the optimal scheduling scheme was selected according to the decision-makers’ preferences. This study solved various emergency vehicle scheduling problems under uncertain emergency times, which was beneficial for multilateral cooperation emergency scheduling and provided decision support for emergency command departments for choosing the best emergency scheme.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.