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 138
- Downloads 0
A Novel Approach for Web Document Classification
The web is a huge repository of information and there is a need for categorizing web documents to facilitate the search and retrieval of documents. Web document classification plays an important role in information organ...
Design of 2.4 GHz Oscillators In CMOS Technology
oscillators are essential components of RF circuits also the integral part of various electronic systems. An oscillator is an electronic device used for the purpose of generating a signal robust, high performance oscilla...
Applicability of Soft computing technique for Crime Forecasting: A Preliminary Investigation
Soft Computing is a multidisciplinary field originally proposed by Dr. Lotfi Zadeh. It is the fusion of methodologies designed to model solution to real world problems that are otherwise difficult to model mathematically...
Customer Segmentation for Decision Support using Clustering and Association Rule based approaches
Key business areas that data mining techniques can be potentially applied to include business profitability, customer relationships, and business process efficieny. Customer Realtionship Management(CRM)has become a leadi...
Survey on Traffic Redundancy and Elimination Approach for Reducing Cloud Bandwidth and Costs
Cloud computing is a fast growing field which is arguably a new computing paradigm. In cloud computing, computing resources are provided as services over the internet and users can access resources on based on their paym...