Evacuation problems and dynamic network flows

Proceedings of the SICE Annual Conference

Volumn , Issue , 2004, Pages 2373-2378

  Mamada, Satoko ^a   Makino, Kazuhisa ^a   Fujishige, Satoru ^b  

^a OSAKA UNIVERSITY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

Dynamic Flows; Evacuation Problems

Indexed keywords

ALGORITHMS; AUTOMATION; COMPUTER SIMULATION; FUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; RISK MANAGEMENT; SET THEORY; TRANSPORTATION;

CRISIS MANAGEMENT SYSTEMS; DYNAMIC FLOWS; EVACUATION PROBLEMS; TRANSPORTATION NETWORKS;

ACCIDENT PREVENTION;

EID: 12744279385     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. E. J. Andérsen, P. Nash, and A. B. Philpott: A class of continuous network flow problems. Mathematics of Operations Research 7 (1982) 501-514; Erratum, ibid. 8 (1983) 478.
2. R. E. Burkard, K. Dlaska, and B. Klinz: The quickest flow problem. ZOR Methods and Models of Operations Research 37 (1993) 31-58.
3. C. Burstedde, A. Kirchner, K. Klauck, A. Schadschneider, and J. Zittartz: Cellular automaton approach to pedestrian dynamics -Applications. In: Pedestrian and Evacuation Dynamics (M. Schreckenberg and S. D. Sharma, eds., Springer, 2002) 87-97.
4. M. Carey and E. Subrahmanian: An approach to modelling time-varying flows on congested networks. Transportation Research B 34 (2000) 157-183.
5. L. G. Chalmet, R. L. Francis, and P. B. Saunders: Network models for building evacuation. Management Science 28 (1982) 86-105.
6. Y. L. Chen and Y. H. Chin: The quickest path problem. Computers and Operations Research 17 (1990) 153-161.
7. H. K. Chen and C. F. Hsueh: A model and an algorithm for the dynamic user-optimal route choice problem. Transportation Research B 32 (1998) 219-234.
8. G. H. Chen and Y. C. Hung: On the quickest path problem. Information Processing Letters 46 (1993) 125-128.
9. W. Choi, R. L. Francis, H. W. Hamacher, and S. Tufekci: Network models of building evacuation problems with flow-dependent exit capacities. In: Operations Research '84 (Proceeding of the 10th IFORS Conference) (J. P. Brans, eds., Elsevier, 1984), 1047-1059.
10. W. Choi, H. W. Hamacher, and S. Tufekci: Modeling of building evacuation problems with side constraints. European Journal of Operations Research 35 (1988) 98-110.
11. R. F. Fahy: An evacuation model for high rise buildings. Proceedings of the Third International Symposium on Fire Safety Science (1991) 815-823.
12. L. Fleischer: Efficient continuous-time dynamic network flow algorithms. Operations Research Letters 23 (1998) 71-80.
13. L. Fleischer: Faster algorithms for the quickest transshipment problem. SIAM Journal on Optimization 12 (2001) 18-35.
14. L. Fleischer: Universally maximum flows with piecewise-constant capacities. Networks 38 (2001) 115-125.
15. L. Fleischer and É.Tardos: Efficient continuous-time dynamic network flow algorithms. Operations Research Letters 23 (1998) 71-80.
16. L. R. Ford, Jr. and D. R. Fulkerson: Flows in Networks (Princeton University Press, 1962).
17. E. R. Galea: Simulating evacuation and circulation in planes, trains, buildings and ships using the EXODUS software. In: Pedestrian and Evacuation Dynamics (M. Schreckenberg and S. D. Sharma, eds., Springer, 2002) 203-225.
18. H. W. Hamacher and S. A. Tjandra: Mathematical modelling of evacuation problems: A state of the art. In: Pedestrian and Evacuation Dynamics (M. Schreckenberg and S. D. Sharma, eds., Springer, 2002) 227-266.
19. H. W. Hamacher and S. Tufekci: On the use of lexicographic min cost flows in evacuation modeling. Naval Research Logistics 34 (1987) 487-503.
20. B. Hoppe and E. Tardos: Polynomial time algorithms for some evacuation problems. Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (1994) 433-441.
21. B. Hoppe and E. Tardos: The quickest transshipment problem. Mathematics of Operations Research 25 (2000) 36-62.
22. B. N. Janson: Dynamic traffic assignment for urban road networks. Transportation Research B 25 (1991) 143-161.
23. R. Jayakrishnan, W. K. Tsai, and A. Chen: A dynamic traffic assignment model with traffic-flow relationships. Transportation Research G 3 (1995) 51-72.
24. D. Kagaris, G. E. Pantziou, S. Tragoudas, and G. D. Zaroliagis: Transmissions in a network with capacities and delays. Networks 33 (1999) 167-174.
25. D. E. Kaufman, J. Nonis, and R. L. Smith: A mixed integer linear programming model for dynamic route guidance. Transportation Research B 32 (1998) 431-440.
26. T. M. Kisko and R. L. Francis: EVACNET: A computer program to determine optimal evacuation plans. Fire Safety Journal 9 (1985) 211-220.
27. M. M. Kostreva and M. M. Wiecek: Time dependency in multiple objective dynamic programming. Journal of Mathematical Analysis and Application 173 (1993) 289-307.
28. S. Mamada, K. Makino, and S. Fujishige: Optimal sink location problem for dynamic flows in a tree network. IEICE Transactions on Fundamentals E85-A (2002) 1020-1025.
29. 2 n] algorithm for the optimal sink location problem in dynamic tree-networks, to be submitted.
30. E. Minieka: Maximal, lexicographic, and dynamic network flows. Operations Research 21 (1973) 517-527.
31. R. G. Ogier: Minimum-delay routing in continuous-time dynamic networks with piecewise-constant capacities. Networks 18 (1988) 303-318.
32. A. B. Philpott: Continuous-time flows in networks. Mathematics of Operations Research 15 (1990) 640-661.
33. B. Ran and D. Boyce: Modeling Dynamic Transportation Networks -An Intelligent Transportation System Oriented Approach (2nd ed., Springer, 1996).
34. Y. Sheffi, H. Mahmassani, and W. B. Powell: A transportation network evacuation model. Transportation Research A 16 (1982) 209-218.
35. W. L. Wilkinson: An algorithm for universal maximal dynamic flows in a network. Operations Research 19 (1971) 1602-1612.
36. T. Yamada: A network approach to a city emergency evacuation planning. International Journal of Systems Science 27 (1996) 931-936.
37. D. J. Zawack and G. L. Thompson: A dynamic space-time network flow model for city traffic congestion. Transportation Science 21 (1987) 153-162.