Solution traveling salesman problem using heuristic algorithms

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21220%2F15%3A00235739" target="_blank" >RIV/68407700:21220/15:00235739 - isvavai.cz</a>

Výsledek na webu

<a href="http://stc.fs.cvut.cz/" target="_blank" >http://stc.fs.cvut.cz/</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Solution traveling salesman problem using heuristic algorithms

Popis výsledku v původním jazyce

Orbital transportation problem is a combinatorial problem of searching for the shortest route connecting a set of points, with the requirement that the route ends at the point at which it started. The length of the route is determined by choosing the order in connecting individual points. Finding a procedure that would find the shortest route, without the need to measure all the routes that exist. Still not found such an algorithm that this would allow a number of steps, which, depending on the number of points increases linearly or as a power function. This paper describes a heuristic approach to solving this problem, where some laws are applied on the value of the probability of occurrence of each line of points in the shortest route. Implementation of these laws can accelerate the search for solutions. The ability to quickly address this problem has applications in the optimization of logistic routes in order scheduling order processing, programming movement trajectories of machine tools etc.

Název v anglickém jazyce

Solution traveling salesman problem using heuristic algorithms

Popis výsledku anglicky

Orbital transportation problem is a combinatorial problem of searching for the shortest route connecting a set of points, with the requirement that the route ends at the point at which it started. The length of the route is determined by choosing the order in connecting individual points. Finding a procedure that would find the shortest route, without the need to measure all the routes that exist. Still not found such an algorithm that this would allow a number of steps, which, depending on the number of points increases linearly or as a power function. This paper describes a heuristic approach to solving this problem, where some laws are applied on the value of the probability of occurrence of each line of points in the shortest route. Implementation of these laws can accelerate the search for solutions. The ability to quickly address this problem has applications in the optimization of logistic routes in order scheduling order processing, programming movement trajectories of machine tools etc.

Druh

D - Stať ve sborníku

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

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

Studentská tvůrčí činnost 2015

ISBN

978-80-01-05727-8

ISSN

—

e-ISSN

—

Počet stran výsledku

13

Strana od-do

-1

Název nakladatele

České vysoké učení technické v Praze, Fakulta strojní

Místo vydání

Praha

Místo konání akce

Praha

Datum konání akce

16. 4. 2015

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

EUR - Evropská akce

Kód UT WoS článku

—