Keywords
simulated annealing
heuristics
localización
sobrecalentamiento simulado
recocido simulado
heurística
How to Cite
Abstract
We develop an heuristic algorithm and its implementation for solving a large scale facility location problem, where there can arise over 640 facilities to be located in Mexico. Originally, we tried to obtain an exact solution to the problem, using two classical techniques: Benders decomposition, and branch and bound. Both techniques are adequate and efficient for solving low-scale problems, but computer implementations for this problem did not converge after several hours of computing. Hence, we needed a good solution even if it was not exact. We used the simulated annealing technique with excellent results.
References
Aarts, E.; Korst, J. (1989) Simulated Annealing and Boltzmann Machines. John Wiley & Sons, Chichester.
Emden-Weinert, T., Proksch, M., (1999) “Practice simulated annealing for the airline crew scheduling problem”, Journal of Heuristics 5(4): 419–436.
Khumawala, B.M. (1972) “An efficient branch and bound algorithm for the warehouse location problem”, Management Science 18: 718–731.
Geraldo, R.; Mateus, G.R.; Luna, H.; Sirihal, A. (2000) “Heuristics for distribution network design in telecommunication”, Journal of Heuristics 6(1): 133–150.
Mirchandani, P.B.; Reilly, J.M. (1986) “Spatial nodes in discrete location problems”, Annals of Operations Research 6: 203–222.
Mirchandani, P.B.; Francis, R.L. (Eds.) (1990) Discrete Location Theory. John Wiley & Sons, New York.
Privault, C.; Herault, L. (1998) “Solving a real world assignment problem with a metaheuristic”, Journal of Heuristics 4(4): 383–398.