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

QoS- unbroken traffic lane streaming in Road network

At present situation travel becomes the biggest hassle for everyone. In this proposed research paper I have used GPS system to find out the shortest path to make your travel at ease. Through this navigation process it is...

AN OVERVIEW OF BIOMETRICS

The term biometrics is derived from the Greek words bio eaning “life” and metrics meaning “ to measure” . Biometrics refers to the identification or verification of a person based on his/her physiological and/or behavio...

SUPPORT VECTOR MACHINE BASED GUJARATI NUMERAL RECOGNITION

In this paper we propose the Support Vector Machine (SVM) based recognition scheme towards the recognition of Gujarati handwritten numerals. The preprocessing is done considering morphological operations. For computing t...

Explore the Performance of the ARM Processor<br /> Using JPEG

Recently, the evolution of embedded systems has shown a strong trend towards application- specific, single- chip solutions. The ARM processor core is a leading RISC processor architecture in the embedded domain. The ARM...

Sectorization of Walsh and Walsh Wavelet in CBIR

this paper proposes the new Walsh Wavelet generation and its use in the Content based image retrieval. The Walsh Wavelet has been used to transform the images and sectored it into various sector sizes to generate the fea...

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