engleski

A comparison of several algorithms for solving dynamic programming problems

The paper presents solving a shortest path problem using modeling language LINGO 8.0. In solving of the shortest path problem, dynamic programming and branch and bound approach algorithms are used. Recursive relations play an important role within the dynamic programming and according to the recursive relations is solved the problem of a shortest path. It has been shown that the dynamic programming and branch and bound approach differ in the organization of the counting process. In dynamic programming, the process is strictly parallel, while in branch and bound algorithm parallel and sequential organization of counting is implemented. Dynamic programming can be understood as the extreme form of organization in the branch and bound approach. The examples presented in the paper illustrate usage of program languages in designing of flexible optimization models. The hypothesis of paper is that modeling languages support user oriented programs for quantitative analysis where the one base model enables flexible support for different optimimization methods.

the shortest path problem; branch and bound approach; recursive relations; LINGO; Solver

nije evidentirano