Application of Genetic Algorithm to the TSP Problem

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F14%3A00220610" target="_blank" >RIV/68407700:21260/14:00220610 - 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>

Result language

angličtina

Original language name

Application of Genetic Algorithm to the TSP Problem

Original language description

The article concerns the proposal of the solution of genetic operators of a genetic algorithm for calculation of a transportation task in the travelling salesman problem. Travelling salesman problem belongs to NP-hard problems with significant use in transportation. Application of genetic algorithm to a specific problem includes mainly design of encoding and three operators of selection, crossover and mutation. For all these operators several variants were proposed with regard to travelling salesman problem specifics as well as some other adjustments to the problem.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2014

Confidentiality

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

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

4

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—