Article ID: | iaor20101662 |
Volume: | 71 |
Issue: | 1 |
Start Page Number: | 125 |
End Page Number: | 163 |
Publication Date: | Feb 2010 |
Journal: | Mathematical Methods of Operations Research |
Authors: | Marn Alfredo, Nickel Stefan, Velten Sebastian |
To model flexible objectives for discrete location problems, ordered median functions can be applied. These functions multiply a weight to the cost of fulfilling the demand of a customer which depends on the position of that cost relative to the costs of fulfilling the demand of the other customers. In this paper a reformulated and more compact version of a covering model for the discrete ordered median problem (DOMP) is considered. It is shown that by using this reformulation better solution times can be obtained. This is especially true for some objectives that are often employed in location theory. In addition, the covering model is extended so that ordered median functions with negative weights are feasible as well. This type of modeling weights has not been treated in the literature on the DOMP before. We show that several discrete location problems with equity objectives are particular cases of this model. As a result, a mixed-integer linear model for this type of problems is obtained for the first time.