Scribd
Upload
30 views1 page

Contoh 1: Stagecoach Problem (Backward Recursive) Stage-4

This document describes a 4-stage backward recursive problem to find the optimal route from stage 1 to stage 4 with minimum cost. Each stage has multiple options for the next destination with associated costs. The optimal route is determined to be A-C-E-H-Z with a minimum total cost of $11.

Uploaded by

Maulana Hasan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views1 page

Contoh 1: Stagecoach Problem (Backward Recursive) Stage-4

This document describes a 4-stage backward recursive problem to find the optimal route from stage 1 to stage 4 with minimum cost. Each stage has multiple options for the next destination with associated costs. The optimal route is determined to be A-C-E-H-Z with a minimum total cost of $11.

Uploaded by

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

Contoh 1 : Stagecoach Problem (Backward Recursive)

STAGE-4
X4
H
I

f4 (X4,D4)
D4
Z
3
4

Optimal
D4*

f4* (X4,D4)

Z
Z

3
4

STAGE-3
X3
E
F
G

f3 (X3,D3)
D3
H
1+3=4
6+3=9
3+3=6

I
4+4=8
3+4=7
3+4=7

Kesimpulan
D1* = C
D2* = E
D3* = H
D4* = Z

Optimal
D3

f3* (X3,D3)

H
I
H

4
7
6

A-C-E-H-Z
Polis minimum $11

STAGE-2
X2
B
C
D

E
7+4=11
3+4=7
4+4=8

f2 (X2,D2)
D2
F
4+7=11
2+7+9
1+7=8

B
2+11=13

f1 (X1,D1)
D1
C
4+7=11

Optimal
G
6+6=12
4+6=10
5+6=11

D2*

f2* (X2,D2)

E/F
E
E/F

11
7
8

STAGE-1
X1
A

Optimal
D
3+8=11

X1=
X2=
X3=
X4=

D1*

f1* (X1,D1)

C/D

11

A
C
E
H

You might also like