M8.4 Shortest-Route Problem

The objective of the shortest-route problem is to find the shortest distance from one location to another. In a network, this often involves determining the shortest route from one node to each of the other nodes.

Shortest-Route Technique

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 Design would like to find the route with the shortest distance. The road network is shown in Figure M8.6.

A graph with 6 nodes and edges between them represents roads from Ray Design’s plant to warehouse.

Figure M8.6 Roads from Ray Design’s Plant ...

Get Quantitative Analysis for Management, 13/e now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.