Abstract
This paper deals with the network flow modeling of emergency evacuation problems in densely populated buildings or geographical areas. The underlying optimization model is a dynamic network flow model with side constraints. We propose a new dynamic basis partitioning procedure for the primal partitioning simplex algorithm. The proposed algorithm is used in solving very large size network flow problems with many side constraints. Our experimental results show that the proposed dynamic basis partitioning algorithm is up to 36 times more efficient than a regular basis partitioning algorithm on the problems encountered in solving emergency evacuation problems.
This research has been sponsored in part by the National Science Foundation, Grant No. CEE 8215437 and by the Florida Industry and High Technology Council.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aronson, J. E. A survey of dynamic network flows. Annals of O.R., 20: 1–66, 1989.
Chalmet, L. G., R. L. Francis, and P. B. Saunders. Network models for building evacuation. Management Science, 28 (1): 86–105, 1982.
Choi, W. Network flow models of building evacuation problems with flow dependent arc capacities. Unpublished Ph.D. dissertation, University of Florida, April 1987.
Choi, W., R. L. Francis, H. W. Hamacher, and S. Tüfekçi. Network models of building evacuation problems with flow dependent exit capacities. Opreational Research ‘84, Elsevier Publishers, North Holland, 1047–1059, 1984.
Choi, W., H. W. Hamacher, and S. Tüfekçi. Modeling of building evacuation problems by network flows with side constraints. European Journal of Operations Research, 35 (1): 98–110, 1988.
Choi, W., and S. Tüfekçi. An algorithm for a network flow problem with special side constraints. TIMS/ORSA Joint National Conference, Los Angeles, California, April 14–16, 1986.
Fruin, J. J. Design for Pedestrians, A Level-of-Service Concept. unpublished Ph.D. dissertation, The Polytechnique Institute of Brooklyn, June 1970.
Fruin, J. J. Pedestrian Planning and Design. Metropolitan Association of Urban Designers and Environmental Planners, New York, 1971.
Hamacher, H. W., and S. Tüfekçi. On the use of lexicographical min cost flows in evacuation modeling. Naval Research Logistics, 34: 487–503, 1987.
Highway Capacity Manual. Transportation Research Board, National Research Council, Washington, D.C., 1985.
Jarvis, J. J. and H. D. Ratliff. Some equivalent objectives for dynamic network flow problems. Management Science, 28: 1982.
Kennington, J. L., and R. V. Helgason. Algorithms for Network Programming. Wiley-Interscience, New York, 1980.
Kisko, T. M., and R. L. Francis. EVACNET+: A computer program to determine optimal building evacuation plans. Fire Safety Journal, 9 (1,2), 1985.
Kisko, T., and S. Tüfekçi. Design of a regional evacuation decision support system. Proceedings of the 1991 Western Simu lation Multiconference, Society of Computer Simulation, Anaheim, California, 48–53, 23–25 January1991.
Tüfekçi, S., and T. Kisko. Regional evacuation modeling system (REMS): A decision support system for emergency area evacuations, Proceedings of the Computers and Industrial Engineering Conference, Orlando, Florida, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, W., Tüfekçi, S. (1992). Dynamic Basis Partitioning for Network Flows with Side Constraints. In: Akgül, M., Hamacher, H.W., Tüfekçi, S. (eds) Combinatorial Optimization. NATO ASI Series, vol 82. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77489-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-77489-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-77491-1
Online ISBN: 978-3-642-77489-8
eBook Packages: Springer Book Archive