Heuristic algorithms for the single source capacitated facility location problem

Heuristic algorithms for some versions of the single source capacitated facility location problem are described in this paper. Several of the heuristics are adaptations of successful heuristics for the generalised assignment problem, whilst others are designed around the specific objective function structure of the capacitated facility location problem. The heuristics are relatively simplistic and are consequently fast to run. The algorithms have been tested on problems of substantial size and compared to an exact integer programming approach. Computational results look promising in terms of speed and solution quality.