Abstract

For the wounded triage, transport and cooperative scheduling problem of emergency surgery in urban emergency rescue, this study uses the idea of supply chain collaborative scheduling, considers factors such as the number of the wounded, rescue vehicle capacity and hospital operation time to achieve the optimization goals of the shortest rescue response time and the most economical transportation capacity, establishes a mixed integer programming model, and designs a two-stage scheduling algorithm to solve the model. It uses the relative gap between the maximum time span of the entire rescue process and the optimal performance under ideal conditions to measure the performance of the algorithm. The simulation experiments show that the two-stage scheduling algorithm has better problem-solving ability for scenarios with larger number of the wounded and stronger carrying capacity, and has better performance than MFF algorithm and MBF algorithm.

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.