Fırat Kılcı Bahar Yetiş Kara, Burçin Bozkaya Locating Temporary Shelter Areas after a Large-Scale Disaster 1.

Slides:



Advertisements
Similar presentations
1 Alberto Montanari University of Bologna Basic Principles of Water Resources Management.
Advertisements

Design of the fast-pick area Based on Bartholdi & Hackman, Chpt. 7.
Linear Programming Problem
Waikiki Tsunami Preparedness Major Trisha Cobb, USA LT Hamadi Bouaicha, Tunisia Navy OA 4202 Team Project Network Flows and Graphs.
1 Lecture 3 MGMT 650 Sensitivity Analysis in LP Chapter 3.
An Exact Algorithm for the Vehicle Routing Problem with Backhauls
DOMinant workshop, Molde, September 20-22, 2009
ORGAN TRANSPLANTATION LOGISTICS CASE FOR TURKEY By Pelin Cay. Academic Advisor: Assoc. Prof. Bahar Y. Kara 6/29/2012.
Modeling Rich Vehicle Routing Problems TIEJ601 Postgraduate Seminar Tuukka Puranen October 19 th 2009.
Department of Geography and Urban Studies, Temple University GUS 0265/0465 Applications in GIS/Geographic Data Analysis Lecture 4: Network Operations.
Managerial Decision Modeling with Spreadsheets
EMIS 8373: Integer Programming Valid Inequalities updated 4April 2011.
Vehicle Routing & Scheduling: Part 1
Transit Vehicle Routing Methods for Large-Scale Evacuation Mark Hickman and Moshe Dror University of Arizona INFORMS November 15, 2011.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Integer Programming.
The Min-Max Split Delivery Multi- Depot Vehicle Routing Problem with Minimum Delivery Amounts X. Wang, B. Golden, and E. Wasil INFORMS San Francisco November.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Agenda Overview Why TransCAD Challenges/tips Initiatives Applications.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
Dynamic lot sizing and tool management in automated manufacturing systems M. Selim Aktürk, Siraceddin Önen presented by Zümbül Bulut.
Lec 20, Ch.11: Transportation Planning Process (objectives)
Linear Programming OPIM 310-Lecture 2 Instructor: Jose Cruz.
An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results Mark S. Daskin, Collete R. Coullard and Zuo-Jun Max Shen presented.
Network Flow Models Chapter 7.
Airline Schedule Optimization (Fleet Assignment II) Saba Neyshabouri.
Introduction to Management Science
Optimal Design of Timetables to maximize schedule reliability and minimize energy consumption, rolling stock and crew deployment.
Linear Programming Models: Graphical and Computer Methods
7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
7-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Network Models (2) Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
HAZUS-MH is a multi-hazard risk assessment and loss estimation software program developed by the Federal Emergency Management Agency (FEMA). (animate on.
Solving the Concave Cost Supply Scheduling Problem Xia Wang, Univ. of Maryland Bruce Golden, Univ. of Maryland Edward Wasil, American Univ. Presented at.
The Min-Max Multi-Depot Vehicle Routing Problem: Three-Stage Heuristic and Computational Results X. Wang, B. Golden, and E. Wasil INFORMS Minneapolis October,
Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.
Urban Planning for Safer Cities Jibgar Joshi. Principles Urban Planning for Safer Cities should consider the risks and threats due to probable natural.
New Modeling Techniques for the Global Routing Problem Anthony Vannelli Department of Electrical and Computer Engineering University of Waterloo Waterloo,
Hospital Cardio Vascular people People with serious Respiratory problem Acute Care Center(ACC) People with Respiratory problems Cooling Center People who.
A performance evaluation approach openModeller: A Framework for species distribution Modelling.
Network-Based Optimization Models Charles E. Noon, Ph.D. The University of Tennessee.
Location decisions are strategic decisions. The reasons for location decisions Growth –Expand existing facilities –Add new facilities Production Cost.
3 Characteristics of an Optimization Problem General descriptionKPiller Illustration Decisions that must be made; represented by decision variables How.
© J. Christopher Beck Lecture 25: Workforce Scheduling 3.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
1 Iterative Integer Programming Formulation for Robust Resource Allocation in Dynamic Real-Time Systems Sethavidh Gertphol and Viktor K. Prasanna University.
Let us consider one producer P and four customers, which are supplied each day with one item of product each. Customers can be supplied only by trucks.
A comparison of multi-objective spatial dispersion models for managing critical assets in urban areas A comparison of multi-objective spatial dispersion.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
8/14/04 J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 6 – Integer Programming Models Topics.
Professor: Chu, Ta Chung Student: Nguyen Quang Tung 徐啟斌.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
Distribution Manager Supply Chain Man. (SCM), “Logistics” Transport Plans (Production Plans) Facility Location f.ex. warehouses Network Models: Minimal.
Management Science 461 Lecture 3 – Covering Models September 23, 2008.
Rough-Cut Capacity Planning in SCM EIN 5346 Logistics Engineering Fall, 2015.
Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.
MCCARL AND SPREEN TEXT CH. 2 T Y/MCCARL-BRUCE/BOOKS.HTM Lecture 2: Basic LP Formulation.
1 TCOM 5143 Lecture 10 Centralized Networks: Time Delay and Cost Tradeoffs.
Balanced Billing Cycles and Vehicle Routing of Meter Readers by Chris Groër, Bruce Golden, Edward Wasil University of Maryland, College Park American University,
Rough-Cut Capacity Planning in SCM Theories & Concepts
Applications of Tabu Search OPIM 950 Gary Chen 9/29/03.
Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.
An Efficient P-center Algorithm
Rough-Cut Capacity Planning in SCM Theories & Concepts
Si Chen, University of Maryland Bruce Golden, University of Maryland
GIS Day Site Layout Optimization Using GIS Sulyn Gomez Mohd Samrah
Strategic Problems: Location
148 Transitional shelter This workshop discusses when to use transitional shelter, the common circumstances for using it, and its strengths, characteristics.
Maximum Flow Neil Tang 4/8/2008
Presentation transcript:

Fırat Kılcı Bahar Yetiş Kara, Burçin Bozkaya Locating Temporary Shelter Areas after a Large-Scale Disaster 1

Disasters in Turkey Type of Disaster# of households destroyedPercentage (%) Earthquake Landslide Flood Rock Fall Avalanche Source: Ozmen et al. (2005) 2

Shelter Areas After a disaster, homeless people stay in shelter areas. 3 Sphere Project: Started in 1997 by several humanitarian organizations and IFRC Defines standards and some quality measurements for humanitarian operations. For temporary settlements, Must plan settlement areas, access to those areas and routes to public facilities. These areas should be far from threat zones. Must provide enough supply of tents, shelter kits, construction kits and cash. Must provide adequate space to everyone to live Must provide necessary utilities to achieve best thermal conditions.

Turkish Red Crescent In Turkey, TRC is the main authority for identifying the shelter area locations. First they identify the candidate locations. Each candidate location has a weight w.r.t. some criteria Sort w.r.t. these weights and open facilities one by one until there is enough space for all the population. 4

Turkish Red Crescent Criteria: Transportation of relief items Procurement of relief items Healthcare institutions Structure and type of the terrain Slope of the terrain Flora of the terrain Electrical infrastructure Sewage infrastructure Permission to use 5

Turkish Red Crescent No population – shelter area assignment No consideration of shelter area utilization Distances between population and shelter area ignored 6

Problem Definition Develop a methodology that decides on the locations of the shelter areas assignment of population points to shelter areas considers utilization of shelter areas considers distances between shelter areas and the affected population. 7

Mathematical Model 8 TRC Criteria: Transportation of relief items Procurement of relief items Healthcare institutions Structure and type of the terrain Slope of the terrain Flora of the terrain Electrical infrastructure Sewage infrastructure Permission to use Weight function Data created using GIS

Mathematical Model Maximize the minimum weight of operating areas. Minimize total distance from the shelter areas to nearest main roads and health facilities. Maximize the total utilization of open shelter areas. Minimize the maximum pairwise utilization difference of open shelter areas. Subject to; Assign all districts to an area Respect capacity of shelter areas Calculate utilization 9

10 Threshold values DistHealth: max. allowable shelter area – health facility distance DistRoad: max. allowable shelter area – main road distance β : threshold value for minimum utilization of open shelter areas α : threshold value for pairwise utilization difference of open shelter areas

Mathematical Model 11 The population needs to be converted into “demand” demand j = population j × percentAffected × livingSpace percentAffected: percentage of population that is assumed to live in the shelter areas livingSpace: assigned living space per person population j : the number of people living in district j

Mathematical Model Sets I: set of candidate locations J: set of districts Parameters w i : weight of candidate location i, between 0 and 1. d i health : distance b/w candidate location i and nearest health bldg. d i road : distance between candidate location i and nearest main road demand j : total demand of the area j (in m 2 ) cap i : capacity of candidate location i (in m 2 ) dist ij : distance between candidate location i and demand point j utilSpace: assigned space for utilities per shelter area 12

Mathematical Model 13 Decision Variables: x i : 1 if candidate location i is chosen, 0 otherwise. y ij : 1 if district j is assigned to location i, 0 otherwise. u i : utilization of candidate location i

Mathematical Model 14

Mathematical Model

Constraints (Capacity and Assignment) 16

Constraints (Utilization) 17

Objective Functions 18

Objective Functions 19

Selecting the Best Objective Select one objective function for the model Introduce other five objectives as constraints Choose O1 as primary objective 20

(O2) and (O3) 21

(O4) 22

(O5) 23

(O6) 24

(O1) Revisited 25

Mathematical Model

Maximize the minimum weight of operating shelter areas Capacity Assignment Utilization To maximize the total utilization shelter areas. To minimize the maximum pairwise utilization differences

To minimize total distance from the shelter areas to nearest main roads and health facilities. Nearest assignment constraints

Computational Study Model is tested on a sample data on Kartal, Istanbul. 25 potential shelter areas 20 districts 29

Computational Study 30

Results 31 Generated 3000 instances by varying DistHealth, DistRoad, β, and α. Solved using Gurobi integrated with DSS The objective value decreases as β is increased and α, DistHealth and DistRoad are decreased. This is expected as these changes tighten the feasible set.

Decision Support System An ArcGIS extension that utilizes Gurobi and developed in C# The user Can solve the mathematical model Edit the solution Save the current solution Compare up to 4 solutions Visualize the current solution Graph the shelter area utilizations See the lists of assignments 32

Decision Support System 5 layers needed: Location of districts with population data in its data table Location of candidate shelter areas with has weight and capacity data in its data table A layer that contains the hospitals A layer that contains the main road junctions A “Network Dataset” that contains the road network 33

Decision Support System 34

Decision Support System 35

Decision Support System 36

Conclusion In this study, a mathematical model to capture the requirements of TRC is formulated To implement the mathematical model, a decision support system via GIS is developed Tested with TRC personnel. 37

Related Literature Healthcare/Blood Logistics: Bloodmobiles Brennan et al. (1992) Alfonso et al. (2012) Doerner and Hartl (2002) Mobile healthcare facilities Hodgson et al. (1998) Doerner et al. (2007) Şahin et al. (2007) Selective VRP (a.k.a Team Orienteering Problem): Chao et al. (1996) Feillet et al. (2005) Vansteenwegen et al. (2011) Jozefowiez et al. (2008) Aksen and Aras (2005) Archetti et al. (2009) 38

Related Literature Decisions to be made simultaneously: Stops of the bloodmobiles, (Selective VRP) Length of the stay in a stop, (Time exp.) Tours of the bloodmobiles, Tours of the shuttle.  No study covers these issues simultaneously. 39 (Integrated Tours)