Optimal pump scheduling by linear programming

M. F.K. Pasha, K. Lansey

Research output: Chapter in Book/Report/Conference proceedingConference contribution

45 Scopus citations

Abstract

Energy is one of the largest water utility expenses. This cost is greatly associated with the pump operation. An optimum pump schedule can reduce the cost significantly while maintaining hydraulics in an acceptable range. In this paper, the pump station relationships are linearized using relationships among energy required, pumping flow, demand factors and tank storage or tank water levels. A linear programming (LP) optimization problem is formulated and solved for a single tank system for the optimal pump schedule to minimize energy cost. This LP model can be solved very quickly for a "near optimal" solution. Available online data can be then incorporated to update the schedule each hour in real-time. This paper describes preliminary methodologies that can be used to optimize the pump schedule and reservoir control. Future work will extend the approach to multiple tanks and pump station systems, better pump curve representations, and spatially variable demands.

Original languageEnglish (US)
Title of host publicationProceedings of World Environmental and Water Resources Congress 2009 - World Environmental and Water Resources Congress 2009
Subtitle of host publicationGreat Rivers
Pages395-404
Number of pages10
DOIs
StatePublished - 2009
EventWorld Environmental and Water Resources Congress 2009: Great Rivers - Kansas City, MO, United States
Duration: May 17 2009May 21 2009

Publication series

NameProceedings of World Environmental and Water Resources Congress 2009 - World Environmental and Water Resources Congress 2009: Great Rivers
Volume342

Other

OtherWorld Environmental and Water Resources Congress 2009: Great Rivers
Country/TerritoryUnited States
CityKansas City, MO
Period5/17/095/21/09

ASJC Scopus subject areas

  • General Environmental Science

Fingerprint

Dive into the research topics of 'Optimal pump scheduling by linear programming'. Together they form a unique fingerprint.

Cite this