Study of Traveling Salesman Problem Using Genetic Algorithm

Abstract

The traveling salesman problem is a permutation problem in which the goal is to find the shortest path between N different cities that the salesman takes is called the TOUR. In other words, the problem deals with finding a route covering all cities so that the total distance traveled is minimal. This paper gives a solution to find an optimum route for traveling salesman problem using Genetic algorithm technique, in which cities are selected randomly as initial population. The new generations are then created repeatedly until the proper path is reached upon reaching the stopping criteria.

Authors and Affiliations

Er. Ashish Gupta and Er. Shipra Khurana

Keywords

Related Articles

Information Leakage Prevented by Data Encryption using Smartcard

Information leakage has recently become a serious problem and most often a result of actions inside rather than outside the system that should be protecting the information. Although system administrators have high acc...

SHORTEST PATH ALGORITHMS: A COMPARATIVE ANALYSIS

Now a days routing is the vital problem while forwarding information from one node to another node in communication networks. Routing in today’s network is accomplished by shortest path routing algorithm. There are dif...

A CASE STUDY: INCREASING THE AERATION EFFICIENCY BY REDESIGNING THE AERATOR FOR A TERTIARY TREATMENT PLANT IN A NITROGENOUS FERTILIZER PLANT

The main objective of this work is to redesign the aerator which is used for a tertiary treatment plant in a nitrogenous fertilizer plant. The existing aerator used in the fertilizer tertiary treatment plant is surface...

Restricted Flow In A Non Linear Capacitated Transportation Problem With Bounds on Rim Conditions

This paper discusses restricted flow in a fixed charge capacitated transportation problem with bounds on total source availabilities and total destination requirements . The objective function is the sum of two linear...

A Survey on Data Security & Computer Networks.

This research deals with data security in distributed and client/server computer systems, placing special emphasis on access security. The paper presents the subject of data security & computer Networks in these system...

Download PDF file
  • EP ID EP26671
  • DOI -
  • Views 298
  • Downloads 6

How To Cite

Er. Ashish Gupta and Er. Shipra Khurana (2012). Study of Traveling Salesman Problem Using Genetic Algorithm. International Journal of Engineering, Science and Mathematics, 2(5), -. https://europub.co.uk/articles/-A-26671