Implementace a vizualizace vybraných grafových algoritmů
Loading...
Downloads
2
Date issued
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoká škola báňská - Technická univerzita Ostrava
Location
Signature
Abstract
The motivation for the development of my work is especially the idea of using new approaches to solving tasks and algorithm known as traveling salesman problem, with the help of recombination operators of genetic algorithms and their innovative use for graphs. The aim of my work is to find a suitable combination of genetic operations to optimize the size of the problem solving. To simulate quality solutions I propose their own application interface on the Windows platform using the .NET Framework that will allow me to high object abstraction of genetic operations over a graph solved task. This application also allows me then easy, user-friendly input of solve tasks and the possibility of visualizing the process optimization. Above thus obtained simulation data, I will be able to analyze and draw conclusions about the benefits of my proposed solution.
Description
Import 23/08/2017
Subject(s)
genetic algorithm, graph algorithm, traveling salesman problem, Floyd-Warshall, simulation, CX, OX, PMX