Scribd
Upload
495 views9 pages

Stagecoach Problem

This document describes solving a stagecoach problem to find the shortest path between two nodes in a distance network. It breaks the network into four stages defined by vertical columns of nodes. It then works backwards through each stage using recursive equations to calculate the shortest distances. The final shortest path from node 1 to node 11 is 1-5-8-10-11, with a corresponding shortest distance of 16 units.

Uploaded by

James Roy
Copyright
© Attribution Non-Commercial (BY-NC)
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
495 views9 pages

Stagecoach Problem

This document describes solving a stagecoach problem to find the shortest path between two nodes in a distance network. It breaks the network into four stages defined by vertical columns of nodes. It then works backwards through each stage using recursive equations to calculate the shortest distances. The final shortest path from node 1 to node 11 is 1-5-8-10-11, with a corresponding shortest distance of 16 units.

Uploaded by

James Roy
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 9

STAGECOACH PROBLEM

A distance network consists of eleven nodes which are distributed as shown in Figure 8.1. Find the shortest path from node 1 to node 11 and also the corresponding distances.

SOLUTION

Each pair of adjacent vertical columns of nodes is treated as a stage. As shown in Figure 8.2, there are four stages in this problem. Since the stages are defined from right to left, backward recursive function is to be used.

STAGE 1

EQUATION: 1 1 = (1 , 1 )

STAGE 2

EQUATION: 2 2 = 2 , 2 + 1 1 = 2

STAGE 3

EQUATION: 3 3 = 3 , 3 + 2 2 = 3

STAGE 4

EQUATION: 4 4 = 4 , 4 + 3 3 = 4

Summary

The final results of the original problem are traced in Tables 8.14 to Table 8.11 backwards. Therefore, the shortest path is 1-5-8-10-11. Hence, the corresponding shortest distance = 16 units.

Reference

OPERATIONS RESEARCH 2ND EDITION R. PANNEERSELVAM

You might also like