Ali Haghani
|
This paper presents two formulations and two solution procedures for a capacitated maximum covering location problem. In the first formulation, the problem is presented as a mixed-interger linear programming model which maximizes covered demand. In the second model, the objective function maximizes the weighted covered demand while at the same time minimizing the average distance from the uncovered demands to the located facilities. The second formulation attempts to account for the assignment of the demand which is not "covered" to located facilities which have excess capacity. This assignment is very important, especially for locating emergency service facilities. Two heuristic procedures are proposed to solve these models. These are based on greedy adding technique and Lagrangian relaxation. At each iteration, the demands are allocated to the facilities using an out-of-kilter method. The performance of the solution techniques are compared to the optimal solutions in a variety of test problems. |
Return to Journal Listing |
Return to HomePage |