Branch and Bound Algorithms for the Bus Evacuation Problem

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

Download full text files

Export metadata

Additional Services

Search Google Scholar
Author:Marc Goerigk, Bob Grün, Philipp Heßler
Document Type:Preprint
Language of publication:English
Date of Publication (online):2013/02/20
Year of first Publication:2013
Publishing Institution:Technische Universität Kaiserslautern
Date of the Publication (Server):2013/02/20
Faculties / Organisational entities:Kaiserslautern - Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Standard gemäß KLUEDO-Leitlinien vom 10.09.2012