Scribd
Upload
122 views

The Travelling Salesman Problem

The Travelling Salesman problem (TSP) is a problem in combinatorial optimization where the task is to find the shortest route to visit each of a number of cities only once. It has applications in logistics and manufacturing. Exact solutions are possible for up to around 15,000 cities using techniques like branch-and-bound and cutting planes, while genetic algorithms provide good approximations and can scale to larger problem sizes by evolving populations of solutions. This document discusses using a genetic algorithm approach to solve the TSP, representing solutions as paths and using selection, crossover and mutation to iteratively improve the population until a stopping criterion is met.

Uploaded by

Sayantan Ghosh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
122 views

The Travelling Salesman Problem

The Travelling Salesman problem (TSP) is a problem in combinatorial optimization where the task is to find the shortest route to visit each of a number of cities only once. It has applications in logistics and manufacturing. Exact solutions are possible for up to around 15,000 cities using techniques like branch-and-bound and cutting planes, while genetic algorithms provide good approximations and can scale to larger problem sizes by evolving populations of solutions. This document discusses using a genetic algorithm approach to solve the TSP, representing solutions as paths and using selection, crossover and mutation to iteratively improve the population until a stopping criterion is met.

Uploaded by

Sayantan Ghosh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

The Travelling Salesman problem (TSP) is a problem in combinatorial optimization studied

in operations, research and theoretical computer science. The problem is to find the
shortest possible path, given N vertices so that each vertex is visited exactly once. The TSP
has several applications in planning, logistics, and the manufacture of microchips,
scheduling of service calls at cable firms, the delivery of meals to home bound persons, the
scheduling of stacker cranes in warehouses, the routing of trucks for parcel post pickup,
and a host of others. Many methods such as Dynamic Programming technique, Branch and
Bound technique, Heuristic method, Genetic Algorithm technique have been developed for
solving this problem. Recent implementations of branch-and-bound and cut based on linear
programming works very well for up to 5,000 cities, and this approach has been used to
solve instances with up to 33,810 cities. An exact solution for 15,112 German cities from
TSPLIB was found in 2001 using the cutting-plane method proposed by George Dantzig,
Ray Fulkerson, and Selmer Johnson in 1954, based on linear programming [28]. Genetic
Algorithm is another technique which can also find solution to this problem and many
researches are being carried out in this domain. The major advantage of genetic algorithms
is their flexibility and robustness. They are also readily amenable to parallel implementation.
Using this method repeatedly, the population will hopefully evolve good solutions. They are
able to solve problems knowing nothing about the problem from the start. Genetic
Algorithms are explained in detail, including the various operators and parameters of GA as
follows.

Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of
the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation
usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling
salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation
operators. To tackle the traveling salesman problem using genetic algorithms, there are various
representations such as binary, path, adjacency, ordinal, and matrix representations. In this project,
genetic algorithm concepts are proposed for traveling salesman problem to minimize the total distance.
This approach has been linked with path representation, which is the most natural way to represent a legal
tour. Computational results are also reported with some traditional path representation methods like
partially mapped.

Travelling salesman problem (TSP) is a combinatorial optimization problem. It is NP hard problem


and TSP is the most intensively studied problem in the area of optimization. But with the increase in
the number of cities, the complexity of the problem goes on increasing. In this project, this problem
Travelling Salesman Problem is solved using Genetic algorithm approach. System starts from a
matrix of the calculated Euclidean distances between the cities to be visited by the travelling
salesman and randomly chosen city order as the initial population. Then new generations are
created repeatedly until the proper path is reached upon reaching a stopping criterion.

You might also like