Dynamic Programming in Stage Coach Problem and Cargo Loading Problem

Abstract

The main aim of the paper is to use application of dynamic programming in stage-coach problem and cargo loading problem. Dynamic programming is a useful mathematical technique for making a sequence of interrelated decisions. It provides a systematic procedure for determining the optimal combination of decisions. Stage-coach problem in which the objective is to find the shortest distance and the corresponding path from a given source node to a given destination node in a given distance network. Cargo loading problem is an optimization problem in which a logistic company is left with the opinion of loading a desirable combination of items in a cargo subject to its weight or volume or both constraints.