Scribd
Upload
64 views5 pages

Shortest Route

The document describes the shortest-route technique to find the shortest distance between two locations on a network. It involves 1) finding the nearest node to the origin and recording its distance, 2) finding the next nearest node and recording its distance, and 3) repeating this process through the entire network to find the shortest distance to the ending node. The document then provides an example problem of finding the shortest route for transporting furniture from a factory to a warehouse through several cities.

Uploaded by

Marian Mariez Pacio
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
64 views5 pages

Shortest Route

The document describes the shortest-route technique to find the shortest distance between two locations on a network. It involves 1) finding the nearest node to the origin and recording its distance, 2) finding the next nearest node and recording its distance, and 3) repeating this process through the entire network to find the shortest distance to the ending node. The document then provides an example problem of finding the shortest route for transporting furniture from a factory to a warehouse through several cities.

Uploaded by

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

Shortest-Route

Marian Mariez B. Pacio


OBJECTIVE
• to find the shortest distance from one location to another.

SHORTEST - ROUTE
Steps of the Shortest-Route Technique

• 1. Find the nearest node to the origin (plant). Put the distance in a box by the node.
• 2. Find the next-nearest node to the origin (plant) and put the distance in a box by the node.
• In some cases, several paths will have to be checked to find the nearest node.
• 3. Repeat this process until you have gone through the entire network. The last distance at the
• ending node will be the distance of the shortest route. You should note that the distance
• placed in the box by each node is the shortest route to this node. These distances are used
• as intermediate results in finding the next-nearest node.

SHORTEST - ROUTE
SHORTEST – ROUTE PROBLEM
Every day, Ray Design, Inc., must transport beds, chairs, and other
furniture items from the factory to the warehouse. This involves going
through several cities. Ray would like to find the route with the shortest
distance. The road network is shown in the figure below

You might also like