We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1
Advantages and Disadvantages
For TSPs (Traveling Salesman Problem), relatively efficient
for a small number of nodes, TSPs can be solved by exhaustive search for a large number of nodes , TSPs are very computationally difficult to solve exponential time to convergence Performs better against other global optimization techniques such as neural net, genetic algorithms , simulated annealing Can be used in dynamic applications (adopts to change such as new distances , etc.) Convergence is guaranteed, but time to convergence uncertain.