Travelling Salesman Problem

Institution

Name

Introduction

A salesman is required to visit all the cities with a known distance between every two cities keeping in mind that the cities have to be visited once. The problem facing the salesman is to determine the shortest possible route the salesman has to use to visit the towns just once and goes back to the original city.

The Travelling Salesman Problem first statement was made by a Viennese mathematician Karl Menger. It brought a connection and relation with the definition of the curve length proposed by Menger that stated that the stretch of a curves’ distance can be defined as the lower limit upper bound of the groups of all numbers that can be contained by taking each group of points of the curve and producing the shortest length of the polygonal graph. This problem is called the messenger problem.

The Travelling Salesman Problem can be stated as where a network has n cities or nodes, and one of the nodes (node 1) is the origin and the cost of travelling which include the*…show more content…*

No one has come up with the efficient way of coming up with the solution to large size problems as the NP-complete problems are much intractable.

The exact methods provide an exact optimal solution to the problem. One of the ways of solving the Travelling Salesman Problem is simply taking all the available and feasible solutions and evaluating their function values and selecting the best out of the solutions. The process might be inefficient, impractical and time-consuming due to a large number of a possible solution that applies to the problem. Travelling Salesman Problem focuses on getting the heuristically good solution to the problem within a short period.

The solution to the problem can be obtained by carrying numerous trials in the given cities less than their

Institution

Name

Introduction

A salesman is required to visit all the cities with a known distance between every two cities keeping in mind that the cities have to be visited once. The problem facing the salesman is to determine the shortest possible route the salesman has to use to visit the towns just once and goes back to the original city.

The Travelling Salesman Problem first statement was made by a Viennese mathematician Karl Menger. It brought a connection and relation with the definition of the curve length proposed by Menger that stated that the stretch of a curves’ distance can be defined as the lower limit upper bound of the groups of all numbers that can be contained by taking each group of points of the curve and producing the shortest length of the polygonal graph. This problem is called the messenger problem.

The Travelling Salesman Problem can be stated as where a network has n cities or nodes, and one of the nodes (node 1) is the origin and the cost of travelling which include the

No one has come up with the efficient way of coming up with the solution to large size problems as the NP-complete problems are much intractable.

The exact methods provide an exact optimal solution to the problem. One of the ways of solving the Travelling Salesman Problem is simply taking all the available and feasible solutions and evaluating their function values and selecting the best out of the solutions. The process might be inefficient, impractical and time-consuming due to a large number of a possible solution that applies to the problem. Travelling Salesman Problem focuses on getting the heuristically good solution to the problem within a short period.

The solution to the problem can be obtained by carrying numerous trials in the given cities less than their

Related

- Decent Essays
## The Optimization Problems Of Swarm Intelligence

- 1418 Words
- 6 Pages

The combinatorial optimization problems such as Travelling Salesman Problem, Minimum Spanning Tree Problem, Vehicle Routing Problem etc. aims at finding an optimal object from a finite set of objects. Brute force methods which include exhaustive search are not feasible for such problems. In recent years many new and interesting methods are applied for the solution of such problems. These methods such as genetic algorithms (GA), Simulated Annealing, Tabu Search, and Neural Networks are inspired from

- 1418 Words
- 6 Pages

Decent Essays - Good Essays
## Improving the Efficiency and Effectiveness of the School Bus Routing Problem

- 1097 Words
- 5 Pages
- 4 Works Cited

manufacturer to consumer but focuses on the management of logistics and transportation under the School Bus routing Problem. Logistics Management can be defined as the process of planning, control and application of an operational and cost conscious

- 1097 Words
- 5 Pages
- 4 Works Cited

Good Essays - Good Essays
## Energy Efficient Clustering Of Wireless Sensor Networks

- 2688 Words
- 11 Pages

behavior of Bees as seeking food. To minimize the energy consumption it is signiﬁcant to plan a data collection path with the minimum length to complete the data collection work. So in this paper, we determine that this problem which can be solve as traveling salesman problem, it 's also called as

- 2688 Words
- 11 Pages

Good Essays - Better Essays
## Permutation Based Encoding

- 3426 Words
- 14 Pages

This chapter focuses on the evolutionary approaches to optimization problems based on permutation encoded individuals. A new proposed recombination operator for permutation based encoding is described \cite{Chira-2012}. The proposed operator is using not only genetic information from the two parents, but from the best individual obtained up to the current generation too. Some of the most widely studied NP-hard optimization problems with many applications in domains such as logistics, planning, routing

- 3426 Words
- 14 Pages

Better Essays - Decent Essays
## Essay On ACO

- 851 Words
- 4 Pages

applied to the travelling salesman problem. Since then, many variants of this technique have been produced. ACO is a probabilistic technique that can be applied to generate solutions for combinatorial optimizations problems. The artificial ants in the algorithm represent the stochastic solution construction procedures which make use of the dynamic evolution of the pheromone trails that reflects the ants' acquired search experience and the heuristic information related to the problem in hand, in order

- 851 Words
- 4 Pages

Decent Essays - Better Essays
## What I Have Majored And Systems Engineering ( Ise ) For One And A Half Years At Virginia Tech

- 1114 Words
- 5 Pages

to travel several kilometers through mountains to school. Our team met many problems. For example, how to visit students ' homes in the shortest routes. We did not find a way out at that time. However, I never forgot to find simple and effective solutions. To my great delight, in the Operations Research (OR) course I took after the summer vacation, I found that the Travelling Salesman Problem were so similar to problems we met at Tibet. Got inspired by the algorithms, I designed a project named Application

- 1114 Words
- 5 Pages

Better Essays - Decent Essays
## The Supermarket : Prime Real Estate

- 963 Words
- 4 Pages

Whenever I go to Stop & Shop, I tend to take interest in the thousands of products that surround me as I walk down an aisle. The wafting aroma of freshly baked pastries and the sight of cold soft drinks are just some of the things that trigger my appetite for food. Most often, I find myself buying more than what I originally planned on. That’s exactly what the layout of a supermarket tries to make consumers do. Marion Nestle argues in her article, “The Supermarket: Prime Real Estate”, how supermarkets

- 963 Words
- 4 Pages

Decent Essays - Good Essays
tractability explores problems and algorithms that can take an impossible amount of computation to solve. Tractable problems can be roughly defined as problems that can be solved in a reasonable amount of time, while intractable problems are those which take too long to solve to be useful. Finding solutions to these problems is a key problem in computer science today and has been for many years. It is also important for a computer scientist to recognise intractable problems as it would be a huge

- 2639 Words
- 11 Pages

Good Essays - Better Essays
## Soft Computing Practical File

- 4081 Words
- 17 Pages

practaSAGAR INSTITUTE OF RESEARCH AND TECHNOLOGY SOFT COMPUTING PRACTICAL FILE (CS-801) Subject Guide: Submitted by: INDEX

- 4081 Words
- 17 Pages

Better Essays - Good Essays
## Causes Of Willy's Tragedy In Death Of A Salesman By Arthur Miller

- 1478 Words
- 6 Pages

once said, “It is not the strongest of the species that survive, nor the most intelligent but the most responsive to change.” (University of Cambridge, 1). In the play Death of a Salesman by Arthur Miller, Willy Loman is a 63 year old travelling who has been slowly deteriorating due to his age and mental health problems. The play takes place in New England where Willy often travels to several locations around the United States of America selling his goods with little to no success. In the play

- 1478 Words
- 6 Pages

Good Essays