A Flow-Dependent Secondary-Shortest Path Algorithm for Naval Ship Evacuation

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Honghua Tan

Pages:

1812-1816

DOI:

10.4028/www.scientific.net/AMM.66-68.1812

Citation:

C. Liu and C. H. Qiu, "A Flow-Dependent Secondary-Shortest Path Algorithm for Naval Ship Evacuation", Applied Mechanics and Materials, Vols. 66-68, pp. 1812-1816, 2011

Online since:

July 2011

Export:

Price:

$35.00

[1] Jos´e L. Santos: K shortest path algorithms, Department of Mathematics, University of Coimbra, August, (2006).

[2] International Maritime Organization, Interim Guidelines for Evacuation Analyses for New and Existing Passenger Ships, IMO MSC/Circ 1238, 30 October (2007).

[3] G. Rudgley, P. Boxal: Development of a NATO Naval Ship Code, (The Royal Institution of Naval Architects, London, UK 2005).

[4] Glen, I.F., and Galea, E.R.: Ship Evacuation Simulation: Challenges and Solutions, Annual Meeting Society of Naval Architects and Marine Engineers, Orlando, November (2001).

[5] Fletcher, R. and Sainz de la Maza, E. (1989): Nonlinear programming and nonsmooth optimization by successive linear programming. Mathematical Programming, 43(3): 235-256.

DOI: 10.1007/bf01582292

[6] F. Pérez-Villalonga: Dynamic escape routes for naval ships, Masters Thesis, Operations Research Department, Naval Postgraduate School (2005).

[7] E.Q. Martins. An algorithm for ranking paths that may contain cycles. European Journal of Operational Research, 18: 123–130, (1984).

DOI: 10.1016/0377-2217(84)90269-8

In order to see related information, you need to Login.