SIMULATION OF ANT COLONIES WITH HINTS GENERATED BY PARALLEL HEURISTICS

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00171885" target="_blank" >RIV/68407700:21230/10:00171885 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21240/10:00171885

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

SIMULATION OF ANT COLONIES WITH HINTS GENERATED BY PARALLEL HEURISTICS

Popis výsledku v původním jazyce

In this paper we present a new approach for combining discrete optimization algorithms, which resulted from a simulation of several scenarios of information exchange between algorithms running in parallel. We show that a group of parallel metaheuristicscan create probabilistic "hints" for colony of artificial ants, which solves the same instance of a Traveling Salesman Problem (TSP). These "hints" are realized by creating intersections of solutions from fast independent solvers and they can be used toimprove optimization process. A convergence speedup is shown for a group of Simulated Annealing algorithms together with Max-Min Ant System on non-geometric TSP and for a given time window and random instances of sizes in of order of magnitude of 10^3. Presented model of cooperation between algorithms is a first step on the path to a complex metaoptimization system based on combinations of heuristics.

Název v anglickém jazyce

SIMULATION OF ANT COLONIES WITH HINTS GENERATED BY PARALLEL HEURISTICS

Popis výsledku anglicky

In this paper we present a new approach for combining discrete optimization algorithms, which resulted from a simulation of several scenarios of information exchange between algorithms running in parallel. We show that a group of parallel metaheuristicscan create probabilistic "hints" for colony of artificial ants, which solves the same instance of a Traveling Salesman Problem (TSP). These "hints" are realized by creating intersections of solutions from fast independent solvers and they can be used toimprove optimization process. A convergence speedup is shown for a group of Simulated Annealing algorithms together with Max-Min Ant System on non-geometric TSP and for a given time window and random instances of sizes in of order of magnitude of 10^3. Presented model of cooperation between algorithms is a first step on the path to a complex metaoptimization system based on combinations of heuristics.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2010

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 7th EUROSIM Congress on Modelling and Simulation, Vol. 2: Full Papers

ISBN

978-80-01-04589-3

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

—

Název nakladatele

Department of Computer Science and Engineering, FEE, CTU in Prague

Místo vydání

Prague

Místo konání akce

Praha

Datum konání akce

6. 9. 2010

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—