Design of parallel algorithm for travelling salesman problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25410%2F12%3A39895516" target="_blank" >RIV/00216275:25410/12:39895516 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Design of parallel algorithm for travelling salesman problem
Original language description
The paper deals with using modification of algorithm as a part for parallel computing of some typical optimization problems which is travelling salesman problem. We will test modified algorithm on set of testing function. The algorithm is created with knowledge taken from basic local search algorithm and genetic algorithm.
Czech name
—
Czech description
—

Project
<a href="/en/project/GPP403%2F10%2FP334" target="_blank" >GPP403/10/P334: GRID technologies for modeling and optimizing of processes in public administration</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Article name in the collection
Proceedings of the 3rd International conference on Applied Informatics and Computing Theory (AICT '12)
ISBN
978-1-61804-130-2
ISSN
1790-5109
e-ISSN
—
Number of pages
5
Pages from-to
270-274
Publisher name
WSEAS Press
Place of publication
Atény
Event location
Barcelona
Event date
Oct 17, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)