BULETINUL INSTITUTULUI POLITEHNIC DIN IAŞI - Universitatea ...

BULETINUL INSTITUTULUI POLITEHNIC DIN IAŞI
Publicat de
Universitatea Tehnică „Gheorghe Asachi” din Iaşi
Tomul LVI (LX), Fasc. 2, 2010
Secţia
CONSTRUCŢII DE MAŞINI
OPTIMAL ROUTES OF PIPELINE SUPPLY USING
THE BELLMAN-KALABA ALGORITHM
BY
TEODOR MILOŞ, MIRCEA BĂRGLĂZAN, EUGEN DOBÂNDĂ,
ADRIANA MANEA, RODICA BĂDĂRĂU and DANIEL STROIŢĂ
Abstract. In this paper are presented the application of graphs theory for
determining the optimal route of a pipeline supply being at the great distance of
the target consumer (pipeline network of a city). It applies when the distance from
source to target, because the configuration of the land, there are several variants of
the route passing through some mandatory points. In this way the route has n
sections and on each section the total cost (investment plus operating for one year)
has a certain value. If it can browse the route by more than two then the method
becomes profitable. Implementation of the method is through a special program,
using the Borland Pascal programming and Bellman-Kalaba algorithm.
Mathematical resolving is by the matrix. Numbering the sections with 1 ... n, in
order to obtain the final optimal browsing, it is the range of selected sections. In
actual conditions when more and more sources of drinking water are becoming
more polluted, the feeding is justified to be from remote mountain areas of the
natural springs.
Key words: graph theory, pipeline, optimal route, matrix, Bellman-Kalaba
algorithm, and network.
1. Introduction
Through scope of investment and energy consumption, adductions have a
significant share in the systems of water supply, and their rational design
behaves more optimization processes, among which an important place held
optimize their route.
In current practice of design, setting the optimal solution is, usually, by
analytical study of two or three variants selected from many possible intuitive