Using dynamic programming technique for solving a class of bi-criteria multistage transportation problem

This paper presents a solution algorithm to solve one class of bicriteria multistage transportation problem. This class represents bi-criteria multistage transportation problem without any restrictions on the intermediate stages. A way to find the non-dominated extreme points in the criteria space is developed. This method involves a parametric search in the criteria space. The presented algorithm is based also on fruitful application of the methods for treating transportation problems and the dynamic programming technique to obtain the shortest route for transportation networks and methods for solving bicriteria linear programming. The solution algorithm as well as an illustrative example are also included in this paper.