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.
Keywords
Span Tree Dispatch Forest Fire Prototype System Fire Technology
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Heyman, D. P., “Least Cost Location of Fire Suppression Equipment,” Report ORC 64-4, 1964, Operations Research Center, University of California, Berkeley, California.Google Scholar
- 2.McMasters, A. W., “Wildland Fire Control with Limited Suppression Forces,” Report ORC 66-5, 1966, Operations Research Center, University of California, Berkeley, California.Google Scholar
- 3.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.Google Scholar
- 4.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.Google Scholar
- 5.McCarthy, John, “Information,”Scientific American, Vol. 215, No. 3 (1966), pp. 65–74.MathSciNetCrossRefGoogle Scholar
- 6.Davis, James B. and Nickey, Bradley B., “Computer Time-sharing—A New Tool for Foresters,” (1969), manuscript in preparation.Google Scholar
- 7.Dreyfus, S. E., “An Appraisal of Some Shortest-path Algorithms,” RM-5433-PR (1967), The Rand Corporation, Santa Monica, California.Google Scholar
- 8.Saaty, T. L. and Busacker, R. G.,Finite Graphs and Networks, McGraw-Hill, New York, 1965.MATHGoogle Scholar
- 9.Ore, Oystein,Graphs and Their Uses, Random House, New York, 1963.MATHGoogle Scholar
- 10.Tropper, A. M.,Matrix Theory for Electrical Engineers, Addison-Wesley, Reading, Mass., 1962.Google Scholar
- 11.Gardner, Martin, “Mathematical Games—Combinational Problems Involving ‘Tree’ Graphs and Forests of Trees,”Scientific American, Feb. 1968, pp. 118–123.Google Scholar
- 12.Johnson, William F., “Minimum Path Algorithm for Successive Time Intervals,” Department of Civil Engineering, Massachusetts Institute of Technology, 1967.Google Scholar
- 13.Pollack, Maurice and Wiesbenson, Walter, “Solutions of the Shortest-route Problem—A Review,”Operations Research, Vol. 8, No. 2, pp. 224–230.Google Scholar
- 14.Ford, L. R. and Fulkerson, D. R.,Flows in Networks, Princeton University Press, Princeton, New Jersey, 1962.MATHGoogle Scholar
Copyright information
© The National Fire Protection Association 1969