Reduce Total Distance and Time Using Genetic Algorithm in Traveling Salesman Problem

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

Medical Disease Diagnosis Using Structuring Text

Medical diagnosis is an important domain of research which aids to identify the occurrence of a disease. The paper proposes a novel glide path to knowledge discovery in medical systems by acquiring relevant information f...

Outdoor Dynamic Scene Video Object Segmentation Using SRM Algorithm

In video surveillance, image segmentation in outdoor scenes is a most important and complex task. A novel approach for video object segmentation in outdoor environment is described by using SRM (Statistical Region Mergin...

Secret Detection of Sensitive Data Leakage

Surveys from many years have shown that many data leakages has been found due different problems like malicious attacks, hacking, different attacks. Approximately 28% of all data leakages are due to human mistakes which...

A comparative study of fuzzy logic and weighted Association rule mining in frequent datasets

Mining of frequent patterns in transaction databases has been a fashionable area of research. Many methods are being used to solve the trouble of discovering association rules among items in large databases [8]. Transact...

Development of a Speech Recognition System for Speaker Independent Isolated Malayalam Words

In this paper, a speech recognition system is developed for recognizing speaker-independent, isolated words. Speech recognition is a fascinating application of Digital Signal Processing and is a pattern classification ta...

Download PDF file
  • EP ID EP121556
  • DOI -
  • Views 146
  • Downloads 0

How To Cite

A. Aranganayaki (2014). Reduce Total Distance and Time Using Genetic Algorithm in Traveling Salesman Problem. International Journal of Computer Science & Engineering Technology, 5(8), 815-819. https://europub.co.uk/articles/-A-121556