Show simple item record

dc.contributor.authorAguilar, Joséspa
dc.date.accessioned2020-10-27T00:21:37Z
dc.date.available2020-10-27T00:21:37Z
dc.date.issued2001-06-01
dc.identifier.issn2539-2115
dc.identifier.issn1657-2831
dc.identifier.urihttp://hdl.handle.net/20.500.12749/9077
dc.description.abstractUn Sistema de Hormigas es un sistema artificial basado en el comportamiento de colonias de hormigas reales, que se utiliza para resolver problemas combinatorios. Este es un algoritmo distribuido compuesto por un conjunto de agentes cooperantes llamados hormigas que cooperan entre ellos para encontrar buenas soluciones a problemas de optimización combinatoria. La cooperación sigue el comportamiento de hormigas reales utilizando una forma indirecta de comunicación mediada por una feromona. En este trabajo, presentamos un nuevo algoritmo distribuido basado en conceptos de Ant System, llamado General Ant System, para resolver problemas de optimización combinatoria. Nuestro enfoque consiste en mapear el espacio de solución del Problema de Optimización Combinatoria sobre el espacio donde se emparedarán las hormigasc, y en definir la probabilidad de transición del Sistema Hormiga de acuerdo a la función objetivo del Problema de Optimización Combinatoria. Probamos nuestro enfoque sobre la partición de grafos y los problemas del viajante de comercio. Los resultados muestran que nuestro enfoque tiene el mismo rendimiento que las versiones anteriores de Ant Systems.spa
dc.format.mimetypeapplication/pdfspa
dc.language.isospaspa
dc.publisherUniversidad Autónoma de Bucaramanga UNAB
dc.relationhttps://revistas.unab.edu.co/index.php/rcc/article/view/1118/1089
dc.relation.urihttps://revistas.unab.edu.co/index.php/rcc/article/view/1118
dc.rightsDerechos de autor 2001 Revista Colombiana de Computación
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/co/
dc.sourceRevista Colombiana de Computación; Vol. 2 Núm. 1 (2001): Revista Colombiana de Computación; 7-18
dc.subjectInnovaciones tecnológicas
dc.subjectCiencia de los computadores
dc.subjectDesarrollo de tecnología
dc.subjectIngeniería de sistemas
dc.subjectInvestigaciones
dc.subjectTecnologías de la información y las comunicaciones
dc.subjectTIC´s
dc.titleUn modelo general de colonia de hormigas para resolver problemas de optimización combinatoriaspa
dc.title.translatedA general ant colony model to solve combinatorial optimization problemseng
dc.type.driverinfo:eu-repo/semantics/article
dc.type.localArtículospa
dc.type.coarhttp://purl.org/coar/resource_type/c_7a1f
dc.subject.keywordsTechnological innovationseng
dc.subject.keywordsComputer scienceeng
dc.subject.keywordsTechnology developmenteng
dc.subject.keywordsSystems engineeringeng
dc.subject.keywordsInvestigationseng
dc.subject.keywordsInformation and communication technologieseng
dc.subject.keywordsICT'seng
dc.subject.keywordsCombinatorial optimization prohlemeng
dc.subject.keywordsAnt systemeng
dc.subject.keywordsThe graph partitioning and the traveling salesman problemseng
dc.identifier.instnameinstname:Universidad Autónoma de Bucaramanga UNABspa
dc.type.hasversioninfo:eu-repo/semantics/acceptedVersion
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.relation.referencesE. Bonabeau, M. Dorigo and G. Theraulaz, From Natural to Artificial Swarm Intelligence, Oxford University Press, 1999.
dc.relation.referencesA. Coloni, M. Dorigo and V. Maniczzo, Distributed Optimization by Ant Colonias. In: Proc. European Conference on Artificial Lif e, pp. 134-142, 1991.
dc.relation.referencesD. Come, M. Dorigo and E Glove, New ideas in Optimization, McGrmv Ha 1999.
dc.relation.referencesCosta D. and A. Hertz, Ants Can Colour Graphs. Journal of the Operational Revean* Society, 48: 295-305,1997.
dc.relation.referencesM. Dorigo, Optimization, Leaming and Natural Algorithms, Ph.D Tizesis, Politecnico de Milano, Italy, 1992.
dc.relation.referencesM. Dorigo and L. Gambardella, Ant Colony System: A Cooperativa Leaming Approach to the Traveling Salesman Problem, IEEE Trans. on Evolutionary Computation, 1(1): 53-66, 1997.
dc.relation.referencesL. Gambardella and M. Dorigo, Ant-Q: A Rcinforcement Lemming Approach to the Traveling Salesman Problem. In: Proc. ofI 2th Int. Con! on Machine Learning, pp. 252-260, 1995.
dc.relation.referencesE Hidrobo and .1. Aguilar "Toward a Parallel Genetic Algorithm Approach Basad on Collective Intelligence for Combinatorial Optimization Problems", In: Proc. of the IEEE International Conference on Evolutionary Computation, pp. 715-720, 1998.
dc.relation.references] P. Kuntz and D. Snyers. Emergent Colonization and Graph Partitioning. In: Proc of the Third International Conference on Simulation of Adaptive Behavior: From Animals to Animals 3, 1994.
dc.relation.references] P. Kuntz, P. Layzell and D. Snyers. A Colony of Ant-hlce Agents for Partitioning in VLSI Technology. In: Proc. of the Fourth European Conference on Artificial Lije, pp. 417424, 1997.
dc.relation.referencesR. Schoonderwoerd, O. Holland, J. Broten and L. Rothlcrantz, Ant-based Load Balancing in Telecommunications Networks, Adaptive Behavior, 5(2): 169-207,1997.
dc.relation.referencesY. Stutzk and H. Hoos, The Max-Min Ant System and Local Search for the Traveling Salesman Problem, In: Proc. 4th hit. Conf ort Evolutionary Computation, pp. 309-314, 1997
dc.contributor.googlescholarAguilar, José [L3C_ixQAAAAJ]spa
dc.contributor.orcidAguilar, José [0000-0003-4194-6882]spa
dc.subject.lembInnovaciones tecnológicasspa
dc.subject.lembCiencias de la computaciónspa
dc.subject.lembIngeniería de sistemasspa
dc.subject.lembInvestigacionesspa
dc.subject.lembTecnologías de la información y la comunicaciónspa
dc.identifier.repourlrepourl:https://repository.unab.edu.co
dc.description.abstractenglishAn Ants System is an artificial system basad on the bchavior of real ant colonies, which is used to solvc combinatorial problems. This is a distributed algorithm composed by a set of cooperating agents called ants which cooperatc among them to find good solutions to combinatorial optimization problerns. The cooperation follows the bchavior of real ants using an indircct forro of communication mediated by a pheromone. In Chis worlc, we present a ncw distributed algorithm basad on Ant System concepts, called the General Ant System, to solvc Combinatorial Optimization Problems. Our approach consist on mapping the solution space of the Combinatorial Optimization Problem on the space where the ants will wallc, and on defining the transition probability of the Ant System according to the objective function of the Combinatorial Optimization Problem. We test our approach on the Graph Partitioning and The Traveling Salesman Problems. The results show that our approach has the same performzumes than previous versions of Ant Systems.eng
dc.subject.proposalProblema de optimización combinatoriaspa
dc.subject.proposalSistema de hormigasspa
dc.subject.proposalla partición de grafos y los problemas del viajante de comerciospa
dc.subject.proposalDesarrollo tecnológicospa
dc.type.redcolhttp://purl.org/redcol/resource_type/CJournalArticle
dc.rights.creativecommonsAtribución-NoComercial-SinDerivadas 2.5 Colombia*


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Atribución-NoComercial-SinDerivadas 2.5 Colombia
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 2.5 Colombia