Un problema de localización de plantas de gran escala
সংরক্ষণ করুন:
| লেখক: | , , , |
|---|---|
| বিন্যাস: | artículo original |
| বর্তমান অবস্থা: | Versión publicada |
| প্রকাশনার তারিখ: | 2000 |
| বিবরন: | 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. |
| দেশ: | Portal de Revistas UCR |
| প্রতিষ্ঠান: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| ভাষা: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/184 |
| অনলাইন ব্যবহার করুন: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/184 |
| মুখ্য শব্দ: | facility location simulated annealing heuristics localización sobrecalentamiento simulado recocido simulado heurística |