Improved algorithms for the evacuation route planning problem

DOI10.1007/s10878-016-0082-0zbMath1402.90154arXiv1605.00065OpenAlexW2568184995MaRDI QIDQ724759

Gopinath Mishra, Subhra Mazumdar, Arindam Pal

Publication date: 26 July 2018

Published in: Journal of Combinatorial Optimization, Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.00065

zbMATH Keywords

combinatorial optimizationprobabilistic analysisgraph algorithmsevacuation planninginteger linear programrandomized behavior modelssingle source single sink evacuation route planner

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (2)

A bi-objective decision model and method for the integrated optimization of bus line planning and Lane reservation ⋮ A temporal logic programming approach to planning

Cites Work

• Unnamed Item
• Models of wayfinding in emergency evacuations
• Efficient continuous-time dynamic network flow algorithms
• The Quickest Transshipment Problem
• An Introduction to Network Flows over Time
• On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach

This page was built for publication: Improved algorithms for the evacuation route planning problem