Compromising system and user interests in shelter location and evacuation planning
Transportation Research Part B: Methodological
146 - 163
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/22614
Traffic management during an evacuation and the decision of where to locate the shelters are of critical importance to the performance of an evacuation plan. From the evacuation management authority's point of view, the desirable goal is to minimize the total evacuation time by computing a system optimum (SO). However, evacuees may not be willing to take long routes enforced on them by a SO solution; but they may consent to taking routes with lengths not longer than the shortest path to the nearest shelter site by more than a tolerable factor. We develop a model that optimally locates shelters and assigns evacuees to the nearest shelter sites by assigning them to shortest paths, shortest and nearest with a given degree of tolerance, so that the total evacuation time is minimized. As the travel time on a road segment is often modeled as a nonlinear function of the flow on the segment, the resulting model is a nonlinear mixed integer programming model. We develop a solution method that can handle practical size problems using second order cone programming techniques. Using our model, we investigate the importance of the number and locations of shelter sites and the trade-off between efficiency and fairness. © 2014 Elsevier Ltd.
Showing items related by title, author, creator and subject.
Sengezer, N.; Karasan, E. (2007)We propose an online traffic engineering (TE) scheme for efficient routing of bandwidth guaranteed connections on a Multiprotocol label switching (MPLS)/wavelength division multiplexing (WDM) network with a traffic pattern ...
Akar, N.; Hokelek I.; Atik, M.; Karasan, E. (Institute of Electrical and Electronics Engineers Inc., 2003)We propose a novel traffic engineering architecture for IP networks with multiprotocol label switching (MPLS) backbones. In this architecture, two (primary and secondary) label switched paths (LSPs) are established among ...
Learning traffic congestion by contextual bandit problems for optimum localization [En İyi Konumlandirma için Baǧlamsal Haydut Problemleri ile Trafik Yoǧunluǧunu Öǧrenme] Sahin U.; Yucesoy V.; Koc A.; Tekin C. (Institute of Electrical and Electronics Engineers Inc., 2017)Optimum localization problem, which has a wide range of application areas in real life such as emergency services, command and control systems, warehouse localization, shipment planning, aims to find the best location to ...