Call For Paper Volume:4 Issue:6 Jun'2017

ELUCIDATION OF TSP WITH SAMAN-NET

Publication Date : 18/03/2016



Author(s) :

DR. NAVEEN KUMAR SHARMA.


Volume/Issue :
Volume 3
,
Issue 3
(03 - 2016)



Abstract :

Abstract: Various problems of combinatorial optimization and permutation can be solved with neural network optimization. Traveling salesman problem is an important example of this category, which is characterized by its large number of iterating degree of freedom. There are various solutions of this problem has been given. These solutions are exact and heuristic methods, but all the exact approaches may be considered for theoretical interest. In this paper, we propose the Simulated Annealing of mean field approximation for choosing the possible minimum distance path that satisfies all the necessary constraints. A new energy function with mean field approximation is proposed. And the annealing schedule is also defined dynamically which changes with the distance on each iteration of the process. The algorithm shows that this approach generates optimal solution for the aforesaid problem. Keywords:  TSP, MFA, SA, and Optimization.


No. of Downloads :

3


Indexing

Web Design MymensinghPremium WordPress ThemesWeb Development

ELUCIDATION OF TSP WITH SAMAN-NET

March 3, 2016