Branch and bound algorithms for the bus evacuation problem

Goerigk, Marc and Grün, Bob and Heßler, Philipp (2013) Branch and bound algorithms for the bus evacuation problem. Computers and Operations Research, 40 (12). pp. 3010-3020. ISSN 0305-0548

Full text not available from this repository.

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.

Item Type:
Journal Article
Journal or Publication Title:
Computers and Operations Research
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600/2611
Subjects:
ID Code:
76548
Deposited By:
Deposited On:
10 Nov 2015 10:00
Refereed?:
Yes
Published?:
Published
Last Modified:
23 Jan 2020 02:50