Upload resources

Upload your works to SEDICI to increase its visibility and improve its impact

 

Show simple item record

dc.date.accessioned 2012-10-09T15:40:06Z
dc.date.available 2012-10-09T15:40:06Z
dc.date.issued 2000
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/22110
dc.description.abstract Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., the Traveling Salesman Problem). In this report we describe an Ant System algorithm, which would be appropriate for solving additional subset problems as was showed for solving the multiple knapsack problem in previous works. The experiments on progress show the potential power of the ACO approach for solving different subset problems. en
dc.format.extent 62-64 es
dc.language es es
dc.subject Ant Colony (AC) en
dc.subject ARTIFICIAL INTELLIGENCE es
dc.subject ordering problems en
dc.subject Heuristic methods es
dc.subject Ant Colony Optimization (ACO) en
dc.title Current applications of ant systems for subset problems en
dc.type Objeto de conferencia es
sedici.creator.person Leguizamón, Guillermo es
sedici.description.note Eje: Sistemas inteligentes. Metaheurísticas. es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Red de Universidades con Carreras en Informática (RedUNCI) es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
sedici.date.exposure 2000-05
sedici.relation.event II Workshop de Investigadores en Ciencias de la Computación es
sedici.description.peerReview peer-review es


Download Files

This item appears in the following Collection(s)

Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)