DP 1
DP 1
Contents
4
2 6
7 5
8
8
5 8
8 8
5 10 9
1 3 6 10
5 7
6 9 9
4 5
5
4 7 7
7
s X1 f1(s) X1*
8 10 8 10
9 10 9 10
Backward Recursive Approach
✔ n=2: Two more stage to go
s X2 f2(s) X2*
8 9
5 6+8 8+9 14 8
=14 =17
6 9+8 7+9 16 9
=17 =16
7 5+8 7+9 13 8
=13 =16
Corresponding
Backward Recursive Approach
✔ n=3: Three more stage to go
s X3 f3(s) X3*
5 6 7
2 4+14 16+7 8+13 18 5
=18 =23 =21
3 8+14 10+16 5+13 18 7
=22 =26 =18
Corresponding
Backward Recursive Approach
✔ n=4: Four more stage to go
s X4 f4(s) X4*
Corresponding
Final solution
• 1-2-5-8-10
• 1-3-7-8-10
• Z=23.
Terminology
• Stage – Stage
• State- city at which the person presently is
• Decision variables- next destination
• Criterion of effectiveness- Minimize total distance