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

Cloud Computing Challenges: A Survey 

In recent years, cloud computing has been an emerging computing model in the IT industry. Many big companies are throwing resources into it. It provides efficient computing by centralizing storage, memory processing and...

A Cooperative Approach for Opportunistic Routing In Mobile Ad Hoc Networks

Cooperative Communication, a new research area, has revealed a recent origin in the wireless networks, which combines the link-quality and the broadcasting nature of the wireless channels. It is a pure network layer sche...

Novel Approach for Detection of Brain Tumor using Segmentation Techniques

Medical Image Processing is one of the standard method to detect the abnormal tissue. The key benefit of this field is reduction of manual work and early detection of the disease. Various types of medical imaging modalit...

Image Encryption and Decryption Using Selective Block Encryption Technique

In the recent world, the need of information security has became a necessity with the progress in data exchange and communication by electronic system. Because of the growth of multimedia application, security becomes an...

Temporary centralized network Using On-Demand Routing Protocol 

Applications such as conferences, meetings, lectures, crowd control, search and rescue, disaster recovery, and Army battlefields typically do not have central administration or central infrastructure available.In these s...

Download PDF file
  • EP ID EP121556
  • DOI -
  • Views 134
  • 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