Combined simulated annealing algorithm for the discrete facility location problem

The Scientific World Journal

Volumn 2012, Issue , 2012, Pages

  Qin, Jin ^a   Ni, Ling Lin ^a   Shi, Feng ^a,b  

^a CENTRAL SOUTH UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY OF FINANCE AND ECONOMICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMBINED SIMULATED ANNEALING ALGORITHM; CONSUMER; COST; DISCRETE FACILITY LOCATION PROBLEM; MATHEMATICAL MODEL; TEMPERATURE; BIOLOGY; COMPUTER SIMULATION; CONSTRUCTION WORK AND ARCHITECTURAL PHENOMENA; INTERNET; METHODOLOGY; REPRODUCIBILITY; SEARCH ENGINE; STANDARD; STATISTICAL MODEL; TIME;

ALGORITHMS; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; FACILITY DESIGN AND CONSTRUCTION; INTERNET; MODELS, STATISTICAL; REPRODUCIBILITY OF RESULTS; SEARCH ENGINE; TEMPERATURE; TIME FACTORS;

EID: 84867753951     PISSN: None     EISSN: 1537744X     Source Type: Journal    
DOI: 10.1100/2012/576392     Document Type: Article

References (33)

1. Melo M. T., Nickel S., Saldanha-da-Gama F., Facility location and supply chain managementa review. European Journal of Operational Research 2009 196 2 401 412 2-s2.0-58149242603 10.1016/j.ejor.2008.05.007
2. Daskin M. S., What you should know about location modeling. Naval Research Logistics 2008 55 4 283 294 2-s2.0-43949083771 10.1002/nav.20284 (Pubitemid 351702824)
3. Shmoys D. B., Tardos E., Aardal K., Approximation algorithms for facility location problems. Proceedings of the 29th Annual ACM Symposium on Theory of Computing May 1997 ACM Press 265 274 2-s2.0-0030645561
4. Gabor A. F., van Ommeren J. K. C. W., A new approximation algorithm for the multilevel facility location problem. Discrete Applied Mathematics 2010 158 5 453 460 2-s2.0-75449119640 10.1016/j.dam.2009.11.007
5. Wang Z., Du D., Gabor A. F., Xu D., An approximation algorithm for the κ -level stochastic facility location problem. Operations Research Letters 2010 38 5 386 389 2-s2.0-77956340738 10.1016/j.orl.2010.04.010
6. Yan L., Chrobak M., Approximation algorithms for the Fault-Tolerant Facility Placement problem. Information Processing Letters 2011 111 11 545 549 2-s2.0-79952717490 10.1016/j.ipl.2011.03.005
7. Marín A., The discrete facility location problem with balanced allocation of customers. European Journal of Operational Research 2011 210 1 27 38 2-s2.0-78650922805 10.1016/j.ejor.2010.10.012
8. Li Y., Xub D., Du D., Improved approximation algorithms for the robust fault-tolerant facility location problem. Information Processing Letters 2012 112 10 361 364 10.1016/j.ipl.2012.02.004
9. Fotakis D., A primal-dual algorithm for online non-uniform facility location. Journal of Discrete Algorithms 2007 5 1 141 148 2-s2.0-33947608611 10.1016/j.jda.2006.03.001 (Pubitemid 46482387)
10. Dias J., Eugénia Captivo M., Clímaco J., Efficient primal-dual heuristic for a dynamic location problem. Computers and Operations Research 2007 34 6 1800 1823 2-s2.0-33749673570 10.1016/j.cor.2005.07.005 (Pubitemid 44556977)
11. Du D., Lu R., Xu D., A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica 2012 63 1-2 191 200 2-s2.0-79955652717 10.1007/s00453-011-9526-1
12. Jain K., Mahdian M., Saberi A., A new greedy approach for facility location problems. Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC '02) May 2002 731 740 2-s2.0-0036041233 (Pubitemid 35009436)
13. Jain K., Mahdian M., Markakis E., Saberi A., Vazirani V. V., Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM 2003 50 6 795 824 2-s2.0-3142755912 10.1145/950620.950621
14. Mahdian M., Ye Y., Zhang J., Approximation algorithms for metric facility location problems. SIAM Journal on Computing 2006 36 2 411 432 2-s2.0-33847165220 10.1137/S0097539703435716 (Pubitemid 46627294)
15. Guha S., Khuller S., Greedy strikes back: improved facility location algorithms. Journal of Algorithms 1999 31 1 228 248 2-s2.0-0000182223 (Pubitemid 129609603)
16. Zhang J., Chen B., Ye Y., A multiexchange local search algorithm for the capacitated facility location problem. Mathematics of Operations Research 2005 30 2 389 403 2-s2.0-31144452012 10.1287/moor.1040.0125 (Pubitemid 43126838)
17. Sankaran J. K., On solving large instances of the capacitated facility location problem. European Journal of Operational Research 2007 178 3 663 676 2-s2.0-33751095680 10.1016/j.ejor.2006.01.035 (Pubitemid 44765137)
18. Nguyen V. P., Prins C., Prodhon C., A multi-start evolutionary local search for the two-echelon location routing problem. Engineering Applications of Artificial Intelligence 2012 25 1 56 71 10.1016/j.engappai.2011.09.012
19. Jayaraman V., Ross A., A simulated annealing methodology to distribution network design and management. European Journal of Operational Research 2003 144 3 629 645 2-s2.0-0037290097 10.1016/S0377-2217(02)00153-4 (Pubitemid 35276387)
20. Arostegui M. A. Jr., Kadipasaoglu S. N., Khumawala B. M., An empirical comparison of Tabu Search, Simulated Annealing, and Genetic Algorithms for facilities location problems. International Journal of Production Economics 2006 103 2 742 754 2-s2.0-33745835822 10.1016/j.ijpe.2005.08.010 (Pubitemid 44038504)
21. Ahin R., A simulated annealing algorithm for solving the bi-objective facility layout problem. Expert Systems with Applications 2011 38 4 4460 4465 2-s2.0-78650704996 10.1016/j.eswa.2010.09.117
22. Solimanpur M., Kamran M. A., Solving facilities location problem in the presence of alternative processing routes using a genetic algorithm. Computers & Industrial Engineering 2010 59 4 830 839 2-s2.0-78049355695 10.1016/j.cie.2010.08.010
23. Kirkpatrick S., Gelett C. D., Vecchi M. P., Optimization by simulated annealing. Science 1983 220 4598 671 680 10.1126/science.220.4598.671
24. Bertsimas D., Tsitsiklis J., Simulated annealing. Statistical Science 1993 8 1 10 15 10.1214/ss/1177011077
25. Boissin N., Lutton J. L., A parallel simulated annealing algorithm. Parallel Computing 1993 19 8 859 872 2-s2.0-38249003815
26. Tian P., Ma J., Zhang D. M., Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: an investigation of generation mechanism. European Journal of Operational Research 1999 118 1 81 94 2-s2.0-0032688343 10.1016/S0377-2217(98)00308-7
27. Suman B., Hoda N., Jha S., Orthogonal simulated annealing for multiobjective optimization. Computers & Chemical Engineering 2010 34 10 1618 1631 2-s2.0-77956192224 10.1016/j.compchemeng.2009.11.015
28. Xinchao Z., Simulated annealing algorithm with adaptive neighborhood. Applied Soft Computing Journal 2011 11 2 1827 1836 2-s2.0-78751613509 10.1016/j.asoc.2010.05.029
29. Tavares R. S., Martins T. C., Tsuzuki M. S. G., Simulated annealing with adaptive neighborhood: a case study in off-line robot path planning. Expert Systems with Applications 2011 38 4 2951 2965 2-s2.0-78650680547 10.1016/j.eswa.2010.08.084
30. Qin J., Shi F., Miao L. X., Tan G. J., Optimal model and algorithm for multi-commodity logistics network design considering stochastic demand and inventory control. System Engineering 2009 29 4 176 183 2-s2.0-65649097239
31. Beasley J. E., Lagrangean heuristics for location problems. European Journal of Operational Research 1993 65 3 383 399 2-s2.0-0027557167
32. Ghosh D.,. 2001
33. Ghosh D., Neighborhood search heuristics for the uncapacitated facility location problem. European Journal of Operational Research 2003 150 1 150 162 2-s2.0-0038241899 10.1016/S0377-2217(02)00504-0