Skip to main content
SpringerLink
Log in

A tabu search heuristic procedure for the capacitated facility location problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

A tabu search heuristic procedure is developed, implemented and computationally tested for the capacitated facility location problem. The procedure uses different memory structures. Visited solutions are stored in a primogenitary linked quad tree. For each facility, the recent move at which the facility changed its status and the frequency it has been open are also stored. These memory structures are used to guide the main search process as well as the diversification and intensification processes. Lower bounds on the decreases of total cost are used to measure the attractiveness of the moves and to select moves in the search process. A specialized network algorithm is developed to exploit the problem structure in solving transportation problems. Criterion altering, solution reconciling and path relinking are used to perform intensification functions. The performance of the procedure is tested through computational experiments using test problems from the literature and new test problems randomly generated. It found optimal solutions for almost all test problems from the literature. As compared to the heuristic method of Lagrangean relaxation with improved subgradient scheme, the tabu search heuristic procedure found much better solutions using much less CPU time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aardal, K.: Capacitated facility location: Separation algorithm and computational experience. Math. Program. 81, 149–175 (1998)

    MathSciNet  MATH  Google Scholar 

  • Akinc, U., Khumawala, M.: An efficient branch and bound algorithm for the capacitated warehouse location problem. Manag. Sci. 23, 585–594 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  • Al-Sultan, K.S., Al-Fawzan, M.A.: A Tabu search approach to the uncapacitated facility location problem. Ann. Oper. Res. 86, 91–103 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  • Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87, 385–399 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  • Barahona, F., Chudak, F.A.: Near-optimal solutions to large scale facility location problems. Discrete Optim. 2(1), 35–50 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  • Beasley, J.E.: OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069–1072 (1990)

    Google Scholar 

  • Beasley, J.E.: Lagrangian heuristics for location problems. Eur. J. Oper. Res. 65, 383–399 (1993)

    Article  MATH  Google Scholar 

  • Carlton, W.B., Barnes, J.W.: A note on hashing functions and tabu search algorithms. Eur. J. Oper. Res. 95, 237–239 (1996)

    Article  MATH  Google Scholar 

  • Christofides, N., Beasley, J.E.: Extensions to a Lagrangean location problem. Eur. J. Oper. Res. 12, 19–28 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  • Cornuejols, G., Sridharan, R., Thizy, J.M.: A comparison of heuristics and relaxations for the capacitated plant location problem. Eur. J. Oper. Res. 50, 280–297 (1991)

    Article  MATH  Google Scholar 

  • Daskin, M.S.: Network and Discrete Location, Models, Algorithms, and Applications. Wiley, New York (1995)

    Book  MATH  Google Scholar 

  • Delmaire, H., Diaz, J.A., Fernandez, E., Ortega, M.: Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem. Inf. Syst. Oper. Res. 37, 194–225 (1998)

    Google Scholar 

  • Domschke, W., Drexl, A.: Add-heuristics starting procedures for capacitated plant location models. Eur. J. Oper. Res. 21, 47–53 (1985)

    Article  MATH  Google Scholar 

  • Drezner, Z., Hamacher, H.W.: Facility Location: Theory and Algorithms. Springer, Berlin (2001)

    Google Scholar 

  • Feldman, E., Lehrer, F.A., Ray, T.L.: Warehouse location under continuous economies of scale. Manag. Sci. 12, 670–684 (1966)

    Article  Google Scholar 

  • Filho, V.J.M.F., Galvão, R.D.: A tabu search heuristic for the concentrator location problem. Location Sci. 6(1–4), 189–209 (1998)

    Article  Google Scholar 

  • França, P.M., Sosa, N.G., Pureza, V.M.: An adaptive tabu search approach for solving the capacitated clustering problem. Int. Trans. Oper. Res. 6, 665–678 (1999)

    MathSciNet  Google Scholar 

  • Geoffrion, A.M., McBride, R.: Lagrangian relaxation applied to capacitated facility location problems. AIIE Trans. 10, 40–47 (1978)

    Article  Google Scholar 

  • Ghosh, D.: Neighborhood search heuristics for the uncapacitated facility location problem. Eur. J. Oper. Res. 150, 150–162 (2003)

    Article  MATH  Google Scholar 

  • Glover, F.: Tabu search, Part I. ORSA J. Comput. 1, 190–206 (1989)

    MathSciNet  MATH  Google Scholar 

  • Glover, F.: Tabu search, Part II. ORSA J. Comput. 2, 4–32 (1990)

    MATH  Google Scholar 

  • Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Hingham (1997)

    Book  MATH  Google Scholar 

  • Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Control Cybern. 29(3), 653–684 (2000)

    MATH  Google Scholar 

  • Grolimund, S., Ganascia, J.G.: Driving tabu search with case-based reasoning. Eur. J. Oper. Res. 103, 326–338 (1997)

    Article  MATH  Google Scholar 

  • Hoefer, M.: Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location. In: Jansen, K., et al. (eds.) WEA 2003. LNCS, vol. 2647, pp. 165–178 (2003)

    Google Scholar 

  • Jacobsen, S.K.: Heuristics for the capacitated plant location model. Eur. J. Oper. Res. 12, 253–261 (1983)

    Article  MATH  Google Scholar 

  • Kennington, J.L., Helgason, R.V.: Algorithms for Network Programming. Wiley, New York (1980)

    MATH  Google Scholar 

  • Kuehn, A.A., Hamburger, M.J.: A heuristic program for locating warehouses. Manag. Sci. 9, 643–666 (1963)

    Article  Google Scholar 

  • Leung, J.M.Y., Magnanti, T.L.: Valid inequalities and facets of the capacitated plant location problem. Math. Program. 44, 271–291 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  • Lorena, L.A.N., Senne, E.L.F.: Improving traditional subgradient scheme for Lagrangean relaxation: an application to location problems. Int. J. Math. Algorithms 1, 133–151 (1999)

    MATH  Google Scholar 

  • Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)

    MATH  Google Scholar 

  • Michel, L., Van Hentenryck, P.: A simple tabu search for warehouse location. Eur. J. Oper. Res. 157, 576–591 (2004)

    Article  MATH  Google Scholar 

  • Mirchandani, P.B., Francis, R.L.: Discrete Location Theory. Wiley, New York (1990)

    MATH  Google Scholar 

  • Nauss, R.M.: An improved algorithm for the capacitated facility location problem. J. Oper. Res. Soc. 29, 1195–1201 (1978)

    MATH  Google Scholar 

  • Owen, S.H., Daskin, M.S.: Strategic facility location: a review. Eur. J. Oper. Res. 111, 423–447 (1998)

    Article  MATH  Google Scholar 

  • Sá, G.: Branch and bound and approximate solutions to the capacitated plant location problem. Oper. Res. 17(6), 1005–1016 (1969)

    Article  Google Scholar 

  • Sun, M.: A tabu search heuristic procedure for the uncapacitated facility location problem. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, pp. 191–211. Kluwer Academic, Boston (2005)

    Chapter  Google Scholar 

  • Sun, M.: Solving uncapacitated facility location problems using tabu search. Comput. Oper. Res. 33(9), 2563–2589 (2006a)

    Article  MathSciNet  MATH  Google Scholar 

  • Sun, M.: A primogenitary linked quad tree data structure and its application to discrete multiple criteria optimization. Ann. Oper. Res. 147(1), 87–107 (2006b)

    Article  MathSciNet  MATH  Google Scholar 

  • Sun, M.: A primogenitary linked quad tree approach for solution storage and retrieval in heuristic combinatorial optimization. Eur. J. Oper. Res. 209(3), 228–240 (2011)

    Article  MATH  Google Scholar 

  • Tuzun, D., Burke, L.I.: A two-phase tabu search approach to the location routing problem. Eur. J. Oper. Res. 116(1), 87–99 (1999)

    Article  MATH  Google Scholar 

  • Van Roy, T.J.: A cross decomposition algorithm for capacitated facility location. Oper. Res. 34(1), 145–163 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  • Watson, J.P., Howe, A.E., Whitley, L.D.: Deconstructing Nowicki and Smutnicki’s i-TSAB tabu search algorithm for the job-shop scheduling problem. Comput. Oper. Res. 33(9), 2623–2644 (2006)

    Article  MATH  Google Scholar 

  • Woodruff, D.L., Zemel, E.: Hashing vectors for tabu search. Ann. Oper. Res. 41(2), 123–137 (1993)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Science and Statistics, College of Business, The University of Texas at San Antonio, San Antonio, TX, 78249-0632, USA

    Minghe Sun

Authors
  1. Minghe Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Minghe Sun.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sun, M. A tabu search heuristic procedure for the capacitated facility location problem. J Heuristics 18, 91–118 (2012). https://doi.org/10.1007/s10732-011-9157-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-011-9157-3

Keywords

Search

Navigation