Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing

International Journal of Production Research

Volumn 44, Issue 22, 2006, Pages 4773-4791

  Yigit, Vecihi ^a   Aydin, M Emin ^b   Turkbey, Orhan ^c  

^a ATATÜRK UNIVERSITY   (Turkey)

^b LONDON SOUTH BANK UNIVERSITY   (United Kingdom)

^c GAZI UNIVERSITY   (Turkey)

Author keywords

Evolutionary algorithms; Simulated annealing; Uncapacitated facility locations

Indexed keywords

METAHEURISTICS; UNCAPACITATED FACILITY LOCATION (UFL) PROBLEMS; UNCAPACITATED FACILITY LOCATIONS;

ALGORITHMS; BENCHMARKING; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; SIMULATED ANNEALING;

OPERATIONS RESEARCH;

EID: 33749568555     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540600621003     Document Type: Article

References (38)

1. Al-Sultan, K.S. and Al-Fawzan, M.A., A tabu search approach to the uncapacitated facility location problem. Ann. Oper. Res., 1999, 86, 91-103.
2. Antunes, A. and Peeters, D., On solving complex multi-period location models using simulated annealing. Eur. J. Oper. Res., 2001, 130, 190-201.
3. Aydin, M.E. and Fogarty, T.C., A modular simulated annealing algorithm for multi-agent systems: a job shop scheduling application. J. Intell. Mfg, 2004, 15, 805-814.
4. Back, T., Hammel, U. and Schwefel, H.P., Evolutionary computation: comments on the history and current state. IEEE Trans. Evot. Comput., 1997, 1, 3-17.
5. Beasley, J.E., An algorithm for solving large capacitated warehouse location problems. Eur. J. Oper. Res., 1988, 33, 314-325.
6. Beasley, J.E., Lagrangean heuristic for location problems. Eur. J. Oper. Res., 1993, 65, 383-399.
7. Beasley, J.E., Obtaining test problems via Internet. J. Glob. Optim., 1996, 8, 429-433.
8. Beyera, H.G., Schwefela, H.P. and Wegenerb, I., How to analyse evolutionary algorithms. Theor. Comput. Sci., 2002, 287, 101-130.
9. Calegari, P., Coray, G., Hertz, A., Kobler, D. and Kuonen, P., A taxonomy of evolutionary algorithms in combinatorial optimization. J. Heuristics, 1999, 5, 145-158.
10. Drezner, Z., Facility Location: A Survey of Applications and Methods, pp. 22-30, 1995 (Springer: New York).
11. Eiben, A.E. and Schoenauer, M., Evolutionary computing. Inf. Process. Lett., 2002, 82, 1-6.
12. Erlenkotter, D., A dual-based procedure for uncapacitated facility location. Oper. Res., 1978, 26, 992-1009.
13. Fogel, D.B., An introduction to simulated evolutionary optimization. IEEE Trans. Neural Networks, 1994, 5, 3-14.
14. Francis, R.L., McGinnis, L.F. and White, J.A., Locational analysis. Eur. J. Oper. Res., 1983, 12, 220-252.
15. Galvao, R.D. and Raggi, L.A., A method for solving to optimality uncapacitated location problems. Ann. Oper. Res., 1989, 18, 225-244.
16. Gao, L.L. and Robinson, E., Uncapacitated facility location: general solution procedure and computational experience. Eur. J. Oper. Res., 1994a, 76, 410-427.
17. Ghosh, D., Neighborhood search heuristics for the uncapacitated facility location problem. Eur. J. Oper. Ras., 2003 (in press).
18. Goldengorin, B., Ghosh, D. and Sierksma, G., Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res., 2003a, 30, 967-981.
19. Goldengorin, B., Tussen, G.A. and Sierksma, G., Solving the simple plant location problem using a data correcting approach. J. glob. Optim., 2003b, 25, 377-406.
20. Guignard, M.A., Lagrangean dual ascent algorithm for simple plant location problems. Eur. J. Oper. Res., 1988, 35, 193-200.
21. Hertz, A. and Kobler, D., A framework for the description of evolutionary algorithms. Eur. J. Oper. Res., 2000, 126, 1-12.
22. Jaramillo, H.J., Bhadury, J. and Batta, R., On the use of genetic algorithms to solve location problems. Comput. Oper. Res., 2002, 29, 761-779.
23. Kirkpatrick, S., Gelatt, J.R. and Vecchi, C.D., Optimization by simulated annealing. Science, 1983, 220, 671-680.
24. Klose, A., A branch and bound algorithm for an uncapacitated facility location problem with a side constraint. Int. Trans. Oper. Res., 1998, 5, 155-168.
25. Koerkel, M., On the exact solution of large-scale simple plant location problems. Eur. J. Oper. Res., 1989, 39, 157-173.
26. Kolonko, M., Some new results on simulated annealing applied to job shop scheduling problem. Eur. J. Oper. Res., 1999, 113, 123-136.
27. Korupolu, M.R. and Plaxton, C.G., Analysis of a local search heuristic for facility location problems. J. Algorithms, 2000, 37, 146-188.
28. Kramp, J. and Pruzan, P.M., The simple plant location problem: survey and synthesis. Eur. J. Oper. Res., 1983, 12, 36-81.
29. Kratica, J., Tosic, D., Filipovic, V. and Ljubic, I., Solving the simple plant location problem by genetic algorithms. RAIRO - Oper. Res., 2001, 35, 127-142.
30. Laurent, M. and Hentenryck, P.V., A simple tabu search for warehouse location. Eur. J. Oper. Res., 2004, 157, 576-591.
31. Ma, J., Tian, P. and Zhang, D., Global optimization by Darwin and Boltzmann mixed strategy. Comput. Oper. Res., 2000, 27, 143-159.
32. Mirchandani, P.B. and Francis, R.L., Discrete Location Theory, pp. 119-171, 1990 (Wiley: New York).
33. Moilanen, A., Simulated evolutionary optimization and local search: introduction and application to tree search. Cladistics, 2001, 17, 12-25.
34. Reeves, C., Modern Heuristic Techniques for Combinatorial Problems, 1993 (Wiley: New York).
35. Simao, H.P. and Thizy, J.M., A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem. Oper. Res. Lett., 1989, 8, 279-286.
36. Tian, P., Jian Ma and Dong-Ma Zhang, Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: an investigation of generation mechanism. Eur. J. Oper. Res., 1999, 118, 81-94.
37. Vaithyanathan, S., Burke, L. and Magent, M.A., Massively parallel analog tabu search using neural networks applied to simple plant location problem. Eur. J. Oper. Res., 1996, 93, 317-330.
38. Wong, S.Y.W., Hybrid simulated annealing/genetic algorithm approach to short term hydro-thermal scheduling with multiple thermal plants. Electric. Power Energy Syst., 2001, 23, 565-575.