Branch-and-Bound Algorithms for a Regional Water Authority Distribution Problem

Abstract

A problem put forward recently by a Regional Water Authority differs from the well-known Capacitated Warehouse Location Problem only in that there are both weeks of normal demand levels and weeks of peak demand levels. We describe how Lagrangian relaxation based branch-and-bound algorithms have been adapted for the new problem. Computational results are given, enabling a comparison of the different approaches tried.

Keywords:

• Distribution
• Integer Programming
• Lagrangian Relaxation