Branch and bound algorithms for the bus evacuation problem

DOI10.1016/j.cor.2013.07.006zbMath1348.90090OpenAlexW2047846543MaRDI QIDQ336688

Marc Goerigk, Bob Grün, Philipp Heßler

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/3432

zbMATH Keywords

heuristicsinteger programmingbranch and boundevacuation planningdisaster management

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items

Routing and scheduling on evacuation path networks using centralized hybrid approach ⋮ Solving the bus evacuation problem and its variants ⋮ Unnamed Item ⋮ A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions ⋮ Approximation algorithms for the bus evacuation problem ⋮ Optimising shelter location and evacuation routing operations: the critical issues

Uses Software

• CPLEX
• LEMON

Cites Work

• Planning for a bus-based evacuation
• OR/MS research in disaster operations management
• Scheduling