Una aproximación a la heuristica y metaheuristicas
When we are discussing problems which have an easy space of possible solutions to know, our search is reduced to find an optimal (A high point or a mínimum point ) which gives a solution to the problem once some restrictions were given. However there are complex problems of combinatorial optimizatio...
Saved in:
| Main Author: | |
|---|---|
| Format: | info:eu-repo/semantics/publishedVersion |
| Language: | spa |
| Published: |
Universidad Antonio Nariño
2021
|
| Subjects: | |
| Online Access: | http://revistas.uan.edu.co/index.php/ingeuan/article/view/217 http://repositorio.uan.edu.co/handle/123456789/3893 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1812648527419932672 |
|---|---|
| author | de Antonio Suárez, Orlando |
| author_facet | de Antonio Suárez, Orlando |
| author_sort | de Antonio Suárez, Orlando |
| collection | DSpace |
| description | When we are discussing problems which have an easy space of possible solutions to know, our search is reduced to find an optimal (A high point or a mínimum point ) which gives a solution to the problem once some restrictions were given. However there are complex problems of combinatorial optimization at various fields like economy, the commerce, the engineering, re-engineering of software, communications, the industry or the medicine, the fact that often they are very difficult from resolving in practice and whose mathematical modeling Formulated coherently it does not allows a solution with the analytical tools near by the hands.
Because of that testing the actual complexity generated in the institutions and business world, as the diversity in the phases in which de process of institutional change develops, it becomes necessary the development and use of methods that allow the management of problematic situations from the set of its parts and also from different point of views.
Because of that low performance of the exact algorithms for many problems, there has been developed multiple types of approximated algorithms, that provides high quality solutions for this combinatorial problems (though not necessarily the optimal) in a short computational time, these algorithms include the denominated heuristics techniques and metaheuristics. |
| format | info:eu-repo/semantics/publishedVersion |
| id | repositorio.uan.edu.co-123456789-3893 |
| institution | Repositorio Digital UAN |
| language | spa |
| publishDate | 2021 |
| publisher | Universidad Antonio Nariño |
| record_format | dspace |
| spelling | repositorio.uan.edu.co-123456789-38932024-10-09T23:24:43Z Una aproximación a la heuristica y metaheuristicas de Antonio Suárez, Orlando Heuristics Hard Problems algorithms best solution special produceres Heurísticas Problemas Duros Algoritmos mejores soluciones procedimientos especiales When we are discussing problems which have an easy space of possible solutions to know, our search is reduced to find an optimal (A high point or a mínimum point ) which gives a solution to the problem once some restrictions were given. However there are complex problems of combinatorial optimization at various fields like economy, the commerce, the engineering, re-engineering of software, communications, the industry or the medicine, the fact that often they are very difficult from resolving in practice and whose mathematical modeling Formulated coherently it does not allows a solution with the analytical tools near by the hands. Because of that testing the actual complexity generated in the institutions and business world, as the diversity in the phases in which de process of institutional change develops, it becomes necessary the development and use of methods that allow the management of problematic situations from the set of its parts and also from different point of views. Because of that low performance of the exact algorithms for many problems, there has been developed multiple types of approximated algorithms, that provides high quality solutions for this combinatorial problems (though not necessarily the optimal) in a short computational time, these algorithms include the denominated heuristics techniques and metaheuristics. Cuando abordamos problemas cuyo espacio de posibles soluciones se nos facilita conocer, nuestra búsqueda se reduce a hallar un óptimo (un máximo o un mínimo) que de una solución al problema dadas unas restricciones. Sin embargo existen problemas de optimización combinatoria complejos en diversos campos como la economía, el comercio, la ingeniería, re-ingeniería de software, comunicaciones, la industria o la medicina, que a menudo son muy difíciles de resolver en la práctica y cuyo modelamiento matemático “Formulado coherentemente1 ”, no permite una solución con las herramientas analíticas al alcance. Por eso evaluando la complejidad actual generada en las instituciones y el mundo empresarial, así como la diversidad de fases en que se desarrolla el proceso de cambio institucional, se hace necesario el desarrollo y uso de métodos que permitan el manejo de situaciones problémicas desde el conjunto de sus partes y desde distintos puntos de vista. Debido a ese bajo rendimiento de los algoritmos exactos para muchos problemas, se han desarrollado un gran número de algoritmos aproximados, que proporcionan soluciones de alta calidad para estos problemas combinatorios (aunque no necesariamente la óptima) en un tiempo computacional breve; estos algoritmos incluyen las denominadas técnicas heurísticas y Metaheurísticas. 2021-06-16T13:52:56Z 2021-06-16T13:52:56Z 2014-03-04 info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:eu-repo/semantics/article http://purl.org/coar/version/c_970fb48d4fbd8a85 http://revistas.uan.edu.co/index.php/ingeuan/article/view/217 http://repositorio.uan.edu.co/handle/123456789/3893 spa http://revistas.uan.edu.co/index.php/ingeuan/article/view/217/179 Acceso abierto Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) https://creativecommons.org/licenses/by-nc-sa/4.0/ info:eu-repo/semantics/openAccess http://purl.org/coar/access_right/c_abf2 application/pdf Universidad Antonio Nariño 2346-1446 2145-0935 INGE@UAN - TENDENCIAS EN LA INGENIERÍA; Vol. 1 Núm. 2 (2011) |
| spellingShingle | Heuristics Hard Problems algorithms best solution special produceres Heurísticas Problemas Duros Algoritmos mejores soluciones procedimientos especiales de Antonio Suárez, Orlando Una aproximación a la heuristica y metaheuristicas |
| title | Una aproximación a la heuristica y metaheuristicas |
| title_full | Una aproximación a la heuristica y metaheuristicas |
| title_fullStr | Una aproximación a la heuristica y metaheuristicas |
| title_full_unstemmed | Una aproximación a la heuristica y metaheuristicas |
| title_short | Una aproximación a la heuristica y metaheuristicas |
| title_sort | una aproximacion a la heuristica y metaheuristicas |
| topic | Heuristics Hard Problems algorithms best solution special produceres Heurísticas Problemas Duros Algoritmos mejores soluciones procedimientos especiales |
| url | http://revistas.uan.edu.co/index.php/ingeuan/article/view/217 http://repositorio.uan.edu.co/handle/123456789/3893 |
| work_keys_str_mv | AT deantoniosuarezorlando unaaproximacionalaheuristicaymetaheuristicas |
