Home > Research > Publications & Outputs > Branch and bound algorithms for the bus evacuat...

Research

Links

Text available via DOI:

Keywords

View graph of relations

Branch and bound algorithms for the bus evacuation problem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Branch and bound algorithms for the bus evacuation problem. / Goerigk, Marc; Grün, Bob; Heßler, Philipp.
In: Computers and Operations Research, Vol. 40, No. 12, 12.2013, p. 3010-3020.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Goerigk, M, Grün, B & Heßler, P 2013, 'Branch and bound algorithms for the bus evacuation problem', Computers and Operations Research, vol. 40, no. 12, pp. 3010-3020. https://doi.org/10.1016/j.cor.2013.07.006

APA

Goerigk, M., Grün, B., & Heßler, P. (2013). Branch and bound algorithms for the bus evacuation problem. Computers and Operations Research, 40(12), 3010-3020. https://doi.org/10.1016/j.cor.2013.07.006

Vancouver

Goerigk M, Grün B, Heßler P. Branch and bound algorithms for the bus evacuation problem. Computers and Operations Research. 2013 Dec;40(12):3010-3020. Epub 2013 Jul 17. doi: 10.1016/j.cor.2013.07.006

Author

Goerigk, Marc ; Grün, Bob ; Heßler, Philipp. / Branch and bound algorithms for the bus evacuation problem. In: Computers and Operations Research. 2013 ; Vol. 40, No. 12. pp. 3010-3020.

Bibtex

@article{56cbabc128f942af887119ab35b34536,
title = "Branch and bound algorithms for the bus evacuation problem",
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. ",
keywords = "Branch and bound, Disaster management, Evacuation planning, Heuristics, Integer programming",
author = "Marc Goerigk and Bob Gr{\"u}n and Philipp He{\ss}ler",
year = "2013",
month = dec,
doi = "10.1016/j.cor.2013.07.006",
language = "English",
volume = "40",
pages = "3010--3020",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",
number = "12",

}

RIS

TY - JOUR

T1 - Branch and bound algorithms for the bus evacuation problem

AU - Goerigk, Marc

AU - Grün, Bob

AU - Heßler, Philipp

PY - 2013/12

Y1 - 2013/12

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

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

KW - Branch and bound

KW - Disaster management

KW - Evacuation planning

KW - Heuristics

KW - Integer programming

U2 - 10.1016/j.cor.2013.07.006

DO - 10.1016/j.cor.2013.07.006

M3 - Journal article

AN - SCOPUS:84881121864

VL - 40

SP - 3010

EP - 3020

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 12

ER -