Reduce Total Distance and Time Using Genetic Algorithm in Traveling Salesman Problem
Journal Title: International Journal of Computer Science & Engineering Technology - Year 2014, Vol 5, Issue 8
Abstract
Traveling salesman problem is quite known in the field of combinatorial optimization. Through this research describe how the traveling salesman problem is solved by the heuristic method of genetic algorithms. This research to find the most approximate solution that gives us the least distance, which is the shortest route for traverse the cities given in the data set such that each city is passed through just once and the traveling salesman comes back to the initial city from where he started. I accomplish this by carrying out the algorithm through generating a fitness formula and with the help of genetic operators like selection, crossover and mutation. The main purpose of this study is to propose a new representation method of chromosomes using binary matrix and new fittest criteria to be used as method for finding the optimal solution for TSP. The proposed method is taken from genetic algorithm of artificial inelegance as a basic ingredient which has been used as search algorithm to find the near-optimal solutions. This research introducing the new fittest criteria for crossover, and also applying the algorithm on symmetric as well as asymmetric TSP.
Authors and Affiliations
A. Aranganayaki
Keywords
Related Articles
- EP ID EP121556
- DOI -
- Views 132
- Downloads 0
How Accountability Improves Software Reliability?
This paper encourage accountability as a principle for software reliability. There are various techniques to estimate software reliability which is tested. This paper treats to identify the faults which are put in the de...
Development of energy efficient routing protocol using Hop PEGASIS in Wireless Sensor Networks
In a Wireless sensor network (WSN), communication of the gathered data in the network from the nodes to the base station is a prominent activity and this communication of data consumes the maximum amount of energy. When...
Network Security Issues and Solutions
Network security is now days becoming more and more important because people like to connect with each other all the time via internet. Personal computer users, employees of professional organizations, government servant...
Review Report on Semantic web service composition using Petri nets
Petri nets are graphical and mathematical modelling tool helpful for representation of semantic web service composition. Semantic web service composition explained by OWL-S language. OWL-S language supports control const...
A Multi-hop approach for sensing coverage in wireless sensor network
Wireless sensor networks (WSNs) are recently rapidly growing research area in wireless communications. WSNs are studied widely and usefully applied in many applications like military surveillance, environmental monitorin...