International Journal of Management and Applied Science (IJMAS)
.
Follow Us On :
current issues
Volume-7,Issue-1  ( Jan, 2021 )
Past issues
  1. Volume-7,Issue-1  ( Jan, 2021 )
  2. Volume-6,Issue-12  ( Dec, 2020 )
  3. Volume-6,Issue-11  ( Nov, 2020 )
  4. Volume-6,Issue-10  ( Oct, 2020 )
  5. Volume-6,Issue-9  ( Sep, 2020 )
  6. Volume-6,Issue-8  ( Aug, 2020 )
  7. Volume-6,Issue-7  ( Jul, 2020 )
  8. Volume-6,Issue-6  ( Jun, 2020 )
  9. Volume-6,Issue-5  ( May, 2020 )
  10. Volume-6,Issue-4  ( Apr, 2020 )

Statistics report
Apr. 2021
Submitted Papers : 80
Accepted Papers : 10
Rejected Papers : 70
Acc. Perc : 12%
Issue Published : 83
Paper Published : 4548
No. of Authors : 9366
  Journal Paper


Paper Title :
Comparison Of Different Heuristic, Metaheuristic, Nature Based Optimization Algorithms For Travelling Salesman Problem Solution

Author :Kirti Pandey, Pallavi Jain

Article Citation :Kirti Pandey ,Pallavi Jain , (2015 ) " Comparison Of Different Heuristic, Metaheuristic, Nature Based Optimization Algorithms For Travelling Salesman Problem Solution " , International Journal of Management and Applied Science (IJMAS) , pp. 43-47, Volume-1,Issue-2

Abstract : The Traveling Salesman Problem (TSP) is widely studied problems in combinatorial optimization. Many researches were made for that type of problem. This problem is known to be the NP- hard problems that cannot be solve by conventional mathematical approach. It is also a sub problem of many areas. Different approaches are performing on it as a general test bench to find solution for NP-had problem. In this paper we study seven approaches like Genetic algorithm, Ant colony optimization, Simulated annealing, Tabu search algorithm, Self organize migration algorithm, Intelligent Water Drop and Memetic algorithm which used previously to get a solution which is optimal and comparison of these algorithm to determine certain aspects like nature of algorithm, time, number of iteration to solve this problem. Routing is always an issue in today’s world where a time efficient research is going onto it. Also we are going to present a new concept which is Genetic algorithm based, and it will give the solution to get best route in this problem within efficient time without repeating nodes. Keywords:-TSP, NP-Hard problem, Routing, Combinatorial optimization.

Type : Research paper

Published : Volume-1,Issue-2


DOIONLINE NO - IJMAS-IRAJ-DOIONLNE-1832   View Here

Copyright: © Institute of Research and Journals

| PDF |
Viewed - 38
| Published on 2015-03-12
   
   
IRAJ Other Journals
IJMAS updates
IJMAS -THANK YOU ALL FOR CONTRIBUTING YOUR PAPER TO IJMAS DEC ISSUE. ALL AUTHORS ARE REQUESTED TO GET THEIR HARD COPY NOW.
The Conference World
Facebook

JOURNAL SUPPORTED BY