Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-23T18:01:35.717Z Has data issue: false hasContentIssue false

OPTIMAL MAINTENANCE DECISIONS FOR DIKES

Published online by Cambridge University Press:  01 January 2000

Lennaert J. P. Speijker
Affiliation:
National Aerospace Laboratory NLR, Department of Mathematical Models and Methods, 1006 BM Amsterdam, The Netherlands
Jan M. van Noortwijk
Affiliation:
Delft University of Technology, Faculty of Mathematics and Computer Science, 2600 GA Delft, The Netherlands
Matthijs Kok
Affiliation:
HKV Consultants, 8203 AC Lelystad, The Netherlands
Roger M. Cooke
Affiliation:
Delft University of Technology, Faculty of Mathematics and Computer Science, 2600 GA Delft, The Netherlands

Abstract

To protect the Dutch polders against flooding, more than 2500 km of dikes have been constructed. Due to settlement, subsoil consolidation, and relative sea-level rise, these dikes slowly sink “away into the sea” and should therefore be heightened regularly (at present, every 50 years). In this respect, one is interested in safe and cost-optimal dike heightenings for which the sum of the initial cost of investment and the future (discounted) cost of maintenance is minimal.

For optimization purposes, a maintenance model has been developed for dikes subject to uncertain crest-level decline. On the basis of engineering knowledge, crest-level decline has been modeled as a monotone stochastic process with expected decline being either linear or nonlinear (i.e., linear after transformation) in time. For both models and for a particular unit time, the increments are distributed according to mixtures of exponentials.

In a case study, the maintenance decision model has been applied to the problem of heightening the Dutch “Oostmolendijk.”

Type
Research Article
Copyright
© 2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)