Implementation of TSP
using heuristic approach using Prolog.
Description :
Travelling Salesman Problem (TSP) : Given a set of cities and distances
between every pair of cities, the problem is to find the shortest possible route that visits every city exactly once
and returns to the starting point.
Solution : Ã find the cheapest way of visiting all the
cities and returning to the starting point.
Examples
Output of Given Graph:
minimum weight Hamiltonian Cycle :
1+4+7+9+3 = 23 path 1
2+3+8+6+1 = 20 path 2
find all possible paths like that ?
-
-
Post a Comment
Thanks, for contacting us.
We will reviewing us on your comments . Please wait an hour.
Air Reality Team....