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...
- Autores:
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2014
- Institución:
- Universidad Antonio Nariño
- Repositorio:
- Repositorio UAN
- Idioma:
- spa
- OAI Identifier:
- oai:repositorio.uan.edu.co:123456789/10398
- Acceso en línea:
- https://revistas.uan.edu.co/index.php/ingeuan/article/view/217
https://repositorio.uan.edu.co/handle/123456789/10398
- Palabra clave:
- Heurísticas
Problemas Duros
Algoritmos
mejores soluciones
procedimientos especiales
Heuristics
Hard Problems
algorithms
best solution
special produceres
- Rights
- License
- https://creativecommons.org/licenses/by-nc-sa/4.0
id |
UAntonioN2_d1dddd8409317bc7b1dd91affcd5ecdb |
---|---|
oai_identifier_str |
oai:repositorio.uan.edu.co:123456789/10398 |
network_acronym_str |
UAntonioN2 |
network_name_str |
Repositorio UAN |
repository_id_str |
|
spelling |
2014-03-042024-10-10T02:24:29Z2024-10-10T02:24:29Zhttps://revistas.uan.edu.co/index.php/ingeuan/article/view/217https://repositorio.uan.edu.co/handle/123456789/10398When 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.application/pdfspaUNIVERSIDAD ANTONIO NARIÑOhttps://revistas.uan.edu.co/index.php/ingeuan/article/view/217/179https://creativecommons.org/licenses/by-nc-sa/4.0http://purl.org/coar/access_right/c_abf2INGE@UAN - TENDENCIAS EN LA INGENIERÍA; Vol. 1 Núm. 2 (2011)2346-14462145-0935HeurísticasProblemas DurosAlgoritmosmejores solucionesprocedimientos especialesHeuristicsHard Problemsalgorithmsbest solutionspecial produceresUna aproximación a la heuristica y metaheuristicasinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1http://purl.org/coar/version/c_970fb48d4fbd8a85de Antonio Suárez, Orlando123456789/10398oai:repositorio.uan.edu.co:123456789/103982024-10-14 03:47:34.103metadata.onlyhttps://repositorio.uan.edu.coRepositorio Institucional UANalertas.repositorio@uan.edu.co |
dc.title.es-ES.fl_str_mv |
Una aproximación a la heuristica y metaheuristicas |
title |
Una aproximación a la heuristica y metaheuristicas |
spellingShingle |
Una aproximación a la heuristica y metaheuristicas Heurísticas Problemas Duros Algoritmos mejores soluciones procedimientos especiales Heuristics Hard Problems algorithms best solution special produceres |
title_short |
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_sort |
Una aproximación a la heuristica y metaheuristicas |
dc.subject.es-ES.fl_str_mv |
Heurísticas Problemas Duros Algoritmos mejores soluciones procedimientos especiales |
topic |
Heurísticas Problemas Duros Algoritmos mejores soluciones procedimientos especiales Heuristics Hard Problems algorithms best solution special produceres |
dc.subject.en-US.fl_str_mv |
Heuristics Hard Problems algorithms best solution special produceres |
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. |
publishDate |
2014 |
dc.date.accessioned.none.fl_str_mv |
2024-10-10T02:24:29Z |
dc.date.available.none.fl_str_mv |
2024-10-10T02:24:29Z |
dc.date.none.fl_str_mv |
2014-03-04 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
dc.type.coar.fl_str_mv |
http://purl.org/coar/resource_type/c_2df8fbb1 |
dc.type.coar.spa.fl_str_mv |
http://purl.org/coar/resource_type/c_6501 |
dc.type.coarversion.none.fl_str_mv |
http://purl.org/coar/version/c_970fb48d4fbd8a85 |
format |
http://purl.org/coar/resource_type/c_6501 |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
https://revistas.uan.edu.co/index.php/ingeuan/article/view/217 |
dc.identifier.uri.none.fl_str_mv |
https://repositorio.uan.edu.co/handle/123456789/10398 |
url |
https://revistas.uan.edu.co/index.php/ingeuan/article/view/217 https://repositorio.uan.edu.co/handle/123456789/10398 |
dc.language.none.fl_str_mv |
spa |
language |
spa |
dc.relation.none.fl_str_mv |
https://revistas.uan.edu.co/index.php/ingeuan/article/view/217/179 |
dc.rights.es-ES.fl_str_mv |
https://creativecommons.org/licenses/by-nc-sa/4.0 |
dc.rights.coar.spa.fl_str_mv |
http://purl.org/coar/access_right/c_abf2 |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-sa/4.0 http://purl.org/coar/access_right/c_abf2 |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.es-ES.fl_str_mv |
UNIVERSIDAD ANTONIO NARIÑO |
dc.source.es-ES.fl_str_mv |
INGE@UAN - TENDENCIAS EN LA INGENIERÍA; Vol. 1 Núm. 2 (2011) |
dc.source.none.fl_str_mv |
2346-1446 2145-0935 |
institution |
Universidad Antonio Nariño |
repository.name.fl_str_mv |
Repositorio Institucional UAN |
repository.mail.fl_str_mv |
alertas.repositorio@uan.edu.co |
_version_ |
1814300293002690560 |