2013
DOI: 10.1016/j.cor.2013.07.006
|View full text |Cite
|
Sign up to set email alerts
|

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 discusse… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
43
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 70 publications
(47 citation statements)
references
References 6 publications
1
43
0
Order By: Relevance
“…For instance, Zhan et al [43] used branch and bound and Bayesian methods to solve single-objective programming model regarding relief allocation. Goerigk et al [44] developed branch and bound algorithms to solve vehicle routing problem that is formulated as a single-objective mathematical model. In this context, branch and bound approach is leveraged to solve multi-objective 0-1 integer programming model that capture EOA.…”
Section: Motivations For Branch and Bound Approachmentioning
confidence: 99%
“…For instance, Zhan et al [43] used branch and bound and Bayesian methods to solve single-objective programming model regarding relief allocation. Goerigk et al [44] developed branch and bound algorithms to solve vehicle routing problem that is formulated as a single-objective mathematical model. In this context, branch and bound approach is leveraged to solve multi-objective 0-1 integer programming model that capture EOA.…”
Section: Motivations For Branch and Bound Approachmentioning
confidence: 99%
“…They present two phases of integer programming with given scenarios. With known number of evacuees at the beginning of the evacuation process, Goerigk et al (2013) propose several algorithms for upper bounds and lower bounds for the optimum and compare the CPLEX outputs to the branch and bound algorithm they they presented. All of these approaches consider the minimization of evacuation time and highlight the importance of transit-dependent evacuees needs.…”
Section: An Applicationmentioning
confidence: 99%
“…All of these approaches consider the minimization of evacuation time and highlight the importance of transit-dependent evacuees needs. Goerigk et al (2013) and Goerigk and Gruen (2014) apply the branch and bound algorithms and a tabu search heuristic for transit-based evacuation scenario. The branch and bound algorithms solve the bus-based transportation problem, with given number of evacuees at the sources, for the minimal duration of evacuation by routing and scheduling.…”
Section: An Applicationmentioning
confidence: 99%
“…Traffic flow is another important evacuation aspect per se, as the recent review on highway-based evacuation by Murray-Tuite and Wolshon (2013) shows (see also Brachman and Dragicevic, 2014), frequently done in tandem with time aspects (Kunwar et al, 2014;Lim et al, 2012;Mishima et al, 2014;Sayyady and Eksioglu, 2010;Stella and Daganzo, 2010). Scheduling aspects of evacuation problems are also approached, as in the evacuation scheme based on the use of buses presented by Goerigk et al (2013). For predictable disasters, which mainly are natural disasters such as hurricanes or floods, evacuation is required before disaster happens and the main objectives under this situation may be to minimise the system costs of evacuation and path risk, and to find the best location for rescue facilities (Kailiponi, 2010;Kongsomsaksakul et al, 2005;Li et al, 2012;Sherali et al, 1991).…”
Section: Introductionmentioning
confidence: 99%