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

A Survey on Technologies, Applications, Challenges in IOT

IoT would add a new dimension to the world of information and communication. IoT technologies are summarized suchlike RFID systems,NFC,Wireless sensor networks,applications. The impacts of their potential applications ar...

Keystone Error Correction Method in Camera-Projector System to Correct the Projected Image on planar surface and tilted projector

Projector camera systems are basically systems that can serve as improvement to projector based applications by addition of visual feedback to the projector. However, unless the projector is precisely aligned to the pres...

RDF method to improve ontology using RDF algorithm

A Relation description frame work we used semantic based collections using crawlers. The semantic matching and relevancy are made and improved results are obtained. RDF helps us to generate a hierarchy based tree structu...

Vulnerabilities in Existing GSM Technology that causes Exploitation

Global System for Mobile communications (GSM system) has become the most popular standard for digital cellular communication for day to day communication in the world. Cellular phones have become a ubiquitous means of co...

Z-U-T-S SHAPED STRUCTURES IN AN INTEGRATED CPW FED PRINTED MONOPOLE ANTENNA

A dual band co-planar waveguide fed Z-U-T-S shaped monopole antenna is proposed. The antenna is fabricated on an h = 1.6mm FR4 epoxy substrate with dielectric constant εr = 4.3 and loss tangent tan δ = 0.008. The size of...

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