Methods for a network design problem in solar power systems

Abstract

We consider the problem of minimizing cable connections between a central computer and a field of heliostats in the design of solar power systems. This practical task can be modeled as a p-median problem with additional constraints in a weighted graph. We compare an exact branch-and-bound method with two approximate algorithms. For the latter two methods, estimations of time complexity and accuracy are presented. Computational results are shown which should be useful in the design of such large-scale power systems.