Improving the Solution of Traveling Salesman Problem Using Genetic, Memetic Algorithm and Edge assembly Crossover

Abstract

 The Traveling salesman problem (TSP) is to find a tour of a given number of cities (visiting each city exactly once) where the length of this tour is minimized. Testing every possibility for an N city tour would be N! Math additions. Genetic algorithms (GA) and Memetic algorithms (MA) are a relatively new optimization technique which can be applied to various problems, including those that are NPhard. The technique does not ensure an optimal solution, however it usually gives good approximations in a reasonable amount of time. They, therefore, would be good algorithms to try on the traveling salesman problem, one of the most famous NP-hard problems. In this paper I have proposed a algorithm to solve TSP using Genetic algorithms (GA) and Memetic algorithms (MA) with the crossover operator Edge Assembly Crossover (EAX) and also analyzed the result on different parameter like group size and mutation percentage and compared the result with other solutions.

Authors and Affiliations

Mohd. Haque, Khalid. Magld

Keywords

Related Articles

Mutual Exclusion Principle for Multithreaded Web Crawlers

This paper describes mutual exclusion principle for multithreaded web crawlers. The existing web crawlers use data structures to hold frontier set in local address space. This space could be used to run more crawler thre...

Mobile Learning Application Development for Improvement of English Listening Comprehension

Trend towards English language learning has been increased because it is considered as Lingua franca i.e. language of communication for all. However students of Pakistan are behind in this pace, especially rural elementa...

SecFHIR: A Security Specification Model for Fast Healthcare Interoperability Resources

Patients taking medical treatment in distinct healthcare institutions have their information deeply fragmented between very different locations. All this information --- probably with different formats --- may be used or...

Effects of Modulation Index on Harmonics of SP-PWM Inverter Supplying Universal Motor

This manuscript presents the effects of changing modulation indices on current and voltage harmonics of universal motor when it is supplied by single phase PWM (SP-PWM) inverter, the effect has been analyzed with simulat...

A GA-Based Replica Placement Mechanism for Data Grid

Data Grid is an infrastructure that manages huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. To increase resource availability and to ease resourc...

Download PDF file
  • EP ID EP103482
  • DOI -
  • Views 94
  • Downloads 0

How To Cite

Mohd. Haque, Khalid. Magld (2012).  Improving the Solution of Traveling Salesman Problem Using Genetic, Memetic Algorithm and Edge assembly Crossover. International Journal of Advanced Computer Science & Applications, 3(7), 108-111. https://europub.co.uk/articles/-A-103482