(3.236.51.151)
Users online: 2117    [ij] [ij] [ij] 
Email id
 

Research Journal of Pharmacy and Technology
Year : 2018, Volume : 11, Issue : 1
First page : ( 255) Last page : ( 258)
Print ISSN : 0974-3618. Online ISSN : 0974-360X.
Article DOI : 10.5958/0974-360X.2018.00048.3

Solution Concept in TSP Problem Applied to Genetic Algorithm

Vasavi J.*

Assistant Professor, Department of Computer Applications, SRM University, Chennai, Tamilnadu, India

*Corresponding Author E-mail: vasnathan2008@gmail.com

Online published on 12 June, 2018.

Abstract

The main purpose of this study is to propose a new representation method of chromosomes using binary matrix and new fittest criteria to be used as method for finding the optimal solution for TSP. The concept of the proposed method is taken from genetic algorithm of artificial inelegance as a basic ingredient which has been used as search algorithm to find the near-optimal solutions. Here we are introducing the new fittest criteria for crossing over, and applying the algorithm on Symmetric as well as asymmetric TSP, also presenting asymmetric problem in a new and different way.

Top

Keywords

Genetic algorithm, fittest criteria, asymmetric travelling salesman problem.

Top

  
║ Site map ║ Privacy Policy ║ Copyright ║ Terms & Conditions ║ Page Rank Tool
518,968,009 visitor(s) since 30th May, 2005.
All rights reserved. Site designed and maintained by DIVA ENTERPRISES PVT. LTD..
Note: Please use Internet Explorer (6.0 or above). Some functionalities may not work in other browsers.