Research articles

Determining the optimal paths in networks with rated transition time costs

Dmitrii Lozovanu

Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, 5 Academiei str., Chişinău, MD-2028 Moldova

Abstract: We formulate and study the problem of determining the optimal paths in networks with rated transition time costs on edges. Polynomial time algorithms for determining the optimal solution of this problem are proposed and grounded. The proposed algorithms generalize algorithms for determining the optimal paths in the weighted directed graphs.

Keywords and phrases: networks, optimal paths, time transition cost, total rated cost, polynomial time algorithm.

MSC: 90B10, 90B20

Received: 02.04.2013

Language: English