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

Ontology-based Semantic Search Engine for Healthcare Services

With the development of Web Services, the retrieval of relevant services has become a challenge. The keyword-based discovery mechanism using UDDI and WSDL is insufficient due to the retrieval of a large amount of irrelev...

A Modified Leader Election Algorithm for MANET

Distributed systems are the backbone of modern day computing services. A mobile ad hoc network (MANET) is a collection of mobile nodes that can communicate via message passing over wireless links. Communication takes pla...

ACO in e-Learning: Towards an adaptive learning path

Today we are in an era where drastic advancements in networking and information technology are in action. The learning process has also taken these advancements, as a result of which e-learning came to the scene. Persona...

An Analysis of Irregularities in Devanagari Script Writing – A Machine Recognition Perspective

Abstract— This paper deals with the theoretical analysis of Devanagari script according to machine recognition perspective. An individual having good knowledge of the script of a language can easily read some words writt...

Secure Transmission of Compound Information Using Image Steganography

The security of information handled in real time transmission reception like internet is of paramount consideration, as this information may be confidential. And also, the parameter in concern nowa- days is size as it ma...

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