Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.

The Shortest Route Problem


Published on

Published in: Economy & Finance, Technology

The Shortest Route Problem

  1. 1. The Shortest-Route Problem<br />+ Trying to find the shortest route from a source or a destination through a connecting network<br />+ The destination may be in any other node in the network.<br />+ This the problem faced by any organization that delivers or picks up material from a number of points. <br />
  2. 2. Shortest-Route Algorithm<br />Construct a list for each node in the network of the branches leading out of that node.<br />Each branch is identified by a two-letter symbol;<br />1st letter is the node a branch leaves from and<br />The 2nd letter is the node it goes to.<br />Directly beside the symbol indicate the length of that branch.<br />Arrange the branches in ascending order of the branch lengths. <br />Table 16-10 BRANCHES LEADING OUT OF EACH NODE IN SHORTEST-ROUTE NETWORK<br />
  3. 3. Step 1. <br />Identify branches that lead away from the origin. <br />Select which of the branches is the shortest.<br />
  4. 4. Step 2. Choose the 2nd nearest nodes to the Origin , those nearest A and B.<br />
  5. 5. Step 3. Choose the 3rd nearest nodes to the Origin, those nearest B and C<br />
  6. 6. Step 4. Choose the 4th nearest route from the Origin, those Nearest C and D<br />
  7. 7. Step 5. Choose the 5th Nearest node from Origin, those nearest D and E. <br />200<br />150<br />