Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2012, Article ID 576392, 7 pages
http://dx.doi.org/10.1100/2012/576392
Research Article

Combined Simulated Annealing Algorithm for the Discrete Facility Location Problem

1School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China
2Business Administration College, Zhejiang University of Finance & Economics, Hangzhou 310018, China

Received 21 May 2012; Accepted 28 June 2012

Academic Editors: C. W. Ahn, B. Alatas, P. Bala, P.-A. Hsiung, and Y. Jiang

Copyright © 2012 Jin Qin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. T. Melo, S. Nickel, and F. Saldanha-da-Gama, “Facility location and supply chain management—a review,” European Journal of Operational Research, vol. 196, no. 2, pp. 401–412, 2009. View at Publisher · View at Google Scholar · View at Scopus
  2. M. S. Daskin, “What you should know about location modeling,” Naval Research Logistics, vol. 55, no. 4, pp. 283–294, 2008. View at Publisher · View at Google Scholar · View at Scopus
  3. D. B. Shmoys, E. Tardos, and K. Aardal, “Approximation algorithms for facility location problems,” in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265–274, ACM Press, May 1997. View at Scopus
  4. A. F. Gabor and J. K. C. W. van Ommeren, “A new approximation algorithm for the multilevel facility location problem,” Discrete Applied Mathematics, vol. 158, no. 5, pp. 453–460, 2010. View at Publisher · View at Google Scholar · View at Scopus
  5. Z. Wang, D. Du, A. F. Gabor, and D. Xu, “An approximation algorithm for the κ-level stochastic facility location problem,” Operations Research Letters, vol. 38, no. 5, pp. 386–389, 2010. View at Publisher · View at Google Scholar · View at Scopus
  6. L. Yan and M. Chrobak, “Approximation algorithms for the Fault-Tolerant Facility Placement problem,” Information Processing Letters, vol. 111, no. 11, pp. 545–549, 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. A. Marín, “The discrete facility location problem with balanced allocation of customers,” European Journal of Operational Research, vol. 210, no. 1, pp. 27–38, 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. Y. Li, D. Xub, and D. Du, “Improved approximation algorithms for the robust fault-tolerant facility location problem,” Information Processing Letters, vol. 112, no. 10, pp. 361–364, 2012. View at Publisher · View at Google Scholar
  9. D. Fotakis, “A primal-dual algorithm for online non-uniform facility location,” Journal of Discrete Algorithms, vol. 5, no. 1, pp. 141–148, 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. J. Dias, M. Eugénia Captivo, and J. Clímaco, “Efficient primal-dual heuristic for a dynamic location problem,” Computers and Operations Research, vol. 34, no. 6, pp. 1800–1823, 2007. View at Publisher · View at Google Scholar · View at Scopus
  11. D. Du, R. Lu, and D. Xu, “A primal-dual approximation algorithm for the facility location problem with submodular penalties,” Algorithmica, vol. 63, no. 1-2, pp. 191–200, 2012. View at Publisher · View at Google Scholar · View at Scopus
  12. K. Jain, M. Mahdian, and A. Saberi, “A new greedy approach for facility location problems,” in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC '02), pp. 731–740, May 2002. View at Scopus
  13. K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V. V. Vazirani, “Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP,” Journal of the ACM, vol. 50, no. 6, pp. 795–824, 2003. View at Publisher · View at Google Scholar · View at Scopus
  14. M. Mahdian, Y. Ye, and J. Zhang, “Approximation algorithms for metric facility location problems,” SIAM Journal on Computing, vol. 36, no. 2, pp. 411–432, 2006. View at Publisher · View at Google Scholar · View at Scopus
  15. S. Guha and S. Khuller, “Greedy strikes back: improved facility location algorithms,” Journal of Algorithms, vol. 31, no. 1, pp. 228–248, 1999. View at Google Scholar · View at Scopus
  16. J. Zhang, B. Chen, and Y. Ye, “A multiexchange local search algorithm for the capacitated facility location problem,” Mathematics of Operations Research, vol. 30, no. 2, pp. 389–403, 2005. View at Publisher · View at Google Scholar · View at Scopus
  17. J. K. Sankaran, “On solving large instances of the capacitated facility location problem,” European Journal of Operational Research, vol. 178, no. 3, pp. 663–676, 2007. View at Publisher · View at Google Scholar · View at Scopus
  18. V. P. Nguyen, C. Prins, and C. Prodhon, “A multi-start evolutionary local search for the two-echelon location routing problem,” Engineering Applications of Artificial Intelligence, vol. 25, no. 1, pp. 56–71, 2012. View at Publisher · View at Google Scholar
  19. V. Jayaraman and A. Ross, “A simulated annealing methodology to distribution network design and management,” European Journal of Operational Research, vol. 144, no. 3, pp. 629–645, 2003. View at Publisher · View at Google Scholar · View at Scopus
  20. M. A. Arostegui Jr., S. N. Kadipasaoglu, and B. M. Khumawala, “An empirical comparison of Tabu Search, Simulated Annealing, and Genetic Algorithms for facilities location problems,” International Journal of Production Economics, vol. 103, no. 2, pp. 742–754, 2006. View at Publisher · View at Google Scholar · View at Scopus
  21. R. Şahin, “A simulated annealing algorithm for solving the bi-objective facility layout problem,” Expert Systems with Applications, vol. 38, no. 4, pp. 4460–4465, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. M. Solimanpur and M. A. Kamran, “Solving facilities location problem in the presence of alternative processing routes using a genetic algorithm,” Computers & Industrial Engineering, vol. 59, no. 4, pp. 830–839, 2010. View at Publisher · View at Google Scholar · View at Scopus
  23. S. Kirkpatrick, C. D. Gelett, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar
  24. D. Bertsimas and J. Tsitsiklis, “Simulated annealing,” Statistical Science, vol. 8, no. 1, pp. 10–15, 1993. View at Publisher · View at Google Scholar
  25. N. Boissin and J. L. Lutton, “A parallel simulated annealing algorithm,” Parallel Computing, vol. 19, no. 8, pp. 859–872, 1993. View at Google Scholar · View at Scopus
  26. P. Tian, J. Ma, and D. M. Zhang, “Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: an investigation of generation mechanism,” European Journal of Operational Research, vol. 118, no. 1, pp. 81–94, 1999. View at Publisher · View at Google Scholar · View at Scopus
  27. B. Suman, N. Hoda, and S. Jha, “Orthogonal simulated annealing for multiobjective optimization,” Computers & Chemical Engineering, vol. 34, no. 10, pp. 1618–1631, 2010. View at Publisher · View at Google Scholar · View at Scopus
  28. Z. Xinchao, “Simulated annealing algorithm with adaptive neighborhood,” Applied Soft Computing Journal, vol. 11, no. 2, pp. 1827–1836, 2011. View at Publisher · View at Google Scholar · View at Scopus
  29. R. S. Tavares, T. C. Martins, and M. S. G. Tsuzuki, “Simulated annealing with adaptive neighborhood: a case study in off-line robot path planning,” Expert Systems with Applications, vol. 38, no. 4, pp. 2951–2965, 2011. View at Publisher · View at Google Scholar · View at Scopus
  30. J. Qin, F. Shi, L. X. Miao, and G. J. Tan, “Optimal model and algorithm for multi-commodity logistics network design considering stochastic demand and inventory control,” System Engineering, vol. 29, no. 4, pp. 176–183, 2009. View at Google Scholar · View at Scopus
  31. J. E. Beasley, “Lagrangean heuristics for location problems,” European Journal of Operational Research, vol. 65, no. 3, pp. 383–399, 1993. View at Google Scholar · View at Scopus
  32. D. Ghosh, 2001, http://www.mpi-inf.mpg.de/departments/d1/projects/benchmarks/UflLib/ORLIB.html.
  33. D. Ghosh, “Neighborhood search heuristics for the uncapacitated facility location problem,” European Journal of Operational Research, vol. 150, no. 1, pp. 150–162, 2003. View at Publisher · View at Google Scholar · View at Scopus