CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Travelling Salesman Problem using Genetic Algorithm

Published on April 2012 by Varshika Dwivedi, Taruna Chauhan, Sanu Saxena, Princie Agrawal
journal_cover_thumbnail

Development of Reliable Information Systems, Techniques and Related Issues (DRISTI 2012)
Foundation of Computer Science USA
DRISTI - Number 1
April 2012
Authors: Varshika Dwivedi, Taruna Chauhan, Sanu Saxena, Princie Agrawal
038a89c5-5146-4a2b-9705-d7ad9c627c37

Varshika Dwivedi, Taruna Chauhan, Sanu Saxena, Princie Agrawal . Travelling Salesman Problem using Genetic Algorithm. Development of Reliable Information Systems, Techniques and Related Issues (DRISTI 2012). DRISTI, 1 (April 2012), 25-30.

@article{
author = { Varshika Dwivedi, Taruna Chauhan, Sanu Saxena, Princie Agrawal },
title = { Travelling Salesman Problem using Genetic Algorithm },
journal = { Development of Reliable Information Systems, Techniques and Related Issues (DRISTI 2012) },
issue_date = { April 2012 },
volume = { DRISTI },
number = { 1 },
month = { April },
year = { 2012 },
issn = 0975-8887,
pages = { 25-30 },
numpages = 6,
url = { /proceedings/dristi/number1/5926-1007/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 Development of Reliable Information Systems, Techniques and Related Issues (DRISTI 2012)
%A Varshika Dwivedi
%A Taruna Chauhan
%A Sanu Saxena
%A Princie Agrawal
%T Travelling Salesman Problem using Genetic Algorithm
%J Development of Reliable Information Systems, Techniques and Related Issues (DRISTI 2012)
%@ 0975-8887
%V DRISTI
%N 1
%P 25-30
%D 2012
%I International Journal of Computer Applications
Abstract

This paper includes a flexible method for solving the travelling salesman problem using genetic algorithm. In this problem TSP is used as a domain.TSP has long been known to be NP-complete and standard example of such problems. There had been many attempts to address this problem using classical methods such as integer programming and graph theory algorithms with different success. This paper offers a solution which includes a genetic algorithm implementation in order to give a maximal approximation of the problem with the reduction of cost. In genetic algorithm crossover is as a main operator for TSP. There were lot of attempts to discover an appropriate crossover operator. This paper presents a strategy to find the nearly optimized solution to these type of problems, using new crossover technique for genetic algorithm that generates high quality solution to the TSP. The efficiency of the crossover operator is compared as against some existing crossover operators. The work proposed here intends to compare the efficiency of the new crossover operator with some existing crossover operators.

References
  1. <ul style="text-align: justify;"> 1. Aybars U?ur, Serdar Koruko?lu, Ali Cal?skan, Muhammed Cinsdikici, Ali Alp Department of Computer Engineering, "Genetic algorithm based solution for TSP on a sphere", Mathematical and Computational Applications, Vol. 14, No. 3, pp. 219- 228, 2009 2. Fozia Hanif Khan, Nasiruddin Khan, Syed InayaTullah, And Shaikh Tajuddin Nizami, "Solving TSP problem by using Genetic Algorithm", International Journal of Basic &amp; Applied Sciences IJBAS Vol: 9 No: 10 3. Zakir H. Ahmed , "Genetic Algorithm for the TSP using Sequential Constructive Crossover Operator" International Journal of Biometrics &amp; Bioinformatics (IJBB) Volume (3): Issue (6) 4. Omar M.Sallabi, "An Improved Genetic Algorithm to Solve the Travelling Salesman Problem" World Academy of Science, Engineering and Technology 52 2009 5. Eric matel , "Solving the travelling salesman problem using a genetic algorithm". 6. Faulkner, G. Talhami, H. ,Kalgoorlie Coll., WA, "Using biological genetic algorit
Index Terms

Computer Science
Information Sciences

Keywords

Genetic Algorithm Travelling Salesman Problem Fittest Criteria crossover Operator