Un problema de localización de plantas de gran escala

 

Kaydedildi:
Detaylı Bibliyografya
Yazarlar: Gutiérrez Andrade, Miguel Ángel, de los Cobos Silva, Sergio, Pérez Salvador, Blanca Rosa, Goddard, John
Materyal Türü: artículo original
Durum:Versión publicada
Yayın Tarihi:2000
Diğer Bilgiler: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.
Ülke:Portal de Revistas UCR
Kurum:Universidad de Costa Rica
Repositorio:Portal de Revistas UCR
Dil:Español
OAI Identifier:oai:portal.ucr.ac.cr:article/184
Online Erişim:https://revistas.ucr.ac.cr/index.php/matematica/article/view/184
Anahtar Kelime:facility location
simulated annealing
heuristics
localización
sobrecalentamiento simulado
recocido simulado
heurística