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

Content Analysis of Privacy Management Features in Geosocial Networking Application

Geosocial networking application allows user to share information and communicate with other people within a virtual neighborhood or community. Although most geosocial networking application include privacy management fe...

mSCTP Based Decentralized Mobility Framework 

To conceive the full potential of wireless IP services, Mobile Nodes (MNs) must be able to roam seamlessly across different networks. Mobile Stream Control Transmission Protocol (mSCTP) is a transport layer solution, whi...

The Measurement of Rare Plants Learning Media using Backward Chaining Integrated with Context-Input-Process-Product Evaluation Model based on Mobile Technology

This research was aimed to know the effectiveness level of learning media utilization to the introduction of rare plants in Alas Kedaton tourism forest in Tabanan-Bali based on backward chaining for students and the gene...

An Improved Image Steganography Method Based on LSB Technique with Random Pixel Selection

With the rapid advance in digital network, information technology, digital libraries, and particularly World Wide Web services, many kinds of information could be retrieved any time. Thus, the security issue has become o...

An Efficient Method for Distributing Animated Slides of Web Presentations

Attention control of audience is required for suc-cessful presentations, therefore giving a presentation with im-mediate reaction, called reactive presentation, to unexpected changes in the context given by the audience...

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