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 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Travelling Salesman Problem using Dynamic Approach

by Reem Al Zoubi, Asiya Abdus Salam
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 94 - Number 16
Year of Publication: 2014
Authors: Reem Al Zoubi, Asiya Abdus Salam
10.5120/16443-6070

Reem Al Zoubi, Asiya Abdus Salam . Travelling Salesman Problem using Dynamic Approach. International Journal of Computer Applications. 94, 16 ( May 2014), 20-23. DOI=10.5120/16443-6070

@article{ 10.5120/16443-6070,
author = { Reem Al Zoubi, Asiya Abdus Salam },
title = { Travelling Salesman Problem using Dynamic Approach },
journal = { International Journal of Computer Applications },
issue_date = { May 2014 },
volume = { 94 },
number = { 16 },
month = { May },
year = { 2014 },
issn = { 0975-8887 },
pages = { 20-23 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume94/number16/16443-6070/ },
doi = { 10.5120/16443-6070 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:17:49.973724+05:30
%A Reem Al Zoubi
%A Asiya Abdus Salam
%T Travelling Salesman Problem using Dynamic Approach
%J International Journal of Computer Applications
%@ 0975-8887
%V 94
%N 16
%P 20-23
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, the Travelling Salesman Problems using dynamic approach is discussed. Increasing development in our life resulted in difficulties to solve problems which can be solved in Generic Algorithm (GA) in an efficient way to reach optimal solution. Generic Algorithm follows sequence of steps to solve any problem (selection, fitness, crossover and mutation). Each of these steps has types which can be selected according to characteristics of the problem. Crossover is exchange information of offspring. So it leads us to focus on it in order to reach optimal solution in least time by changing it from generation to another. In this paper, experiment on the Travelling Salesman Problem (TSP) is applied in which time is saved and problem is solved using two point crossovers.

References
  1. Pable Moscato,"On Genetic Crossover Operators for relative Order Preservation", Caltech concurrent Computation Program 158-79, California Institute of Technology, Pasadena, CA 91125,U. S. A.
  2. Kylie Bryant, "Genetic Algorithms and the Traveling Salesman Problem", Department of Mathematics, Harvey Mudd College, December 2000.
  3. Mouhammd Al kasassbeh, Ahmad Alabadleh, Tahsen Al-Ramadeen," Shared Crossover Method for Solving Traveling Salesman Problem", International Journal of Information and Computer Science, IJICS Volume 1, Issue 6, PP. 153-158, September 2012.
  4. Dr. Mrs. G. Nirmala, Mr. D. Ramprasad, "Innovative PMX – CX – Operators for GA for GA TO TSP ",International Journal of Scientific and Research Publications, Volume 2, Issue 10, ISSN 2250-3153, October 2012.
  5. Er. Ashish Gupta, Er. Shipra Khurana," Study of Traveling Salesman Problem Using Genetic Algorithm ",IJMIE, Volume 2, Issue 5, ISSN: 2249-0558 ,May 2012.
  6. ABDOUN Otman, ABOUCHABAKA Jaafar, "A Comparative Study of Adaptive Crossover Operators for Genetic Algorithms to Resolve the Traveling Salesman Problem ",International Journal of Computer Applications (0975 – 8887) Volume 31– No. 11, October 2011.
  7. Kusum Deep, Hadush Mebrahtu," New Variations of Order Crossover for Travelling Salesman Problem", International Journal of Combinatorial Optimization Problems and Informatics, Vol. 2, No. 1, pp. 2-13. ISSN: 2007-1558, Jan-April 2011.
  8. Namit Gupta and Rajeev Kumar," Using new variation Crossover operator of Genetic Algorithm for Solving the Traveling Salesmen Problem in e-Governance ", New York Science Journal 2012;5(12):164-166, (ISSN: 1554-0200).
  9. Goldberg, D. (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley
Index Terms

Computer Science
Information Sciences

Keywords

GA TSP mutation crossover Static crossover Dynamic crossover

Powered by PhDFocusTM