An iterated tabu search heuristic for the single source capacitated facility location problem

Applied Soft Computing Journal

Volumn 27, Issue , 2015, Pages 169-178

  Ho, Sin C ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Facility location; Heuristic; Tabu search

Indexed keywords

CUSTOMER SATISFACTION; HEURISTIC ALGORITHMS; TABU SEARCH;

CAPACITATED FACILITIES; CAPACITATED FACILITY LOCATION PROBLEMS; FACILITY LOCATIONS; HEURISTIC; HIGH-QUALITY SOLUTIONS; META-HEURISTIC APPROACH; SINGLE SOURCE; TABU SEARCH HEURISTIC;

LOCATION;

EID: 84931260093     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2014.11.004     Document Type: Article

References (23)

1. H. Timmons, Ford to increase its plant capacity in India, 2011 http://www.nytimes.com/2011/07/28/business/ford-to-increase-its-plant-capacity-in-india.html (accessed 15.05.13).
2. A. Klose, A. Drexl, Facility location models for distribution system design, Eur. J. Oper. Res. 162 (1) (2005) 4-29.
3. M.T. Melo, S. Nickel, F. Saldanha-da-Gama, Facility location and supply chain management - A review, Eur. J. Oper. Res. 196 (2) (2009) 401-412.
4. H.A. Eiselt, V. Marianov, Foundations of Location Analysis, Springer, 2011.
5. V.F. Yu, S.-W. Lin, Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery, Appl. Soft Comput. 24 (2014) 284-290.
6. I. Harris, C.L. Mumford, M.M. Naim, A hybrid multi-objective approach to capacitated facility location with flexible store allocation for green logistics modeling, Transp. Res. E 66 (2014) 1-22.
7. A.W. Neebe, M.R. Rao, An algorithm for the fixed-charge assigning users to sources problem, J. Oper. Res. Soc. 34 (11) (1983) 1107-1113.
8. K. Holmberg, M. Rönnqvist, D. Yuan, An exact algorithm for the capacitated facility location problems with single sourcing, Eur. J. Oper. Res. 113 (3) (1999) 544-559.
9. M. Rönnqvist, S. Tragantalerngsak, J. Holt, A repeated matching heuristic for the single-source capacitated facility location problem, Eur. J. Oper. Res. 116 (1) (1999) 51-68.
10. J.A. Díaz, E. Fernández, A branch-and-price algorithm for the single source capacitated plant location problem, J. Oper. Res. Soc. 53 (7) (2002) 728-740.
11. Z. Yang, F. Chu, H. Chen, A cut-and-solve based algorithm for the single-source capacitated facility location problem, Eur. J. Oper. Res. 221 (3) (2012) 521-532.
12. R.D. Galv ao, V. Marianov, Lagrangean relaxation-based techniques for solving facility location problems, in: H.A. Eiselt, V. Marianov (Eds.), Foundations of Location Analysis, Springer, 2011, pp. 391-420.
13. J.G. Klincewicz, H. Luss, A lagrangian relaxation heuristic for capacitated facility location with single-source constraints, J. Oper. Res. Soc. 37 (5) (1986) 495-500.
14. K.S. Hindi, K. Pienkosz, Efficient solution of large scale, single-source, capacitated plant location problems, J. Oper. Res. Soc. 50 (3) (1999) 268-274.
15. M.J. Cortinhal, M.E. Captivo, Upper and lower bounds for the single source capacitated location problem, Eur. J. Oper. Res. 151 (2) (2003) 333-351.
16. H. Delmaire, J.A. Díaz, E. Fernández, M. Ortega, Comparing new heuristics for the pure integer capacitated plant location problem, Invest. Oper. 8 (1-3) (1999) 217-242.
17. H. Delmaire, J.A. Díaz, E. Fernández, M. Ortega, Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem, INFOR 37 (3) (1999) 194-225.
18. R.K. Ahuja, J.B. Orlin, S. Pallottino, M.P. Scaparra, M.G. Scutellà, A multi-exchange heuristic for the single-source capacitated facility location problem, Manage. Sci. 50 (6) (2004) 749-760.
19. I.A. Contreras, J.A. Díaz, Scatter search for the single source capacitated facility location problem, Ann. Oper. Res. 157 (1) (2008) 73-89.
20. C.-H. Chen, C.-J. Ting, Combining lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem, Transp. Res. E 44 (6) (2008) 1099-1122.
21. H.R. Lourenc¸o, O. Martin, T. Stützle, Iterated local search, in: F. Glover, G. Kochenberger (Eds.), Handbook of Metaheuristics, Kluwer Academic Publishers, 2003, pp. 321-353.
22. F. Glover, Future paths for integer programming and links to artificial intelligence, Comput. Oper. Res. 13 (5) (1986) 533-549.
23. G. Dueck, New optimization heuristics: The great deluge algorithm and the record-to-record travel, J. Comput. Phys. 104 (1) (1993) 86-92.