Limited-Memory Techniques for Sensor Placement in Water Distribution Networks

  • Authors:

  • William E. Hart;Jonathan W. Berry;Erik Boman;Cynthia A. Phillips;Lee Ann Riesen;Jean-Paul Watson

  • Affiliations:

  • Sandia National Laboratories, Albuquerque, USA NM 87185;Sandia National Laboratories, Albuquerque, USA NM 87185;Sandia National Laboratories, Albuquerque, USA NM 87185;Sandia National Laboratories, Albuquerque, USA NM 87185;Sandia National Laboratories, Albuquerque, USA NM 87185;Sandia National Laboratories, Albuquerque, USA NM 87185

  • Venue:
  • Learning and Intelligent Optimization
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The practical utility of optimization technologies is often impacted by factors that reflect how these tools are used in practice, including whether various real-world constraints can be adequately modeled, the sophistication of the analysts applying the optimizer, and related environmental factors (e.g. whether a company is willing to trust predictions from computational models). Other features are less appreciated, but of equal importance in terms of dictating the successful use of optimization. These include the scale of problem instances, which in practice drives the development of approximate solution techniques, and constraints imposed by the target computing platforms. End-users often lack state-of-the-art computers, and thus runtime and memory limitations are often a significant, limiting factor in algorithm design. When coupled with large problem scale, the result is a significant technological challenge. We describe our experience developing and deploying both exact and heuristic algorithms for placing sensors in water distribution networks to mitigate against damage due intentional or accidental introduction of contaminants. The target computing platforms for this application have motivated limited-memory techniques that can optimize large-scale sensor placement problems.