TSP Path Problem Solver

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F11%3A43867366" target="_blank" >RIV/70883521:28140/11:43867366 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

TSP Path Problem Solver

Popis výsledku v původním jazyce

This software is specialized on shortest path search within different industrial application in 2D as well as 3D environment. Typical example of the software?s usage is to find shortest path of a machining head during working on complicated surface of awork pieces (Determination of movement coordinates between drilling and grinding in accordance with requirements specified by the help of CAD system.) Moreover the software can be well used to solve other logistics problems (e.g. in transportation Vehicle Routing Problem or in energetic heating system pipes deployment) assuming an user specifies also weights of different paths. To solute this task the software uses four diverse algorithms of shortest path searching based on graph theory: Dijkst algorithm, Floyd ? Warshall algorithm, Bellman ? Ford algorithm and A-star. The software is also able to used hybrid Scattered Search and Self-Organizing Migration Algorithm to find a solution of Vehicle Routing Problem with Time Windows. The sof

Název v anglickém jazyce

TSP Path Problem Solver

Popis výsledku anglicky

This software is specialized on shortest path search within different industrial application in 2D as well as 3D environment. Typical example of the software?s usage is to find shortest path of a machining head during working on complicated surface of awork pieces (Determination of movement coordinates between drilling and grinding in accordance with requirements specified by the help of CAD system.) Moreover the software can be well used to solve other logistics problems (e.g. in transportation Vehicle Routing Problem or in energetic heating system pipes deployment) assuming an user specifies also weights of different paths. To solute this task the software uses four diverse algorithms of shortest path searching based on graph theory: Dijkst algorithm, Floyd ? Warshall algorithm, Bellman ? Ford algorithm and A-star. The software is also able to used hybrid Scattered Search and Self-Organizing Migration Algorithm to find a solution of Vehicle Routing Problem with Time Windows. The sof

Druh

R - Software

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/2C06007" target="_blank" >2C06007: Inteligentní systém pro řízení energetického systému městské aglomerace.</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2011

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ů

Interní identifikační kód produktu

R/FAI/UIUI/2011/TSPSolver

Technické parametry

Technologicky je software založen na knihovnách .NET Framework a jazyku C# s důrazem na paralelní implementaci výpočtů.

Ekonomické parametry

Úspory nákladů spojených s plánováním nejkratší trasy.

IČO vlastníka výsledku

70883521

Název vlastníka

Univerzita Tomáše Bati ve Zlíně, Fakulta aplikované informatiky