1 / 9

Weighted Graphs and traveling Salesperson problem

Weighted Graphs and traveling Salesperson problem. Unit 3. Sales directors for large companies are often required to visit in a number of different cities. What you want to do is find out how to these visits can be scheduled in the cheapest way. Weighted Graphs.

martin-butler
Télécharger la présentation

Weighted Graphs and traveling Salesperson problem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Weighted Graphs and traveling Salesperson problem Unit 3

  2. Sales directors for large companies are often required to visit in a number of different cities. What you want to do is find out how to these visits can be scheduled in the cheapest way.

  3. Weighted Graphs Is when we assign numbers to the edges of a graph .

  4. Example Use the weighted Graph to find the cost of the trip for the Hamilton circuit A, B, D, C, A. 190 A B 124 155 Answer: From A to B = $190 From B to D = $155 From D to C = $179 From C to A = $124 $190 + $155 + $179 + $124 = $ 648 157 126 D 179 C

  5. The Traveling Salesperson Problem Is the problem of finding a Hamilton circuit in a complete, weighted graph for which the sum of the weights of the edges is a minimum. Such a Hamilton circuit is called the Optimal Hamilton Circuit or the optimal solution.

  6. Tree Diagrams Give all the possible routes you can take on a vertex drawing. The purpose is to find the shortest route using the tree diagram and the weighted edges.

  7. Sorted Edges (Brute Force Method) Is used for finding the optimal Hamilton circuit. Steps: • Make a list of all the possible circuit of the graph. Each represents a tour of all the vertices of the graph. • Calculate the weight for each tour. • Choose the optimal tour(i.e. the one with the smallest measure). You can have more than one optimal tour to choose from.

  8. Example Use the diagram to find the optimal Hamilton Circuit. The sales person want to start from A and end at A. 190 A B 124 155 157 126 D 179 C

More Related