On the use of network flow techniques for assigning evacuees to exits | Zendy

Daniel D. Dressler | Zendy; Martin Groß | Zendy; Jan-Philipp Kappmeier | Zendy; Timon Kelter | Zendy; Joscha Kulbatzki | Zendy; Daniel Plümpe | Zendy; Gordon Schlechter | Zendy; Melanie Schmidt | Zendy; Martin Skutella | Zendy; Sylvie Temme | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the use of network flow techniques for assigning evacuees to exits

Author(s) -

Daniel D. Dressler,

Martin Groß,

Jan-Philipp Kappmeier,

Timon Kelter,

Joscha Kulbatzki,

Daniel Plümpe,

Gordon Schlechter,

Melanie Schmidt,

Martin Skutella,

Sylvie Temme

Publication year - 2010

Publication title -

procedia engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.32

H-Index - 74

ISSN - 1877-7058

DOI - 10.1016/j.proeng.2010.07.019

Subject(s) - cellular automaton , computer science , shortest path problem , flow network , simple (philosophy) , flow (mathematics) , path (computing) , mathematical optimization , automaton , maximum flow problem , operations research , algorithm , theoretical computer science , mathematics , computer network , graph , geometry , philosophy , epistemology

We apply network flow techniques to find good exit selections for evacuees in an emergency evacuation. More precisely, we present two algorithms for computing exit distributions using both classical flows and flows over time which are well known from combinatorial optimization. The performance of these new proposals is compared to a simple shortest path approach and to a best response dynamics approach by using a cellular automaton model

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research