Utilization of Modified Local Search as a Tool for Parallel Computing
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25410%2F10%3A39882081" target="_blank" >RIV/00216275:25410/10:39882081 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Utilization of Modified Local Search as a Tool for Parallel Computing
Original language description
The paper deals with using modified type of local search algorithm for utilization within optimization. We will test our algorithm on some testing functions and on travelling salesman problem. We will modify this algorithm with the principles of parallelcomputing and we will show the results. The algorithm is created with knowledge taken from basic local search algorithm, simulated annealing algorithm and tabu search algorithm.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
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)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
International journal of applied mathematics and informatics
ISSN
2074-1278
e-ISSN
—
Volume of the periodical
4
Issue of the periodical within the volume
1
Country of publishing house
GB - UNITED KINGDOM
Number of pages
7
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—