Article ID: | iaor20042507 |
Country: | Netherlands |
Volume: | 145 |
Issue: | 1 |
Start Page Number: | 1 |
End Page Number: | 13 |
Publication Date: | Feb 2003 |
Journal: | European Journal of Operational Research |
Authors: | ReVelle Charles S., Harkness Joseph |
Keywords: | programming: integer |
Facility location models determine the set of locations on a network that minimize the sum of the costs of investment, production, and distribution to meet a known set of demands. In this paper, we introduce a new type of facility location model, which combines aspects of the well-studied simple uncapacitated and capacitated facility location problems. Its distinctive feature is that unit production costs are modeled as increasing with scale of output. Such cost functions have practical value in handling cases in which capacity can be “stretched” by incurring some additional cost (e.g., by adding workers). Indeed, it is shown that average total costs are minimized at a point where average production costs are rising. Four different formulations for this problem are proposed. Using linear programming plus branch-and-bound as a solution method, the four formulations are tested and compared on a set of 216 problems with randomly generated data.