Abstract
Computers may offer a way of speeding up forest fire dispatching. Results of tests made on a prototype system suggest that automated fire dispatching is feasible, and can be a useful tool to both the skilled and unskilled dispatcher.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Heyman, D. P., “Least Cost Location of Fire Suppression Equipment,” Report ORC 64-4, 1964, Operations Research Center, University of California, Berkeley, California.
McMasters, A. W., “Wildland Fire Control with Limited Suppression Forces,” Report ORC 66-5, 1966, Operations Research Center, University of California, Berkeley, California.
Parks, G. M., “The Development and Application of an Analytical Model for Initial Attack on Wildland Fires,” Report ORC 64-8(RR), 1964, Operations Research Center, University of California, Berkeley, California.
Parks, G. M. and Jewell, W. S., “A Preliminary Model of Initial Attack,” Report F-1, 1962, Operations Research Center, University of California, Berkeley, California.
McCarthy, John, “Information,”Scientific American, Vol. 215, No. 3 (1966), pp. 65–74.
Davis, James B. and Nickey, Bradley B., “Computer Time-sharing—A New Tool for Foresters,” (1969), manuscript in preparation.
Dreyfus, S. E., “An Appraisal of Some Shortest-path Algorithms,” RM-5433-PR (1967), The Rand Corporation, Santa Monica, California.
Saaty, T. L. and Busacker, R. G.,Finite Graphs and Networks, McGraw-Hill, New York, 1965.
Ore, Oystein,Graphs and Their Uses, Random House, New York, 1963.
Tropper, A. M.,Matrix Theory for Electrical Engineers, Addison-Wesley, Reading, Mass., 1962.
Gardner, Martin, “Mathematical Games—Combinational Problems Involving ‘Tree’ Graphs and Forests of Trees,”Scientific American, Feb. 1968, pp. 118–123.
Johnson, William F., “Minimum Path Algorithm for Successive Time Intervals,” Department of Civil Engineering, Massachusetts Institute of Technology, 1967.
Pollack, Maurice and Wiesbenson, Walter, “Solutions of the Shortest-route Problem—A Review,”Operations Research, Vol. 8, No. 2, pp. 224–230.
Ford, L. R. and Fulkerson, D. R.,Flows in Networks, Princeton University Press, Princeton, New Jersey, 1962.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tolin, E.T., Davis, J.B. & Mandt, C. Automated forest fire dispatching—A progress report. Fire Technol 5, 122–129 (1969). https://doi.org/10.1007/BF02591590
Issue Date:
DOI: https://doi.org/10.1007/BF02591590