The application of multi objective dynamic programming model to transportation problems

In case of required to make decision with multiple conflicting objectives for business, multi objective decision-making which considered a mathematical model is one of the techniques of quantitative decision making. For using of this technique has encountered multiple objectives or more than one options to solve the objecti in the process. Target is that providing to reach on intended level by considering various interactions with the combination of objective which can take the value and thus offering the "best" option to decision-maker in model. The multi-objective shortest path problem which kind of traditional shortest path problems usulally provide to find the set of efficient paths for conflicting two or more than two objectives. Dynamic Programming which is one of the algorithms used to solve multi –objective shortest path problems, instead of searching for solutions to the main problems in a single step, search the solutions by separating into smaller sub-problems and finding solutions for each of these sub-problems. In this work, proposel improved with multiobjective dynamic programming model for finding the optimal path by decision maker because of more than two objectives in the transportation problem. Keywords: decision making, multi-objective decision making, shortest path problem