[Ask/Help] Tabu Seach

[rickz88]

How To Use Tabu Search in finding Shortest Path routing.

Problem Formulation:
Directed Graph V(G)={n1}i=1,2,...,N, and that edges connecting nodes in V is depicted.Edge set of E(G)={(i,j)|i,j V} representing edge of a graph G.
Corresponding to each edge there is a cost Cij representing the
cost from node ni to node nj.
In this problem, the total length is equal to the sum of all
costs of links within the path. The conditions to be satisfied in
this problem of finding the shortest path from the source to the
destination are: each node is available only once in a path and
one node at a time. We employ tabu search to solve the
problem of finding the shortest path of a given communication
network between a source and destination nodes.


Refference paper: w*w.waset.org/journals/waset/v53/v53-192.pdf (Replace * with w)


Please Help me explain how the Tabu Search work in this problem.
I've read the refference paper But I haven't understood.

PLEASE HELP ME, THIS IS MY FINAL PROJECT.

thanks.

[WingedPanther]

Have you tried doing the search by hand a couple times with pencil/paper?

Is there any part of it that does make sense?

[rickz88]

i've tried many times but i still stuck..

i only understand, tabu search uses in TSP (traveler salesman problem) where each node connect to all other node.

[WingedPanther]

So, does that mean you can, or cannot, do a tabu search by hand?

[rickz88]

i've tried to solve it but i can't

[WingedPanther]

Given that the provided paper includes flow-charts and sample results, can you get a LOT more detailed about what you tried to do by hand, the results you got, and how they conflict with the expected results?