Home > Research > Publications & Outputs > Branch and bound algorithms for the bus evacuat...
View graph of relations

Branch and bound algorithms for the bus evacuation problem

Research output: Contribution to journalJournal article

Published
Close
<mark>Journal publication date</mark>12/2013
<mark>Journal</mark>Computers and Operations Research
Issue number12
Volume40
Number of pages11
Pages (from-to)3010-3020
Publication StatusPublished
Early online date17/07/13
<mark>Original language</mark>English

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.