Experiment No. 8
OBJECTIVE: Write a program to solve traveling salesman problem.
Dataset:
edge(a, b, 3).
edge(a, c, 4).
edge(a, d, 2).
edge(a, e, 7).
edge(b, c, 4).
edge(b, d, 6).
edge(b, e, 3).
edge(c, d, 5).
edge(c, e, 8).
edge(d, e, 6).
edge(b, a, 3).
edge(c, a, 4).
edge(d, a, 2).
edge(e, a, 7).
edge(c, b, 4).
edge(d, b, 6).
edge(e, b, 3).
edge(d, c, 5).
edge(e, c, 8).
edge(e, d, 6).
edge(a, h, 2).
edge(h, d, 1).
Program:
len([], 0).
len([H|T], N):- len(T, X), N is X+1 .
best_path(Visited, Total):- path(a, a, Visited,
Total).
path(Start, Fin, Visited, Total) :- path(Start, Fin, [Start], Visited, 0, Total).
path(Start, Fin, CurrentLoc, Visited, Costn, Total) :-edge(Start, StopLoc, Distance),
NewCostn is Costn + Distance,
\+ member(StopLoc, CurrentLoc),
path(StopLoc, Fin, [StopLoc|CurrentLoc],
Visited, NewCostn, Total).
path(Start, Fin, CurrentLoc, Visited, Costn, Total) :-edge(Start, Fin, Distance),
reverse([Fin|CurrentLoc], Visited),
len(Visited, Q),
(Q\=7 -> Total is 100000; Total is Costn + Distance).
shortest_path(Path):-setof(Cost-Path, best_path(Path,Cost),
Holder),pick(Holder,Path).
best(Cost-Holder,Bcost-_,Cost-Holder):- Cost<Bcost,!.
best(_,X,X).
pick([Cost-Holder|R],X):- pick(R,Bcost-Bholder),
best(Cost-Holder,Bcost-Bholder,X),!.
pick([X],X).
Output:
To Download Complete Artificial Intelligence Lab Manual Click Here
Download Now
Artificial Intelligence Lab, AKTU manual, 4th year, Computer Science and Engineering, Information Technology, Prolog, programming
Artificial Intelligence Lab (RCS752)
Artificial Intelligence Lab Manual AKTU
Artificial Intelligence Lab Manual using Prolog PDF
Artificial Intelligence Lab Notes Download