Optimization of TSP using Genetic Algorithm

Authors

  • atul Sharma Department of Computer Science and Engineering, UIET, KUK, Kurukshetra, Haryana, India

DOI:

https://doi.org/10.37591/joosdt.v2i1.364

Abstract

Genetic Algorithm (GAs) is used to solve optimization problems. It is depended on the selection operator, crossover and mutation rates. In this paper Mendel operator and its laws with different crossover & mutation probabilities, is used to solve well known optimization problem, Traveling Salesmen Problem (TSP). We have shown that there are some drawbacks present when we solve TSP with GA.

Keywords: Genetic algorithm, Mendel operator, Travelling Salesmen Problem

 

Cite this Article
Atul Sharma. Optimization of TSP using Genetic Algorithm. Journal of Operating Systems Development & Trends. 2015; 2(1): 21–25p.

References

Whitley D. et al. The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination. 1993.

Xiao Y, Song X, Yao Z. Improved Ant Colony Optimization with Particle Swarm Optimization Operator Solving Continuous Optimization Problems. Computational Intelligence and Software Engineering. 2009.

Dorigo M, Gambardella LM. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans. Evol. Comput. 1997; 1(1): 53–66p.

Botee HM, Bonabeau E. Evolving Ant Colony Optimization. Adv. Complex Syst. 1998; 1(02–03): 149–159p.

Thiele JC, Kurth W, Grimm V. Agent-Based Modelling: Tools for Linking NetLogo and R. J. Artif. Soc. Soc. Simulat. 2012; 15(3): 8p.

Scrucca L. Ga: A Package for Genetic Algorithms in R. J. Stat. Softw. 2012; 53: 1–37p.

Dorigo M, Gambardella LM. Ant Colonies for the Travelling Salesman Problem. Bio Systems. Jul 1997; 43(2): 73–81p.

Deep K, Mebrahtu H. New Variation Of Order Crossover for Travelling Salesman Problem. International J. of Combinatorial Optim. Problems and Informatics. Jan–Apr 2011; 2(1): 2–13p.

Dorigo M, Gambardella LM. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans. Evol. Comput. 1997; 1(1): 53–66p.

Kaur D, Murugappan MM. Performance Enhancement in solving Traveling Salesman Problem using Hybrid Genetic Algorithm. IEEE. 2008. 978-1-4244-2352-1/08.

Downloads

Published

2016-01-12

Issue

Vol. 2 No. 1 (2015)

Section

Research Articles

License

Declaration and Copyright Transfer Form

(to be completed by authors)

I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.

  • I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
  • I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
  • I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
  •  I/We also agree to the authorship of the article in the following order:

Author’s name                                    

 

1. ________________

2. ________________

3. ________________

4. ________________

 

We  Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal.