A tabu search heuristic procedure for the capacitated facility location problem

Journal of Heuristics

Volumn 18, Issue 1, 2012, Pages 91-118

  Sun, Minghe ^a  

^a UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

Author keywords

Capacitated facility location; Metaheuristics; Path relinking; Quad tree; Solution reconciling; Tabu search

Indexed keywords

CAPACITATED FACILITY LOCATION PROBLEMS; COMPUTATIONAL EXPERIMENT; CPU TIME; FACILITY LOCATIONS; LAGRANGEAN RELAXATION; LOWER BOUNDS; MEMORY STRUCTURE; META HEURISTICS; OPTIMAL SOLUTIONS; PATH RELINKING; PROBLEM STRUCTURE; QUAD TREES; SEARCH PROCESS; SPECIALIZED NETWORKS; SUBGRADIENT; TABU SEARCH HEURISTIC; TEST PROBLEM; TOTAL COSTS; TRANSPORTATION PROBLEM;

FORESTRY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; LOCATION; PROBLEM SOLVING;

TABU SEARCH;

ALGORITHMS; FORESTRY; PROBLEM SOLVING;

EID: 84856529637     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-011-9157-3     Document Type: Article

References (44)

1. Aardal, K.: Capacitated facility location: Separation algorithm and computational experience. Math. Program. 81, 149-175 (1998) (Pubitemid 128393275)
2. Akinc, U., Khumawala, M.: An efficient branch and bound algorithm for the capacitated warehouse location problem. Manag. Sci. 23, 585-594 (1977)
3. 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)
4. Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87, 385-399 (2000)
5. Barahona, F., Chudak, F.A.: Near-optimal solutions to large scale facility location problems. Discrete Optim. 2(1), 35-50 (2005) (Pubitemid 40357089)
6. Beasley, J.E.: OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069-1072 (1990)
7. Beasley, J.E.: Lagrangian heuristics for location problems. Eur. J. Oper. Res. 65, 383-399 (1993)
8. Carlton, W.B., Barnes, J.W.: A note on hashing functions and tabu search algorithms. Eur. J. Oper. Res. 95, 237-239 (1996) (Pubitemid 126391985)
9. Christofides, N., Beasley, J.E.: Extensions to a Lagrangean location problem. Eur. J. Oper. Res. 12, 19-28 (1983)
10. 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)
11. Daskin, M.S.: Network and Discrete Location, Models, Algorithms, and Applications. Wiley, New York (1995)
12. 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)
13. Domschke,W., Drexl, A.: Add-heuristics starting procedures for capacitated plant location models. Eur. J. Oper. Res. 21, 47-53 (1985) (Pubitemid 15548360)
14. Drezner, Z., Hamacher, H.W.: Facility Location: Theory and Algorithms. Springer, Berlin (2001)
15. Feldman, E., Lehrer, F.A., Ray, T.L.: Warehouse location under continuous economies of scale. Manag. Sci. 12, 670-684 (1966)
16. 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)
17. 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)
18. Geoffrion, A.M., McBride, R.: Lagrangian relaxation applied to capacitated facility location problems. AIIE Trans. 10, 40-47 (1978) (Pubitemid 8597190)
19. Ghosh, D.: Neighborhood search heuristics for the uncapacitated facility location problem. Eur. J. Oper. Res. 150, 150-162 (2003)
20. Glover, F.: Tabu search, Part I. ORSA J. Comput. 1, 190-206 (1989)
21. Glover, F.: Tabu search, Part II. ORSA J. Comput. 2, 4-32 (1990)
22. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Hingham (1997)
23. Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Control Cybern. 29(3), 653-684 (2000)
24. Grolimund, S., Ganascia, J.G.: Driving tabu search with case-based reasoning. Eur. J. Oper. Res. 103, 326-338 (1997) (Pubitemid 127400424)
25. 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)
26. Jacobsen, S.K.: Heuristics for the capacitated plant location model. Eur. J. Oper. Res. 12, 253-261 (1983)
27. Kennington, J.L., Helgason, R.V.: Algorithms for Network Programming. Wiley, New York (1980)
28. Kuehn, A.A., Hamburger, M.J.: A heuristic program for locating warehouses. Manag. Sci. 9, 643-666 (1963)
29. Leung, J.M.Y., Magnanti, T.L.: Valid inequalities and facets of the capacitated plant location problem. Math. Program. 44, 271-291 (1989)
30. 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)
31. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)
32. Michel, L., Van Hentenryck, P.: A simple tabu search for warehouse location. Eur. J. Oper. Res. 157, 576-591 (2004)
33. Mirchandani, P.B., Francis, R.L.: Discrete Location Theory. Wiley, New York (1990)
34. Nauss, R.M.: An improved algorithm for the capacitated facility location problem. J. Oper. Res. Soc. 29, 1195-1201 (1978)
35. Owen, S.H., Daskin, M.S.: Strategic facility location: a review. Eur. J. Oper. Res. 111, 423-447 (1998) (Pubitemid 128410903)
36. Sá, G.: Branch and bound and approximate solutions to the capacitated plant location problem. Oper. Res. 17(6), 1005-1016 (1969)
37. 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)
38. Sun, M.: Solving uncapacitated facility location problems using tabu search. Comput. Oper. Res. 33(9), 2563-2589 (2006a) (Pubitemid 43098901)
39. 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) (Pubitemid 44496802)
40. 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)
41. 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)
42. Van Roy, T.J.: A cross decomposition algorithm for capacitated facility location. Oper. Res. 34(1), 145-163 (1986)
43. 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) (Pubitemid 43102511)
44. Woodruff, D.L., Zemel, E.: Hashing vectors for tabu search. Ann. Oper. Res. 41(2), 123-137 (1993)