Testing the Quality of the Proposed Solution to the TSP Problem Using Genetic Algorithms
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F14%3A00220612" target="_blank" >RIV/68407700:21260/14:00220612 - isvavai.cz</a>
Result on the web
<a href="http://www.theglobaljournals.com/paripex/issues.php?m=July&y=2014&id=33" target="_blank" >http://www.theglobaljournals.com/paripex/issues.php?m=July&y=2014&id=33</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.15373/22501991" target="_blank" >10.15373/22501991</a>
Alternative languages
Result language
angličtina
Original language name
Testing the Quality of the Proposed Solution to the TSP Problem Using Genetic Algorithms
Original language description
The article concerns the testing of genetic operators of a genetic algorithm for calculation of a transportation task in the travelling salesman problem (TSP). Software was developed for testing the solution of the given problem, using a genetic algorithm with proposed variant operators of selection, crossover and mutation, along with other parameters of the problem.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2014
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
PARIPEX ? Indian Journal of Research
ISSN
2250-1991
e-ISSN
—
Volume of the periodical
III
Issue of the periodical within the volume
VII
Country of publishing house
IN - INDIA
Number of pages
5
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—