Abstract
A tabu search heuristic procedure is developed to solve the uncapacitated facility location problem. The heuristic procedure uses tabu search to guide the solution process when evolving from one solution to another in order to search for an optimal solution. A move is defined to be the closing or opening of a facility. The net change in the total cost resulting from a move is used to measure the attractiveness of a move. Searching only a small subset of the feasible solutions that contains the optimal solution, the procedure is computationally very efficient. A computational experiment is conducted to test the performance of the procedure and computational results are reported. The procedure can easily find optimal solutions for test problems with known optimal solutions from the literature. Solutions obtained with this tabu search procedure completely dominate those obtained with the Lagrangian method for randomly generated test 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.
References
Beasley, J.E. (1990) “OR-Library: Distributing Test Problems by Electronic Mail,” Journal of the Operational Research Society, 41(11):1069–1072.
Beasley, J.E. (1993) “Lagrangean Heuristics for Location Problems,” European Journal of Operational Research, 65:383–399.
Brandeau, M.L. and S.L. Chiu (1989) “Overview of Representative Problems in Location Research,” Management Science, 35(6):695–674.
Chan, Y. (2001) Location Theory and Decision Analysis, South-Western College Publishing, Cincinnati, Ohio.
Chhajed, D., R.L. Francis and T.J. Lowe (1993) “Contributions of Operations Research to Location Analysis,” Location Science, 1:263–287.
Cornuéjols, G., M.L. Fisher and L.A. Wolsey (1977) “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms,” Management Science, 23:789–810.
Cornuéjols, G., G.L. Nemhauser and L.A. Wolsey (1990) “The Uncapacitated Facility Location Problem,” in P.B. Mirchandani and R. L. Francis (eds), Discrete Location Theory, Wiley, New York, 119–171.
Daskin, M.S. (1995) Network and Discrete Location, Models, Algorithms, and Applications, Wiley, New York.
Delmaire, H., J.A. Díaz, E. Fernández and M. Ortega (1998) “Reactive GRASP and Tabu Search Based Heuristics for the Single Source Capacitated Plant Location Problem,” Information Systems and Operations Research, 37(3):194–225.
Erlenkotter, D. (1978) “A Dual-Based Procedure for Uncapacitated Facility Location,” Operations Research, 26:992–1009.
Gen, M., Y. Tsujimura and S. Ishizaki (1996) “Optimal Design of a Star-LAN Using Neural Networks,” Computers and Industrial Engineering, 31(3/4):855–859.
Ghosh, A. and F. Harche (1993) “Location-Allocation Models in the Private Sector: Progress, Problems, and Prospects,” Location Science, 1:81–106.
Glover, F. (1989) “Tabu Search, Part I,” ORSA Journal on Computing, 1(3):190–206.
Glover, F. (1990a) “Tabu Search, Part II,” ORSA Journal on Computing, 2(1): 4–32.
Glover, F. (1990b) “Tabu Search: A Tutorial,” Interfaces, 20(4):74–94.
Glover, F. and M. Laguna (1997) Tabu Search, Kluwer Academic Publishers, Hingham, MA.
Glover, F., E. Taillard and D. de Werra (1993) “A User's Guide to Tabu Search,” Annals of Operational Research, 41(1–4):3–28.
Grolimund, S. and J.G. Ganascia (1997) “Driving Tabu Search with Case-Based Reasoning,” European Journal of Operational Research, 103(2):326–338.
Krarup, J. and P.M. Pruzan (1983) “The Simple Plant Location Problem: Survey and Synthesis,” European Journal of Operational Research, 12(1):36–81.
Krarup, J. and P.M. Pruzan (1990) “Ingredients of Location Analysis,” in Discrete Location Theory (P. B. Mirchandani and R. L. Francis, eds), Wiley, New York, 1–54.
Kuehn, A.A. and M.J. Hamburger (1963) “A Heuristic Program for Locating Warehouses,” Management Science, 9:643–666.
Mirchandani, P.B. and R.L. Francis (1990) Discrete Location Theory, Wiley, New York.
Nemhauser, G.L., L.A. Wolsey and L.M. Fisher (1978) “An Analysis of Approximations for Maximizing Submodular Set Functions, I,” Mathematical Programming, 14:265–294.
Simchi-Levi, D., P. Kaminsky and E. Simchi-Levi (2000) Designing and Managing the Supply Chain, Concepts, Strategies and Case Studies, Irwin McGraw-Hill, Boston, Massachusetts.
Sun, M. (1998) “A Tabu Search Heuristic Procedure for Solving the Transportation Problem with Exclusionary Side Constraints,” Journal of Heuristics, 3(4):305–326.
Sun, M., J.E. Aronson, P.G. McKeown and D. Drinka (1998) “A Tabu Search Heuristic Procedure for the Fixed Charge Transportation Problem,” European Journal of Operational Research, 106(2–3):441–456.
Sun, M. and P.G. McKeown (1993) “Tabu Search Applied to the General Fixed Charge Problem,” Annals of Operations Research, 41:405–420.
Tuzun, D. and L.I. Burke (1999) “A Two-Phase Tabu Search Approach to the Location Routing Problem,” European Journal of Operational Research, 116(1):87–99.
Vaithyanathan, S., L. Burke and M. Magent (1996) “Massively Parallel Analog Tabu Search Using Neural Networks Applied to Simple Plant Location Problems,” European Journal of Operational Research, 93:317–330.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Kluwer Academic Publishers
About this chapter
Cite this chapter
Sun, M. (2005). A Tabu Search Heuristic for the Uncapacitated Facility Location Problem. In: Sharda, R., Voß, S., Rego, C., Alidaee, B. (eds) Metaheuristic Optimization via Memory and Evolution. Operations Research/Computer Science Interfaces Series, vol 30. Springer, Boston, MA. https://doi.org/10.1007/0-387-23667-8_8
Download citation
DOI: https://doi.org/10.1007/0-387-23667-8_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-8134-7
Online ISBN: 978-0-387-23667-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)