Abstract
In this paper, we introduce a secondary evacuation planning problem which is solved by computing flow-dependent shortest path through a known shortest time escape route on a ship. Given a primary escape route, our secondary evacuation planning problem consists in finding the second-shortest escape route, based on the cabin network rebuilding. We suggest a new model for flow-dependent network where the travel time of each link depends on the flow speed and the flow speed depends on the total number of evacuees traversing the link. The model focused on the average evacuation time to travel through the ordered sequence of consecutive arcs by each group, and we proposed a heuristic algorithm to produce sub-optimal secondary evacuation plan. A numerical example is given at last. Results showing that our algorithm can effective supply the flow-dependent network k-shortest path need in reasonable computation times.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
