{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/44623"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/44623","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"A location-allocation model and algorithm for optimally locating shelters to minimize evacuation times","abstract":"Location â allocation models are designed to seek the concurrent location of a set of service facilities and an allocation scheme to satisfy the demands of a set of customers or users of a given system. If the location-allocation model is based on a graph-theoretic formulation, then the demand-fulfilling items will move from a designated origin or origins, through arcs and transshipment nodes, to a set of destinations selected by the model. It is suggested in this research effort that such a modeling structure may be employed to simulate transportation evacuation conditions that may arise in the case of a natural disaster, namely a hurricane. A nonlinear mixed integer mathematical program is formulated to route passengers in automobiles on paths in the transportation network, such that the endangered area is evacuated in the minimum amount of time. One heuristic and two exact, convergent, implicit enumeration algorithms based on the generalized Benders' decomposition method are presented. The algorithms are designed to exploit the inherent problem structure. Computational experience is provided against a set of realistic test problems formulated on the Virginia Beach network. Potential avenues for further research are also explored.","abstract_html":"Location â allocation models are designed to seek the concurrent location of a set of service facilities and an allocation scheme to satisfy the demands of a set of customers or users of a given system. If the location-allocation model is based on a graph-theoretic formulation, then the demand-fulfilling items will move from a designated origin or origins, through arcs and transshipment nodes, to a set of destinations selected by the model. It is suggested in this research effort that such a modeling structure may be employed to simulate transportation evacuation conditions that may arise in the case of a natural disaster, namely a hurricane. A nonlinear mixed integer mathematical program is formulated to route passengers in automobiles on paths in the transportation network, such that the endangered area is evacuated in the minimum amount of time. One heuristic and two exact, convergent, implicit enumeration algorithms based on the generalized Benders' decomposition method are presented. The algorithms are designed to exploit the inherent problem structure. Computational experience is provided against a set of realistic test problems formulated on the Virginia Beach network. Potential avenues for further research are also explored.","abstract_has_math":false,"creators":["Carter, Todd B."],"institution":"Virginia Tech","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Industrial Engineering and Operations Research","degree_department":"Industrial Engineering and Operations Research","school":null,"contributors":[],"advisors":[],"committee_chairs":["Sherali, Hanif D."],"committee_members":["Hobeika, Antoine G.","Tew, Jeffrey D."],"year":1989,"date_issued":"1989-07-15","date_published":"1989-07-15","updated_at":"2026-07-24T05:56:14Z","subjects":[],"languages":["en"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-09082012-040014"],"render_values":[{"text":"etd-09082012-040014","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/44623","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Sherali, Hanif D."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Hobeika, Antoine G.","Tew, Jeffrey D."]},{"key":"dc:contributor.department","label":"Department","values":["Industrial Engineering and Operations Research"]},{"key":"dc:creator","label":"Author","values":["Carter, Todd B."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T21:45:06Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T21:45:06Z","2012-09-08"]},{"key":"dc:date.issued","label":"Date","values":["1989-07-15"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial Engineering and Operations Research"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-09082012-040014"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/44623"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Location â allocation models are designed to seek the concurrent location of a set of service facilities and an allocation scheme to satisfy the demands of a set of customers or users of a given system. If the location-allocation model is based on a graph-theoretic formulation, then the demand-fulfilling items will move from a designated origin or origins, through arcs and transshipment nodes, to a set of destinations selected by the model. It is suggested in this research effort that such a modeling structure may be employed to simulate transportation evacuation conditions that may arise in the case of a natural disaster, namely a hurricane. A nonlinear mixed integer mathematical program is formulated to route passengers in automobiles on paths in the transportation network, such that the endangered area is evacuated in the minimum amount of time. One heuristic and two exact, convergent, implicit enumeration algorithms based on the generalized Benders' decomposition method are presented. The algorithms are designed to exploit the inherent problem structure. Computational experience is provided against a set of realistic test problems formulated on the Virginia Beach network. Potential avenues for further research are also explored."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["BTD"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["A location-allocation model and algorithm for optimally locating shelters to minimize evacuation times"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Sherali, Hanif D."],"dc:contributor.committeemember":["Hobeika, Antoine G.","Tew, Jeffrey D."],"dc:contributor.department":["Industrial Engineering and Operations Research"],"dc:creator":["Carter, Todd B."],"dc:date.accessioned":["2014-03-14T21:45:06Z"],"dc:date.available":["2014-03-14T21:45:06Z","2012-09-08"],"dc:date.issued":["1989-07-15"],"dc:description.abstract":["Location â allocation models are designed to seek the concurrent location of a set of service facilities and an allocation scheme to satisfy the demands of a set of customers or users of a given system. If the location-allocation model is based on a graph-theoretic formulation, then the demand-fulfilling items will move from a designated origin or origins, through arcs and transshipment nodes, to a set of destinations selected by the model. It is suggested in this research effort that such a modeling structure may be employed to simulate transportation evacuation conditions that may arise in the case of a natural disaster, namely a hurricane. A nonlinear mixed integer mathematical program is formulated to route passengers in automobiles on paths in the transportation network, such that the endangered area is evacuated in the minimum amount of time. One heuristic and two exact, convergent, implicit enumeration algorithms based on the generalized Benders' decomposition method are presented. The algorithms are designed to exploit the inherent problem structure. Computational experience is provided against a set of realistic test problems formulated on the Virginia Beach network. Potential avenues for further research are also explored."],"dc:description.degree":["Master of Science"],"dc:format.medium":["BTD"],"dc:format.mimetype":["application/pdf"],"dc:identifier.other":["etd-09082012-040014"],"dc:identifier.uri":["http://hdl.handle.net/10919/44623"],"dc:language.iso":["en"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["A location-allocation model and algorithm for optimally locating shelters to minimize evacuation times"],"dc:type":["Thesis"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Industrial Engineering and Operations Research"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-24T05:56:14Z"}