Designing efficient sampling schemes for reconnaissance surveys of contaminated bed sediments in water courses

Abstract

A method for designing efficient sampling schemes for reconnaissance surveys of contaminated bed sediments in water courses is presented. The method can be used in networks of water courses, for instance to estimate the total volume of bed sediment of a defined quality class. The water courses must be digitised as arcs in a Geographical Information System.The method comprises six steps: (1) stratifying the water courses;(2) choosing a variogram; (3) calculating the parameters of the variance model; (4) choosing a compositing scheme; (5) choosing the values for the cost-model parameters; and (6) optimising the sampling scheme. The method is demonstrated with a survey of the main water courses in the reclaimed areas of Oostelijk Flevoland and Zuidelijk Flevoland.

Groundwater nitrate monitoring network optimization with missing data

“…Simulated annealing has had many applications in water management studies and in related fields, and proved to be a good optimization algorithm for difficult combinatorial problems. Examples are given by [2001, 2003] and [2001] in the optimization of crop irrigation; by [1998] and [2000] in geophysical data inversion for groundwater detection; by [1992], [1996], [2001a, 2001b], and [2000] for groundwater remediation optimization schemes; by [1999] for water distribution network design; by [2001], [1998], [1999], [1991], and [1993] for groundwater management; and by [2002], [2000], [1999], [1994], [1997], and [1996] for sampling optimization.…”

“…, andJohnson and Rogers [2000] for groundwater remediation optimization schemes; byCunha and Sousa [1999] for water distribution network design; byJohnson and Rogers [2001],Wang and Zheng [1998],Cunha [1999],Dougherty and Marryott [1991], andMarryott et al [1993] for groundwater management; and byFerreyra et al [2002],Brus et al [2000],Dixon et al [1999],Meyer et al [1994], Storck et al…”

Optimal estuarine sediment monitoring network design with simulated annealing

“…One of the most well known algorithms for solving combinatorial problems is simulated annealing, in particular in sampling/monitoring network optimisation (e.g. Meyer et al, 1994;Pardo-Igúzquiza, 1998;van Groenigen et al, 1999;Brus et al, 2000;Brus et al, 2002;Nunes et al, 2004a,b).…”