Abstract
Solving facility location problems does not only require to compute optimal or nearby optimal solutions, but also to perform a sensitivity and parametric analysis. It is necessary to provide insight into the behaviour of the total cost in dependence on the number of facilities to locate and into the possible variations of the data, which do not affect the optimality of a solution. Such an information is needed because locational decisions have a long-term planning horizon and the cost and demand data are subject to unforeseeable changes. Furthermore, only the information of the cost curve in the neighborhood of the optimum allows the decision maker to assess the consequences of a deviation from the optimal solution, which may be desirable for certain reasons.
Regarding the Uncapacitated Facility Location Problem (UFLP), such a sensitivity and parametric analysis of the fixed costs can be done by means of Lagrangean relaxation. In this paper, we will describe this approach theoretically and demonstrate its use on two real depot location problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ahn, S./Cooper, C./Cornuejols, G./Frieze, A. M. (1988): Probabilistic Analysis of a Relaxation for the k-Median Problem. Mathematics of Operations Research,> 13:1–31.
Boffey, T. B. (1989): Location Problems Arising in Computer Networks. The Journal of the Operational Research Society,> 40:347–354.
Christofides, N./Beasley, J. E. (1982): A Tree Search Algorithm for the p-Median Problem. European Journal of Operational Research,> 10:196–204.
Cornuejols, G./Fisher, M. L./Nemhauser, G. L. (1977): Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms. Management Science,> 23:163–177.
Current, J./Weber, C. (1994): Application of Facility Location Modeling Constructs to Vendor Selection Problems. European Journal of Operational Research,76:387–392.
Daskin, M. S./Haghani, A. E./Khanal, M./Malandraki, C. (1989): Aggregation Effects in Maximum Covering Models. Annals of Operations Research,18:115–140.
Erlenkotter, D. (1978): A Dual-Based Procedure for Uncapacitated Facility Location. Operations Research, 26:992–1009.
Geoffrion, A. M. (1974): Lagrangean Relaxation for Integer Programming. Mathematical Programming Study,2:82–114.
Greenberg, H. J. (1977): The One-Dimensional Generalized Lagrange Multiplier Problem. Operations Research,> 25:338–345.
Hanjoul, P./Peeters, D. (1985): A Comparison of two Dual-Dased Procedures for Solving the p-Median Problem. European Journal of Operational Research,> 20:387–396.
Jenkins, L. (1990): Parametric Methods in Integer Linear Programming. Annals of Operations Research, 27:77–96.
Klose, A. (1993): Das kombinatorische p-Median-Modell und Erweiterungen zur Bestimmung optimaler Standorte. Dissertation Nr. 1464, Hochschule St. Gallen.
Klose, A (1994): A Branch and Bound Algorithm for an Uncapacitated Facility Location Problem with a Side Constraint. Working paper, Institut für Unternehmensforschung (Operations Research), Hochschule St. Gallen.
Klose, A. (1995): A Comparison Between the Erlenkotter Algorithm and a Branch and Bound Algorithm Based on Subgradient Optimization to Solve the Uncapacitated Facility Location Problem. In: Ulrich Derigs, Achim Bachem, and Andreas Drexl, editors, Operations Research Proceedings 1994,pages 335–339, Berlin Heidelberg New York, Springer.
Körkel, M. (1989): On the Exact Solution of Large-Scale Simple Plant Location Problems. European Journal of Operational Research,> 39:157–173.
Krarup, J./Pruzan, P. M. (1983): The Simple Plant Location Problem: Survey and Synthesis. European Journal of Operational Research,> 12:36–81.
Minoux, M. (1986): Mathematical Programming. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons, Chichester, New York.
Mirchandani, P. B./Oudjit, A./Wong, R. T. (1985): Multidimensional Extensions and a Nested Dual Approach for the m-Median Problem. European Journal of Operational Research,> 21:121–137.
Morris, J. G. (1978): On the Extent to which Certain Fixed-Charge Depot Location Problems Can Be Solved by LP. The Journal of the Operational Research Society,> 29:71–76.
Nauss, R. M./Markland, R. E. (1981): Theory and Application of an Pp-timizing Procedure for Lock Box Location Analysis. Management Science,27:855–865.
Nemhauser, G. L./Wolsey, L. A (1988): Integer and Combinatorial Optimization.Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley &Sons, Chichester, New York.
Tcha, D.-W./Myung, Y.-S./Chung, K.-H. (1995): Parametric Uncapacitated Facility Location. European Journal of Operational Research,> 86:469–479.
Tüshaus, U./Wittmann, S. (1997): Strategie Logistic Planning by Means of Simple Plant Location: A Case Study, (this volume).
Walukiewicz S. (1981): Some Aspects of Integer Programming Duality. European Journal of Operational Research,> 7:196–202.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klose, A., Stähly, P. (1998). Parametric Analysis of Fixed Costs in Uncapacitated Facility Location. In: Fleischmann, B., van Nunen, J.A.E.E., Speranza, M.G., Stähly, P. (eds) Advances in Distribution Logistics. Lecture Notes in Economics and Mathematical Systems, vol 460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46865-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-46865-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64288-6
Online ISBN: 978-3-642-46865-0
eBook Packages: Springer Book Archive