Abstract
The sink location problem is a combination of network flow and location problems: from a given set of nodes in a flow network a minimum cost subset W has to be selected such that given supplies can be transported to the nodes in W. In contrast to its counterpart, the source location problem which has already been studied in the literature, sinks have, in general, a limited capacity. Sink location has a decisive application in evacuation planning, where the supplies correspond to the number of evacuees and the sinks to emergency shelters. We classify sink location problems according to capacities on shelter nodes, simultaneous or non-simultaneous flows, and single or multiple assignments of evacuee groups to shelters. Resulting combinations are interpreted in the evacuation context and analyzed with respect to their worst-case complexity status. A mixed integer programming formulation is given which is shown to have the integrality property. Generic solution methods for uncapacitated problems are based on source location and modifications of the network. In the capacitated case, for which source location cannot be applied, we suggest alternative approaches which work in the original network. It turns out that latter class algorithms are superior to the former ones. This is established in numerical tests including random data as well as real-world data from the city of Kaiserslautern, Germany.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andreev K, Garrod C, Golovin D, Maggs B, Meyerson A (2009) Simultaneous source location. ACM Trans Algorithms 6(1):16:1–16:17
Arata K, Iwata S, Makino K, Fujishige S (2000) Locating sources to meet flow demands in undirected networks. In: Halldórsson MM (ed) Algorithm theory—SWAT 2000. Lecture notes in computer science, vol 1851, pp 300–313
Fujishige S, Kamiyama N (2012) The root location problem for arc-disjoint arborescences. Discret Appl Math 160(13–14):1964–1970
Goerigk M, Deghdak K, Heßler P (2014) A comprehensive evacuation planning model and genetic solution algorithm. Transp Res Part E Logist Transp Rev 71:82–97
Gomory RE, Hu TC (1961) Multi-terminal network flows. J Soc Ind Appl Math 9(4):551–570
Hamacher HW, Tjandra SA (2002) Mathematical modelling of evacuation problems—a state of art. In: Schreckenberg M, Sharma SD (eds) Pedestrian and evacuation dynamics, pp 227–266
Heßler P (2016) Sink location and evacuation planning. PhD thesis, University of Kaiserslautern, Germany (Forthcoming)
Johnson D, Garey M (1978) “Strong” and implications. J ACM 25(3):499–508
Johnson D, Demers A, Ullman J, Garey M, Graham R (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3(4):299–325
Kissel L (2012) Sink location in networks and application to shelter planning. Diploma thesis, University of Kaiserslautern, Germany
Kongsomsaksakul S, Yang C, Chen A (2005) Shelter location-allocation model for flood evacuation planning. J East Asia Soc Transp Stud 6:4237–4252
Mamada S, Uno T, Makino K, Fujishige S (2006) An \({{\cal O}}(nlog^{2}n)\) algorithm for the optimal sink location problem in dynamic tree networks. Discret Appl Math 154(16):2387–2401
Ng M, Park J, Waller ST (2010) A hybrid bilevel model for the optimal shelter assignment in emergency evacuations. Comput-Aided Civ Instrastruct Eng 25(8):547–556
Prüfer H (1918) Neuer Beweis eines Satzes über Permutationen. Arch Math Phys 27:742–744
Rawls CG, Turnquist MA (2011) Pre-positioning planning for emergency response with service quality constraints. OR Spectr 33(3):481–498
Sakashita M, Makino K, Fujishige S (2006) Minimum cost source location problems with flow requirements. In: Coorea JR, Hevia A, Kiwi M (eds) LATIN 2006: theoretical informatics. Lecture notes in computer science, vol 3881, pp 769–780
Sherali HD, Carter TB, Hobeika AG (1991) A location-allocation model and algorithm for evacuation planning under hurricane/flood conditions. Transp Res Part B 25B(6):439–452
Tamura H, Sengoku M, Shinoda S, Abe T (1990) Location problems on undirected flow networks. IEICE Trans E73-E(12):1989–1993
Tamura H, Sengoku M, Shinoda S, Abe T (1992) Some covering problems in location theory on flow networks. IEICE Trans Fundam Electron Commun Comput Sci E75-A(6):675–684
Tamura H, Sugawara H, Sengoku M, Shinoda S (1997) On a generalization of a covering problem called single cover on undirected flow networks. IEICE Trans Fundam Electron Commun Comput Sci E80-A(3):544–550
Tamura H, Sugawara H, Sengoku M, Shinoda S (1998) Plural cover problems on undirected flow networks. IEICE Trans Fundam Electron Commun Comput Sci J81-A:863–869
Turner L, Poetranto Groß D, Hamacher HW, Krumke SO (2015) Static and dynamic source locations in undirected networks, Invited Paper, TOP (2015), vol 23, pp 619–646
Uehara H, Yokoyama M (2000) A faster and flexible algorithm for a location problem on undirected flow networks. IEICE Trans Fundam Electron Commun Comput Sci 83(4):704–712
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by the Federal Ministry of Education and Research Germany (BMBF), Grants 13N12229, 13N12826, and 13N13198.
Rights and permissions
About this article
Cite this article
Heßler, P., Hamacher, H.W. Sink location to find optimal shelters in evacuation planning. EURO J Comput Optim 4, 325–347 (2016). https://doi.org/10.1007/s13675-015-0054-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13675-015-0054-7