Summary
A common problem that arises is the number and placement of facilities such as warehouses, manufacturing plants, stores, sensors, etc., needed to provide service to a region. Typically, the greater the number of facilities, the cheaper the cost of providing the service but the higher the capital cost of providing the facilities. The location of a facility is usually limited to a number of fixed locations. Consequently, when modeling such problems, binary variables are introduced to indicate whether or not a facility exists at a particular location. The resulting problem may then be modeled as a discrete optimization problem and could, in theory, be solved by general purpose algorithms for such problems. However, even in the case of a linear objective, such problems are \( \mathcal{N}\mathcal{P} \)-hard. Consequently, fast algorithms for large problems assured of finding a solution do not exist. Two alternatives to exact algorithms are heuristic algorithms and α-approximation algorithms. The latter esure that a feasible point is found whose objective is no worst than a multiple of α times the optimal objective. However, there has been little success in discovering α-approximation algorithms [Hoc97] when the problem has a nonlinear objective. Here we discuss a generic heuristic approach that exploits the fact that the number of facilities is usually small compared to the number of locations. It also takes advantage of the notion that moving a facility to a neighboring location has a much smaller impact on the cost of service compared to that of moving it to a distant location. A specific form of this algorithm is then applied to the problem of optimizing the placement of substations in an electrical network.
This research was supported by Office of Naval Research grant N00014-02-1-0076 and National Science Foundation CCR-0306662.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H.M. Amir and T. Hasegawa. Nonlinear mixed-discrete structural optimization. Journal of Structural Engineering, 115:626–646, 1989.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
J.Z. Cha and R.W. Mayne. Optimization with discrete variables via recursive quadratic programming: Part 2-algorithms and results. Transactions of the ASME, Journal of Mechanisms, Transmissions and Automation in Design, 111:130–136, 1989.
M.A. Duran and I.E. Grossman. An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming, 36:307–339, 1986.
A.M. Geoffrion. Generalized benders decomposition. J. Optim. Theory Appl,, 10:237–260, 1972.
P. E. Gill, W. Murray, and M. A. Saunders. SNOPT: An SQP algorithm for large-scale constrained optimization. Technical Report NA-97-2, San Diego, CA, 1997.
P. E. Gill, W. Murray, and M. A. Saunders. User’s guide for SQOPT 5.3: A fortan package for large-scale linear and quadratic programming. Technical report, Systems Optimization Laboratory, Department of Operations Research, Stanford University-94305-4022, 1997.
D. S. Hochbaum. Approximation algorithms for NP-hard problems. PWS Publishing Co., 1997.
K. Holmström. The TOMLAB Optimization Environment in Matlab. Advanced Modeling and Optimization, 1(1):47–69, 1999.
K. Jain and V. V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problems. In IEEE Symposium on Foundations of Computer Science, pages 2–13, 1999.
S. Leyffer. Deterministic Methods for Mixed Integer Nonlinear Programming. PhD thesis, University of Dundee, Dundee, Scotland, UK, 1993.
W. Murray and U.V. Shanbhag. A local relaxation approach for the siting of electrical substations. Computational Optimization and Applications (to appear), 2004.
K-M Ng. A Continuation Approach to Solving Continuous Problems with Discrete Variables. PhD thesis, Stanford University, Stanford, CA 94305, June, 2002.
G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. John Wiley, New York, 1988.
G.R. Olsen and G.N. Vanderplaats. Methods for nonlinear optimization with discrete design variables. AIAA Journal, 27:1584–1589, 1989.
D. B. Shmoys, É. Tardos, and K. Aardal. Approximation algorithms for facility location problems (extended abstract). In 29th Annual ACM Symposium on Theory of Computing, pages 265–274, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Murray, W., Shanbhag, U.V. (2006). A Local Relaxation Method for Nonlinear Facility Location Problems. In: Hager, W.W., Huang, SJ., Pardalos, P.M., Prokopyev, O.A. (eds) Multiscale Optimization Methods and Applications. Nonconvex Optimization and Its Applications, vol 82. Springer, Boston, MA. https://doi.org/10.1007/0-387-29550-X_7
Download citation
DOI: https://doi.org/10.1007/0-387-29550-X_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-29549-7
Online ISBN: 978-0-387-29550-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)