9.5 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. This problem can be modeled as a linear program with 0 and 1 variables, or it could be modeled and solved using a specialized algorithm that is presented in Module 8. The following example is a typical 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, and there are no direct interstate highways to make the delivery easier. Ray would like to find the route with the shortest ...
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.
