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

Schedule Risk Analysis Simulator using Beta Distribution

This paper describes an application of simulation and Modelling in Software risk management. This paper describes a simulation based software risk management tool which helps manager to identify high risk areas of softwa...

An Analysis of Particle Swarm Optimization with Data Clustering-Technique for Optimization in Data Mining.

Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. Clustering aims at representing large datasets by a fewer number of prototypes or clusters. It brings simplicity i...

An Improved Framework for Enhancing QoS in MIPv6

With the advent of technology, a large number of wireless and mobile devices are being connected to the internet increasingly giving the users access to the internet while on move. This mobility has been supported throug...

Color Image Segmentation for Satallite Images

This paper introduces efficient and fast algorithms for unsupervised image segmentation, using low-level features such as color, applied on satellite images. With the increase in spatial resolution of satellite imagery,...

Smart phone Application using Morse Code and Inaudible Frequency

In this paper, the wireless communication using Morse code and inaudible frequency has been discussed. The application of this project is to transfer the limited information with the help of inaudible frequency and AAC....

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