@article{
 title = {Branch and bound algorithms for the bus evacuation problem},
 type = {article},
 year = {2013},
 identifiers = {[object Object]},
 keywords = {Branch and bound,Disaster management,Evacuation planning,Heuristics,Integer programming},
 pages = {3010-3020},
 volume = {40},
 websites = {http://linkinghub.elsevier.com/retrieve/pii/S0305054813001858},
 month = {12},
 publisher = {Elsevier},
 id = {0238dae0-fef2-3119-b35b-90a189db8efe},
 created = {2015-03-23T18:50:21.000Z},
 accessed = {2014-09-12},
 file_attached = {true},
 profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},
 group_id = {1f5b486a-d8ac-3a35-9104-56111360dab7},
 last_modified = {2017-03-14T11:36:44.206Z},
 read = {true},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 citation_key = {Goerigk2013a},
 private_publication = {false},
 abstract = {The bus evacuation problem (BEP) is a vehicle routing problem that arises in emergency planning. It models the evacuation of a region from a set of collection points to a set of capacitated shelters with the help of buses, minimizing the time needed to bring the last person out of the endangered region. In this work, we describe multiple approaches for finding both lower and upper bounds for the BEP, and apply them in a branch and bound framework. Several node pruning techniques and branching rules are discussed. In computational experiments, we show that solution times of our approach are significantly improved compared to a commercial integer programming solver. © 2013 Elsevier Ltd.},
 bibtype = {article},
 author = {Goerigk, Marc and Grün, Bob and Heßler, Philipp},
 journal = {Computers and Operations Research},
 number = {12}
}

{"_id":"MgwjKarNDrjpXTLdx","bibbaseid":"goerigk-grn-heler-branchandboundalgorithmsforthebusevacuationproblem-2013","downloads":0,"creationDate":"2018-03-26T07:07:40.593Z","title":"Branch and bound algorithms for the bus evacuation problem","author_short":["Goerigk, M.","Grün, B.","Heßler, P."],"year":2013,"bibtype":"article","biburl":null,"bibdata":{"title":"Branch and bound algorithms for the bus evacuation problem","type":"article","year":"2013","identifiers":"[object Object]","keywords":"Branch and bound,Disaster management,Evacuation planning,Heuristics,Integer programming","pages":"3010-3020","volume":"40","websites":"http://linkinghub.elsevier.com/retrieve/pii/S0305054813001858","month":"12","publisher":"Elsevier","id":"0238dae0-fef2-3119-b35b-90a189db8efe","created":"2015-03-23T18:50:21.000Z","accessed":"2014-09-12","file_attached":"true","profile_id":"756a70ce-605d-3e50-9cbb-a99c29afcbe8","group_id":"1f5b486a-d8ac-3a35-9104-56111360dab7","last_modified":"2017-03-14T11:36:44.206Z","read":"true","starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"Goerigk2013a","private_publication":false,"abstract":"The bus evacuation problem (BEP) is a vehicle routing problem that arises in emergency planning. It models the evacuation of a region from a set of collection points to a set of capacitated shelters with the help of buses, minimizing the time needed to bring the last person out of the endangered region. In this work, we describe multiple approaches for finding both lower and upper bounds for the BEP, and apply them in a branch and bound framework. Several node pruning techniques and branching rules are discussed. In computational experiments, we show that solution times of our approach are significantly improved compared to a commercial integer programming solver. © 2013 Elsevier Ltd.","bibtype":"article","author":"Goerigk, Marc and Grün, Bob and Heßler, Philipp","journal":"Computers and Operations Research","number":"12","bibtex":"@article{\n title = {Branch and bound algorithms for the bus evacuation problem},\n type = {article},\n year = {2013},\n identifiers = {[object Object]},\n keywords = {Branch and bound,Disaster management,Evacuation planning,Heuristics,Integer programming},\n pages = {3010-3020},\n volume = {40},\n websites = {http://linkinghub.elsevier.com/retrieve/pii/S0305054813001858},\n month = {12},\n publisher = {Elsevier},\n id = {0238dae0-fef2-3119-b35b-90a189db8efe},\n created = {2015-03-23T18:50:21.000Z},\n accessed = {2014-09-12},\n file_attached = {true},\n profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},\n group_id = {1f5b486a-d8ac-3a35-9104-56111360dab7},\n last_modified = {2017-03-14T11:36:44.206Z},\n read = {true},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Goerigk2013a},\n private_publication = {false},\n abstract = {The bus evacuation problem (BEP) is a vehicle routing problem that arises in emergency planning. It models the evacuation of a region from a set of collection points to a set of capacitated shelters with the help of buses, minimizing the time needed to bring the last person out of the endangered region. In this work, we describe multiple approaches for finding both lower and upper bounds for the BEP, and apply them in a branch and bound framework. Several node pruning techniques and branching rules are discussed. In computational experiments, we show that solution times of our approach are significantly improved compared to a commercial integer programming solver. © 2013 Elsevier Ltd.},\n bibtype = {article},\n author = {Goerigk, Marc and Grün, Bob and Heßler, Philipp},\n journal = {Computers and Operations Research},\n number = {12}\n}","author_short":["Goerigk, M.","Grün, B.","Heßler, P."],"urls":{"Paper":"https://bibbase.org/service/mendeley/756a70ce-605d-3e50-9cbb-a99c29afcbe8/file/19b7504f-fc93-6efb-4d62-04bf1381bbf6/2013-Branch_and_bound_algorithms_for_the_bus_evacuation_problem.pdf.pdf","Website":"http://linkinghub.elsevier.com/retrieve/pii/S0305054813001858"},"bibbaseid":"goerigk-grn-heler-branchandboundalgorithmsforthebusevacuationproblem-2013","role":"author","keyword":["Branch and bound","Disaster management","Evacuation planning","Heuristics","Integer programming"],"downloads":0},"search_terms":["branch","bound","algorithms","bus","evacuation","problem","goerigk","grün","heßler"],"keywords":["branch and bound","disaster management","evacuation planning","heuristics","integer programming"],"authorIDs":[]}