Optimization of Water Supply Pump Operation Scheduling Using Branch and Bound Method

Abstract

We develop a new optimization method for the daily water supply pump operation scheduling using the branch and bound method. In the method, we define a search tree as a trinary tree in which the nodes are the number of operating pumps at each step and edges are the changes in the number of operating pumps between the present step and the next step. We also define pruning criteria of the search tree to raise search efficiency. We apply the method to a benchmark of the daily water supply pump operation scheduling, and verify the effectiveness of the method.