Solving Travelling Salesman Problem using Clustering Genetic Algorithm

Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 7

Abstract

Solving NP hard problem like Travelling Salesman Problem (TSP) is a major challenge faced by analysts even though many techniques are available. Many versions of Genetic Algorithms are introduced by researchers to improve its performance in solving TSP. Clustering Genetic Algorithm (CGA) was recently introduced and this paper analyzes the results obtained by implementing it for TSP. It is observed that CGA effectively finds out more optimal solution sooner than the Standard Genetic Algorithm (SGA) in 3 different instances considered.

Authors and Affiliations

R. SIVARAJ , Dr. T. RAVICHANDRAN , R. DEVI PRIYA

Keywords

Related Articles

Multi Feature Content Based Image Retrieval

There are numbers of methods prevailing for Image Mining echniques. This Paper includes the features of four techniques I,e Color Histogram, Color moment, Texture, and Edge Histogram Descriptor. The nature of the Image...

Approaches for Managing and Analyzing Unstructured Data

Large volumes of data that will be stored and accessed in future is unstructured. The unstructured data is generated in a very fast pace and uses large storage areas. This increases the storage budget. Extracting value f...

A COMPARATIVE STUDY OF FUZZY MODELS IN DOCUMENT CLUSTERING

The availability of large quantity of text documents from the World Wide Web and business document management systems has made the dynamic separation of texts into new categories as a very important task for every busine...

We.I.Pe: Web Identification of People using e-mail ID

With the phenomenal growth of content in the World Wide Web, the diversity of user supplied queries have become vivid. Searching for people on the web has become an important type of search activity in the web search eng...

SRGM with logistic-exponential Testing-effort function with change-point and Analysis of Optimal release policies based on increasing the test efficiency

Reliability is the one of the important factor of software quality. Past few decades several software reliability growth models are proposed to access the quality of the software. Main challenging task of reliability gro...

Download PDF file
  • EP ID EP119708
  • DOI -
  • Views 112
  • Downloads 0

How To Cite

R. SIVARAJ, Dr. T. RAVICHANDRAN, R. DEVI PRIYA (2012). Solving Travelling Salesman Problem using Clustering Genetic Algorithm. International Journal on Computer Science and Engineering, 4(7), 1310-1317. https://europub.co.uk/articles/-A-119708