Un problema de localización de plantas de gran escala
Guardado en:
| Autores: | , , , |
|---|---|
| Formáid: | artículo original |
| Stádas: | Versión publicada |
| Fecha de Publicación: | 2000 |
| Cur Síos: | 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. |
| País: | Portal de Revistas UCR |
| Institiúid: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Teanga: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/184 |
| Rochtain Ar Líne: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/184 |
| Palabra clave: | facility location simulated annealing heuristics localización sobrecalentamiento simulado recocido simulado heurística |