Abstract
Optimal zonation of well-log data, that is, determining an optimal number of major segments such as waveforms in a log, may be achieved by employing a criterion of minimum variance (within a segment) and a heuristic search of potential boundary (link) points of digitized log data. This new method is based on an algorithm originally devised by D. M. Hawkins and D. F. Merriam in 1973. Their method can be improved by introducing a heuristic search procedure, thereby decreasing computer time by 7- to 50-fold, depending on the number of data points and configuration of the logs. Time saving is proportional to the size of the data set. Three examples—one hypothetical and two real—are used to illustrate the modification of the Hawkins and Merriam algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Hawkins, D. M. and Merriam, D. F., 1973, Optimal zonation of digitized sequential data: Math. Geol., v. 5, p. 389–396.
Hawkins, D. M. and Merriam, D. F., 1975, Segmentation of discrete sequences of geologic data: Geol. Soc. Amer. Mem. v. 142, p. 311–315.
Hawkins, D. M. and ten Krooden, J. A., 1979, A review of several methods of segmentation:in D. Gill and D. F. Merriam (eds.), Geomathematical and petrophysical studies in sedimentology: Permagon Press, New York, p. 117–126.
Sedgwick, R., 1983, Algorithms: Addison-Wesley, Reading, Mass., 552 p.
Winston, P. H., 1984, Artificial intelligence, 2nd ed.: Addison-Wesley, Reading, Mass., 525 p.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chen, HC., Fang, J.H. A heuristic search method for optimal zonation of well logs. Math Geol 18, 489–500 (1986). https://doi.org/10.1007/BF00897501
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00897501