Jump to content


Check out our Community Blogs

Register and join over 40,000 other developers!


Recent Status Updates

View All Updates

Photo
- - - - -

[Ask/Help] Tabu Seach

form shortest path

  • Please log in to reply
5 replies to this topic

#1 rickz88

rickz88

    CC Lurker

  • Just Joined
  • Pip
  • 3 posts

Posted 08 February 2010 - 09:15 AM

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.
  • 0

#2 WingedPanther73

WingedPanther73

    A spammer's worst nightmare

  • Moderator
  • 17757 posts
  • Location:Upstate, South Carolina
  • Programming Language:C, C++, PL/SQL, Delphi/Object Pascal, Pascal, Transact-SQL, Others
  • Learning:Java, C#, PHP, JavaScript, Lisp, Fortran, Haskell, Others

Posted 08 February 2010 - 09:33 AM

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

Is there any part of it that does make sense?
  • 0

Programming is a branch of mathematics.
My CodeCall Blog | My Personal Blog

My MineCraft server site: http://banishedwings.enjin.com/


#3 rickz88

rickz88

    CC Lurker

  • Just Joined
  • Pip
  • 3 posts

Posted 08 February 2010 - 10:25 AM

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.
  • 0

#4 WingedPanther73

WingedPanther73

    A spammer's worst nightmare

  • Moderator
  • 17757 posts
  • Location:Upstate, South Carolina
  • Programming Language:C, C++, PL/SQL, Delphi/Object Pascal, Pascal, Transact-SQL, Others
  • Learning:Java, C#, PHP, JavaScript, Lisp, Fortran, Haskell, Others

Posted 08 February 2010 - 02:20 PM

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

Programming is a branch of mathematics.
My CodeCall Blog | My Personal Blog

My MineCraft server site: http://banishedwings.enjin.com/


#5 rickz88

rickz88

    CC Lurker

  • Just Joined
  • Pip
  • 3 posts

Posted 08 February 2010 - 07:41 PM

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

#6 WingedPanther73

WingedPanther73

    A spammer's worst nightmare

  • Moderator
  • 17757 posts
  • Location:Upstate, South Carolina
  • Programming Language:C, C++, PL/SQL, Delphi/Object Pascal, Pascal, Transact-SQL, Others
  • Learning:Java, C#, PHP, JavaScript, Lisp, Fortran, Haskell, Others

Posted 09 February 2010 - 08:50 AM

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?
  • 0

Programming is a branch of mathematics.
My CodeCall Blog | My Personal Blog

My MineCraft server site: http://banishedwings.enjin.com/






Also tagged with one or more of these keywords: form, shortest path

Recommended from our users: Dynamic Network Monitoring from WhatsUp Gold from IPSwitch. Free Download