We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
An Efficient Restoration Method for the Faint Dot Matrix Images

Ao Zhu Peng Cao
Random Articles
Reseach Article

Solving TSP using DARO

by Nitin S. Choubey
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 58 - Number 9
Year of Publication: 2012
Authors: Nitin S. Choubey
10.5120/9311-3543

Nitin S. Choubey . Solving TSP using DARO. International Journal of Computer Applications. 58, 9 ( November 2012), 28-31. DOI=10.5120/9311-3543

@article{ 10.5120/9311-3543,
author = { Nitin S. Choubey },
title = { Solving TSP using DARO },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 58 },
number = { 9 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 28-31 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume58/number9/9311-3543/ },
doi = { 10.5120/9311-3543 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:03:24.170405+05:30
%A Nitin S. Choubey
%T Solving TSP using DARO
%J International Journal of Computer Applications
%@ 0975-8887
%V 58
%N 9
%P 28-31
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Travelling Salesperson Problem is finding a Hamiltonian cycle with minimum weight. The paper presents solution travelling salesperson problem with Genetic Algorithm. Dynamic allocation of reproduction operators and social disaster technique are used for generating the population and based on the convergence analysis of evaluation process. The method is demonstrated and found to be effective in the data set for the cities in the state of Maharashtra.

References
  1. Horowitz E. , Sahani S, and Rajasekaran S, 2007. Fundamentals of Computer Algorithm, University Press, 2007.
  2. Potvin J. Y. , 1996. Genetic algorithms for the travelling salesman problem, Annals of Operations Research, 339–370, 1996.
  3. DARWIN C. , 1859, The origin of species by means of natural selection, 1859.
  4. Holland John H. , 1992. Adaption in Natural and Artificial Systems- Introductory analysis with Application to biology, control and Artificial Intelligence, Bradford Book edition, The MIT Press, England. ,1992.
  5. Goldberg D. , 1989. Genetic Algorithm in Search, Optimization, and Machine Learning. Addison Wesley, 1989.
  6. Nicoar, E. S. , 2009. Mechanisms to Avoid the Premature Convergence of Genetic Algorithms. Universitatea Petrol-Gaze din Ploieti. Matematica-Informatic-Fizica LXI(1), 87–96 2009.
  7. Kureichick, Miagkikh, and Topchy, 1996. Genetic algorithm for solution of the travelling salesman problem with new feature against premature convergence, Working Paper, 1996.
  8. Choubey N. S. , and Kharat M. U. , 2012. Hybrid System for Handling Premature Convergence in GA - Case of Grammar Induction, Applied Soft Computing 2012, doi: 10. 1016 / j. asoc . 2012 . 03. 069.
  9. Choubey N. S. , and Kharat M. U. , 2011. Approaches for Handling Premature Convergence in CFG Induction Using GA, Soft Computing in Industrial Applications, 55-66, Springer Berlin/Heidelberg, 2011.
  10. Sivanandam, Deepa "Introduction to Genetic Algorithm", Springer, 2008.
Index Terms

Computer Science
Information Sciences

Keywords

Genetic Algorithm Evolutionary Computation Travelling Salesperson Problem Premature Convergence problem

Powered by PhDFocusTM