Access over 20 million homework & study documents

Tsp.edited

Content type
User Generated
Subject
Mathematics
Type
Homework
Rating
Showing Page:
1/2
Surname1
Surname
Course name
Professors name
University affiliation
Date
Traveling salesman problem
The problem I am solving involves a business manager who has to supply furniture to
five different cities using the shortest path available. The manager is in this case expected to visit
each city exactly once and only once then return to his initial starting point. The states where the
deliveries have to be made are California, Texas, North Dakota, New York and Wyoming. To
solve this particular problem I am going to employ the use of the Brute Force method. The
technique involves generating all possible tours then computing their distances. The shortest tour
that will be made will be considered to be the optimal tour. The steps are as follows; First and
foremost, I will calculate the total number of tours. Next, I will draw and list all the possible
tours. Thirdly, I will calculate the distance of each tour before finally selecting the shortest tour.
The shortest tour made is the optimal solution.
There are vast expenses that could be incurred while delivering these products. They
include time constraints. It goes without saying that time is a limited resource that cannot be
recovered when lost. Choosing the right path aids in the consumption of less time. The time
saved can be used elsewhere to improve the company. Secondly, we have transport costs.
Identifying the shortest path to deliver the products helps in the reduction of transport costs e.g.
Fuel costs. The saved costs can be channeled to other development projects within the company.

Sign up to view the full document!

lock_open Sign Up
Showing Page:
2/2

Sign up to view the full document!

lock_open Sign Up
Unformatted Attachment Preview
Surname1 Surname Course name Professor’s name University affiliation Date Traveling salesman problem The problem I am solving involves a business manager who has to supply furniture to five different cities using the shortest path available. The manager is in this case expected to visit each city exactly once and only once then return to his initial starting point. The states where the deliveries have to be made are California, Texas, North Dakota, New York and Wyoming. To solve this particular problem I am going to employ the use of the Brute Force method. The technique involves generating ...
Purchase document to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Anonymous
Really helpful material, saved me a great deal of time.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4