Sink location to find optimal shelters in evacuation planning

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 ha...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	P. Heßler, H.W. Hamacher
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2016
Materias:	90B80 90B10 90C27 90C35 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/38210c9b6da94d3d90fd5fd78beba013
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:38210c9b6da94d3d90fd5fd78beba013
record_format	dspace
spelling	oai:doaj.org-article:38210c9b6da94d3d90fd5fd78beba0132021-12-02T05:00:55ZSink location to find optimal shelters in evacuation planning2192-440610.1007/s13675-015-0054-7https://doaj.org/article/38210c9b6da94d3d90fd5fd78beba0132016-09-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2192440621000678https://doaj.org/toc/2192-4406The 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.P. HeßlerH.W. HamacherElsevierarticle90B8090B1090C2790C35Applied mathematics. Quantitative methodsT57-57.97Electronic computers. Computer scienceQA75.5-76.95ENEURO Journal on Computational Optimization, Vol 4, Iss 3, Pp 325-347 (2016)
institution	DOAJ
collection	DOAJ
language	EN
topic	90B80 90B10 90C27 90C35 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
spellingShingle	90B80 90B10 90C27 90C35 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95 P. Heßler H.W. Hamacher Sink location to find optimal shelters in evacuation planning
description	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.
format	article
author	P. Heßler H.W. Hamacher
author_facet	P. Heßler H.W. Hamacher
author_sort	P. Heßler
title	Sink location to find optimal shelters in evacuation planning
title_short	Sink location to find optimal shelters in evacuation planning
title_full	Sink location to find optimal shelters in evacuation planning
title_fullStr	Sink location to find optimal shelters in evacuation planning
title_full_unstemmed	Sink location to find optimal shelters in evacuation planning
title_sort	sink location to find optimal shelters in evacuation planning
publisher	Elsevier
publishDate	2016
url	https://doaj.org/article/38210c9b6da94d3d90fd5fd78beba013
work_keys_str_mv	AT pheßler sinklocationtofindoptimalsheltersinevacuationplanning AT hwhamacher sinklocationtofindoptimalsheltersinevacuationplanning
_version_	1718400822444818432

Sink location to find optimal shelters in evacuation planning

Ejemplares similares