By Topic

Evacuation route scheduling using discrete time-based Capacity-Constrained model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Saeed Osman, M.F. ; Dept. of Syst. Eng., King Fahd Univ. of Pet. & Miner., Dhahran, Saudi Arabia ; Ram, B.

This paper addresses the problem of modeling evacuation scheduling out of an affected area. There are a pre-defined set of exit points out of the target affected area and a set of source points for the evacuees. We propose an optimization model for evacuation scheduling; this approach models the capacity-constrained evacuation scheduling problem over discrete time as an integer optimization model. A recent efficient heuristic for evacuation planning, Capacity-Constrained Route Planning (CCRP) algorithm is selected as a reference for comparison. The result on a sample problem shows that the proposed model is competitive with the CCRP heuristic in terms of the resulting evacuation time and evacuation routes and schedules.

Published in:

Industrial Engineering and Engineering Management (IEEM), 2011 IEEE International Conference on

Date of Conference:

6-9 Dec. 2011