Stagecoach Problem using tabulation method | Dynamic Programming | Operations Research
Channel: Mechpro classes
Date: 2020-06-27

In this video session we have solved stagecoach problem using tabulation or u can say bottom-up approach in dynamic programming.

#stagecoachproblem#stagecoach#tabulationmethod#tabulation#dynamicprogramming

A dynamic programming algorithm solves a complex problem by dividing it into simpler subproblems, solving each of those just once, and storing their solutions.

Memoization is an optimization technique used to speed up programs by storing the results of expensive function calls and returning the cached result when the same inputs occur again.

Tabulation is an approach where you solve a dynamic programming problem by first filling up a table, and then compute the solution to the original problem based on the results in this table.
Going bottom-up is a common strategy for dynamic programming problems, which are problems where the solution is composed of solutions to the same problem with smaller inputs.

The STAGECOACH PROBLEM is a problem specially constructed to illustrate the features and to introduce the terminology of dynamic programming. It concerns a mythical fortune seeker in Missouri who decided to go west to join the gold rush in California during the mid-19th century. The journey would require traveling by stagecoach through unsettled country where there was serious danger of attack by marauders. Although his starting point and destination were fixed, he had considerable choice as to which states (or territories that subsequently became states) to travel through en route.