A Genetic Algorithm for Solving Travelling Salesman Problem

Abstract

In this paper we present a Genetic Algorithm for solving the Travelling Salesman problem (TSP). Genetic Algorithm which is a very good local search algorithm is employed to solve the TSP by generating a preset number of random tours and then improving the population until a stop condition is satisfied and the best chromosome which is a tour is returned as the solution. Analysis of the algorithmic parameters (Population, Mutation Rate and Cut Length) was done so as to know how to tune the algorithm for various problem instances.

Authors and Affiliations

Adewole Philip, Akinwale Adio Taofiki, Otunbanowo Kehinde

Keywords

Related Articles

Formalization of Behavior Change Theories to Accomplish a Health Behavior

The objective of this paper is to study theories behind behavior change and adaptation of behavior. Humans often live according to habitual behavior. Changing an existing behavior or adopting a new (healthier) behavior i...

Cyber-Security Incidents: A Review Cases in Cyber-Physical Systems

Cyber-Physical Systems refer to systems that have an interaction between computers, communication channels and physical devices to solve a real-world problem. Towards industry 4.0 revolution, Cyber-Physical Systems curre...

Finite Elements Modeling of Linear Motor for Automatic Sliding Door Application

In this paper, a linear switched reluctance motor is designed and investigated to be used as a sliding door drive system. A non linear two dimensions finite model is built to predict the performance of the designed motor...

A Novel Assessment to Achieve Maximum Efficiency in Optimizing Software Failures

Software Reliability is a specialized area of software engineering which deals with the identification of failures while developing the software. Effective analysis of the reliability helps to signify the number of failu...

Design of an Intelligent Combat Robot for war fields

The objective of this paper is to minimize human casualties in terrorist attack such as 26/11. The combat robot [1] has been designed to tackle such a cruel terror attacks. This robot is radio operated, self- powered, an...

Download PDF file
  • EP ID EP124204
  • DOI -
  • Views 79
  • Downloads 0

How To Cite

Adewole Philip, Akinwale Adio Taofiki, Otunbanowo Kehinde (2011). A Genetic Algorithm for Solving Travelling Salesman Problem. International Journal of Advanced Computer Science & Applications, 2(1), 26-29. https://europub.co.uk/articles/-A-124204