Application triggering the active dynamics of Hopfield neural network or algorithm of simulated annealing of graph node parameters over input data including the possibility of entering user-selected triggering parameters. The traveling salesman problem is an NP-hard discrete optimization problem, mathematically expressing and generalizing the problem of finding the shortest possible path passing through all vertices of a valued graph. This achieves (at the cost of giving up the claim of finding an optimal solution) practical times. It can be used, for example, to optimize the order of visits to different facilities due to their revision with respect to the traffic cost of the reviser.
Downloads:
- User guide (in Czech)
- License agreement and trial version
- Technical-computational study of use of artificial intelligence methods
The software has been developed with a financial support of the Technology Agency of the Czech Republic under the research project No. TK04020003.
Savings on travelling costs.
