Electrical and Electronic Engineering

p-ISSN: 2162-9455    e-ISSN: 2162-8459

2020;  10(2): 27-31


Received: Nov. 28, 2020; Accepted: Dec. 20, 2020; Published: Dec. 28, 2020


Solving Traveling Salesman Problem by Using Genetic Algorithm

Ripon Sorma1, Md. Abdul Wadud1, S. M. Rezaul Karim1, F. A. Sabbir Ahamed2

1Department of EEE, International University of Business Agriculture and Technology, Uttara Dhaka, Bangladesh

2Department of Physics, International University of Business Agriculture and Technology, Uttara Dhaka, Bangladesh

Correspondence to: Ripon Sorma, Department of EEE, International University of Business Agriculture and Technology, Uttara Dhaka, Bangladesh.


Copyright © 2020 The Author(s). Published by Scientific & Academic Publishing.

This work is licensed under the Creative Commons Attribution International License (CC BY).


This analysis investigated the appliance of the Genetic algorithmic rule capable of finding the representative drawback. Genetic Algorithms square measure able to generate in turn shorter possible tours by victimization info accumulated among the type of a secretion path deposited on the perimeters of the representative drawback graph. pc Simulations demonstrate that the Genetic algorithmic rule is capable of generating batter solutions to each bilaterally symmetric and uneven instances of the representative drawback. the tactic is Associate in Nursing example, like simulated tempering Associate in Nursing organic process computation of the productive use of a natural figure to vogue an optimization algorithmic rule. A study of the genetic algorithmic rule explains its performance and shows that it's about to be seen as a parallel variation of tabu search, with implicit memory. The genetic algorithmic rule is that the best in machine time however least economical in memory consumption. The Genetic algorithmic rule differs from the nearest neighborhood heuristic in that it considers the closest route of the neigh-boyhood heuristic considers the closest path. The Genetic algorithmic rule needs a system with parallel design and its optimum implementation. The activities of every genetic algorithmic rule ought to be run as a separate OS method.

Keywords: Genetic Algorithm, Fuzzy system, Machine learning, Applying Genetic Algorithm, Mat Lab work

Cite this paper: Ripon Sorma, Md. Abdul Wadud, S. M. Rezaul Karim, F. A. Sabbir Ahamed, Solving Traveling Salesman Problem by Using Genetic Algorithm, Electrical and Electronic Engineering, Vol. 10 No. 2, 2020, pp. 27-31. doi: 10.5923/j.eee.20201002.02.

1. Introduction

The traveling salesman problem (TSP) may be a well-known and important combinatorial optimization problem. The goal is to hunt out the shortest tour that visits every town throughout a given list specifically once then returns to the beginning town. In distinction to its easy definition, resolution the TSP is tough since it is a Negative-Positive (NP) complete downside. With the exception of its theoretical approach, the TSP has several applications. Some typical applications of TSP embrace vehicle routing, pc wiring, cutting wallpaper, and job sequencing. The most application in statistics is combinatorial knowledge analysis, e.g., rearrangement rows and columns of knowledge matrices or distinctive clusters. Travelling salesman Problem (TSP) is one in every off the benchmark and previous issues in applied science and research. The goal is to hunt out the shortest tour that visits every town throughout a given list specifically once then returns to the beginning town [1]. A genetic algorithmic rule is also a method used for estimating pc models supported ways custom-made from the sector of biological science in biology. To use this technique, one encodes potential model behaviors into ''genes". When every generation, these models are rated and allowed to mate and breed supported their twenty-eight fitness. Within the method of sexual union, the genes are changed, crossovers and mutations will occur. This population is discarded and its offspring forms ulterior generation [2].
In a manner of victimization GA in resolution TSP, the next ways are used;
1. Simulated hardening, supported natural hardening processes.
2. Artificial Neural Networks, supported processes in central nervous systems.
3. Biological process Computation supported biological evolution processes [12].
The algorithms galvanized by biological process Computation are known as biological process algorithms.

2. Genetic Algorithm

Genetic Algorithms (GA) are adjective heuristic search algorithmic rule premised on the organic process ideas of natural process and genetic [6]. The essential thought of GAs is meant to simulate processes in natural system necessary for evolution, specifically people who follow the principles initial arranged down by Charles Darwin of survival of the fittest [4,5]. Associated of itself} they represent an intelligent exploitation of a random search at intervals an outlined search area to unravel a haul.

2.1. Control Parameters

These area unit the parameters that govern the GA search method those are [9]:
(a) Population size: It determines what number chromosomes and thenceforth, what quantity genetic material is available to be used throughout the search. If there's insufficient, the search has no likelihood to adequately cowl the space. If there's an excessive amount of, the GA wastes time evaluating chromosomes [7,8].
(b) Crossover chance: It specifies the probability of crossover occurring between 2 chromosomes.
(c) Mutation chance: It specifies the probability of doing bit-wise mutation.
(d) Termination criteria: It specifies once to terminate the genetic search.
Structure of genetic algorithms
GAs could also be summarized as follows [10]:
GA ( )
Valuate the population;
Generation = 0;
Whereas termination criterion isn't glad;
Choose sensible chromosomes by replica procedure;
Perform crossover with chance of crossover (Pc);
Choose fitter chromosomes by survivor choice procedure Perform mutation with chance of mutation Judge the population;

2.2. Fuzzy System

A fuzzy system could be a system supported symbolic logic a mathematical system that analyzes analog input values in terms of logical variables that fight continuous values between zero and one, in distinction to classical or digital logic, that operates on separate values of either one or zero (true or false, respectively) The term "fuzzy" refers to the very fact that the logic concerned will influence ideas that can't be expressed because the "true" or "false" but rather as "partially true" [13,14]. Though various approaches like genetic algorithms and neural networks will perform even as well as symbolic logic in several cases, fuzzy logic has the advantage that the answer to the matter are often forged in terms that human operators will perceive, so their expertise are often employed in the planning of the controller. This makes it easier to mechanize tasks that area unit already with success performed by humans.

2.3. Neural Network

A neural network could be a system of programs and information structures that approximates the operation of the human brain. A neural network usually involves AN outsized form of processors operational in parallel, every with its own little sphere of knowledge and access to information in its native memory [15]. Typically, a neural net-work is initially "trained" or fed big amounts and rules regarding information relationships (for example, "A forebear is older than somebody's father"). A program can then tell the network the thanks to behave in response to Associate in Nursing external stimulation (for example, to input from an individual's administrative unit is interacting with the network) or can initiate activity on its own (within the boundaries of its access to the external world). Neural networks use several principles, in addition as gradient-based coaching job.

2.4. Machine Learning

Machine learning may well be a subfield of computing that evolved from the study of pattern recognition and machine learning theory in computing [11]. Machine learning explores the study and construction of algorithms which will learn from and build predictions on info. Such algorithms operate by building a model from example inputs so as to create data-driven predictions or decisions, rather than following strictly static program directions [4]. Machine learning is closely related to machine statistics; a discipline that aims at the planning of algorithms for implementing applied math ways that on computers. Its durable ties to mathematical improvement that delivers ways that, theory and application domains to the arena. Ma-chine learning is employed in associate degree passing vary of computing tasks where planning and programming specific algorithms is impossible. Example applications embrace spam filtering, optical character recognition (OCR), search engines and laptop vision. within the gift work I even have chosen genetic rule to unravel the voice downside. at intervals future chapter a survey on determination voice draw back has been administered.

3. Literatures Review

Varshika (2012) projected the work that uses TSP domain and its resolved using genetic algorithmic rule operators. The genetic algorithmic rule is employed for the aim of improving the answer house. The crossover is that the necessary stage within the genetic algorithm.
Naveen (2012) have done the survey on the traveling salesman downside using varied genetic algorithmic rule operators. The projected work solves the motion salesman downside exploitation varied genetic algorithmic rule operators. The assorted ways for the genetic algorithmic rule operators like choice ways, crossover ways and mutation methods also are mentioned within the paper.
Omar (2009) projected associate degree improved genetic algorithmic rule wherever the new crossover operation, population reformulation operation, multi-mutation operation, partial local optimum mutation operation, and arranging operations area unit accustomed solve the Traveling Salesman downside.
Chetan (2011) resolved the traveling salesman downside exploitation genetic algorithm operators. The paper conjointly includes a comparative study on varied parent selection ways like game equipment, political theory and Tournament choice ways for Travelling Salesman downside. This paper concludes that each one the 3 choice ways give similar answer once the population size is tiny however once the population size is large political theory methodology offers the higher result.
A. Arananayakgi (2014) solved the motion downside exploitation genetic algorithmic rule operators to scale back the entire distance and time. This is often achieved by generating the fittest criteria exploitation choice, crossover and mutation operators. The most aim of the projected method is to provide the prime quality solutions in affordable time. Therefore, a brand-new crossover method, the sequent Constructive Crossover methodology is employed. This methodology can select the better edges from the parent body and manufacture a brand-new offspring which can have same edges because the folks or it's going to have new edges that isn't gift within the parent chromosomes.
Kasassbeh et al (2012) projected a brand-new crossover methodology that is employed and it's called as a Shared Crossover methodology. This methodology is easy and quick and also the main aim is to reduce the execution time. This new technique depends on passing as several as attainable of the shared methods between cities to following generation with a guarantee that none of the cities can seem within the kid body quite once when applying the crossover method. The experimental results conjointly show the larger reduction within the time consumption.

4. Research Methodology

Figure 1. Flowchart of Research Methodology

5. Result and Discussion

Distances between 10 cities
Figure 2. Line chart of order of city travel
Above this line chart, we can understand the order of city travel. It shows the least distance path. So the cost will be reduce. From our research we can understand the minimum distance to travel from one city to another city.
Results and Finding.
Ø Genetic formula is that the economical most effective best in process time however least efficient in memory consumption.
Ø It can use to drilling of printed circuit board.
Ø We can design of global navigation satellite system.

6. Conclusions

The Genetic rule may be a terribly economical and correct optimization approach. Sadly, it needs an outsized quantity of memory and parallel system design for its complete implementation. The genetic rule was found to still be the most effective in resolution combinatorial optimization issues (as it's general united by man of science round the world). we have with success drawn out a model for the genetic algorithms, the look and also the implementation. It is often used with success in giant industries like Coca-Cola, denote mill to resolve distribution issues, electronic industries like Intel for board drilling, order choosing in a very warehouse etc.


[1]  B. Freisieben and P. Merz, New Genetic native Search Operator for bagman drawback, Conference on Parallel drawback determination From nature, app. 890-899, 1996.
[2]  H. Braun, “On determination bagman drawback by Genetic Algorithm”, in Parallel Problem- determination from Nature, Lecture Notes in engineering science 496, H.P. Schwefel and R. Manner Eds, Springer-Verlag, app. 129-133.
[3]  M. Dorigo and L. M. Gambradella, hymenopteron Colony System: A Cooperative Learning Approach to the bagman drawback, JEEE group action on biological process Computation, Vol. l, pp. 53-66, 1997.
[4]  D.E. Goldberg, Genetic formula in Search, improvement and Machine Learning. Addison-Wesley, 1989.
[5]  Naef Taher Al Rahedi and Jalal Atoum, determination TSP drawback victimization New Operator in Genetic Algorithms, yankee Journal of Applied Sciences 6(8): 1586-1590, 2009.
[6]  Reuben Lucius Goldberg D., Computer-Aided Pipeline Operations victimization Genetic Algorithms and Rule Learning. half I; Genetic Algorithms in pipeline improvement, Engineering with laptop three, 1987.
[7]  Greffenstette, J., Genetic Algorithms created simple, 1991.
[8]  Seniw, D., A Genetic formula for the bagman drawback, MSc Thesis, University of North geographical region, at Charlotte. http://www.heatonresearch.com/articales/65/page1.html. 1996.
[9]  B. Freisleben and P. Merz, “A Genetic native search formula for determination trigonal and uneven bagman issues,” International Conference On biological process Computation, pp. 616-621, 1996.
[10]  K. E. Nygard and C. H. Yang, ”Genetic formula for the bagman drawback With Time Window”, in engineering science and Operations Research: New Development in their Interface, O. Balci, R. Sharda and S. A. Zenios Eds, Pergamon Press, pp. 411-423.
[11]  Ackley, D. H. (1987). A Connectionist Machine for Genetic Hill rising. Kluwer tutorial Publishers.
[12]  Ambati, B. K., Ambati, J. & Mokhtar, M.M. (1991). Heuristic Combinatorial improvement by Simulated Darwinian Evolution: A Polynomial Time formula for the travelling salesman drawback. Biological IP 65: 31–35.
[13]  Banzhaf, W. (1990). The “Molecular” travelling salesman. Biological IP 64: 7– fourteen.
[14]  Beyer, H. G. (1992). Some Aspects of the ‘Evolution Strategy’ for determination TSP Like improvement issues showing at the planning Studies of the zero. 5 TeVe+eLinear accelerator.
[15]  In M¨anner, R. & Manderick, B. (eds.) Parallel drawback determination from Nature two, 361–370. Amsterdam: North Netherlands.