<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-674U45KF/96e501c1-4be4-4f28-a198-b7e2ceb555e0/HTML"><dcterms:extent>28 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-674U45KF/bd4ea8d6-9cf8-4066-9a08-7a3bd4381ac1/PDF"><dcterms:extent>1015 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-674U45KF/881c5e48-d8a7-496e-a5be-44903a75553f/TEXT"><dcterms:extent>25 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2006-2025"><edm:begin xml:lang="en">2006</edm:begin><edm:end xml:lang="en">2025</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:DOC-674U45KF"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/urn:nbn:si:spr-0y5dimiu" /><dcterms:issued>2006</dcterms:issued><dc:creator>Brest, Janez</dc:creator><dc:creator>Pešl, Ivan</dc:creator><dc:creator>Žumer, Viljem</dc:creator><dc:format xml:lang="sl">številka:2/3</dc:format><dc:format xml:lang="sl">6 strani</dc:format><dc:format xml:lang="sl">letnik:73</dc:format><dc:format xml:lang="sl">str. 93-98</dc:format><dc:identifier>ISSN:0013-5852</dc:identifier><dc:identifier>COBISSID:10672918</dc:identifier><dc:identifier>ISSN:2232-3236</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-674U45KF</dc:identifier><dc:language>sl</dc:language><dc:publisher xml:lang="sl">Elektrotehniška zveza Slovenije</dc:publisher><dcterms:isPartOf xml:lang="sl">Elektrotehniški vestnik</dcterms:isPartOf><dc:subject xml:lang="sl">inteligenca roja</dc:subject><dc:subject xml:lang="sl">kolonija mravelj</dc:subject><dc:subject xml:lang="sl">problem trgovskega potnika</dc:subject><dc:subject xml:lang="sl">umetna inteligenca</dc:subject><dc:subject rdf:resource="http://www.wikidata.org/entity/Q322212" /><dcterms:temporal rdf:resource="2006-2025" /><dc:title xml:lang="sl">Optimizacija s pomočjo kolonije mravelj| ACO - Ant Colony Optimization|</dc:title><dc:description xml:lang="sl">Ant colony optimization is a relatively new approach to solving NP-Hard problems. It is based on the behavior of real ants, which always find the shortest path between their nest and a food source. Such behavior can be transferred into the discrcte world, were real ants are replaced by simple agents. Such simple agents are placed into the environment where different combinatorial problems can be solved In this paper we describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Artificial ants successively generate shorter feasible tours by using information accumulated in the form of a phermone trail deposited on edges of the TSP graph 1. The basic ant behavior can be improved by adding heuristic information, e.g. local search. We describe several different algorithms used in solving the TSP (and similar) problems. We start from the first algorithm that was first used in ant optimization named Ant System. This algorithm has been followed by many others approaches resulting in better performance of ant colony optimization. The main job is to test the ant behavior on different graphs, taken from the TSPLlJJ95 library. At the end we show a comparison of ant algorithms on several instances of TSP</dc:description><dc:description xml:lang="sl">V naravi so mravlje sposobne najti najkrajšo pot od vira hrane do gnezda brez uporabe vizualnih informacij. Poleg tega so se zmožne prilagoditi spremembam v okolju. na primer najti novo naj krajšo pot. ko trenutno pot preseka ovira. Pri tem nastane zamisel, da bi lahko bilo posnemanje takšnega obnašanja mravelj učinkovito tudi v diskretnem svetu. V članku bomo prikazali reševanje problema trgovskega potnika s pomočjo optimizacije mravelj</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:DOC-674U45KF"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:DOC-674U45KF" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:DOC-674U45KF/bd4ea8d6-9cf8-4066-9a08-7a3bd4381ac1/PDF" /><edm:rights rdf:resource="http://rightsstatements.org/vocab/InC/1.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Elektrotehniška zveza Slovenije</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:DOC-674U45KF/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:DOC-674U45KF" /></ore:Aggregation></rdf:RDF>