izpis_h1_title_alt

Uporaba teorije grafov za zasnovo merilnih območij v vodovodnih omrežjih : magistrsko delo
ID Gorjup, Marijan (Author), ID Kramar Fijavž, Marjeta (Mentor) More about this mentor... This link opens in a new window, ID Kozelj, Daniel (Comentor)

.pdfPDF - Presentation file, Download (2,79 MB)
MD5: F8470D36DA8FFC9C14B852323679500A
PID: 20.500.12556/rul/a0f11812-9cc1-45c8-80dc-9a994edad350

Abstract
Vodovodni sistemi imajo velik delež neprodane vode. Z namenom zmanjšanja količine neprodane vode se v vodovodnem sistemu oblikuje merilna območja (DMA cone). V DMA conah se merita parametra tlak in pretok vode. Z znanima podatkoma o količini vtekle vode v DMA cono in količini prodane vode je po izračunu bilance vode enostavno določiti količino neprodane vode. Z zasnovo DMA con je upravljalcem omogočena hitrejša detekcija vodnih izgub in učinkovit nadzor nad delovanjem celotnega sistema. Kljub temu se pojavljajo negativni učinki kot je neustrezen nivo tlaka ali problem s starostjo vode. Želeli bi razbiti vodovodni sistem na DMA cone tako, da se pri tem hidravlične razmere ne poslabšajo. Veliko že razvitih metod je omejenih na majhne ali skeletizirane vodovodne sisteme. Zato je naš namen poiskati metodo za hitro in učinkovito particijo kompleksnih vodovodnih omrežij. Izmed več algoritmov je bil izbran algoritem za spektralno razbitje grafov. Nekateri hidravlični parametri so vključeni v metodo kot vhodni podatki algoritma za generiranje ustreznih rešitev. Generiranih je več rešitev, izmed katerih je izbrana optimalna. Vse rešitve so testirane z uporabo programa EPANET 2.0 in MATLAB 2015. Opisano metodo smo tudi testirali na realnem primeru.

Language:Slovenian
Keywords:gradbeništvo, magistrska dela, vodovodni sistem, DMA, algoritem, teorija grafov
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FGG - Faculty of Civil and Geodetic Engineering
Place of publishing:Ljubljana
Publisher:[M. Gorjup]
Year:2016
Number of pages:XI, 68 str.
PID:20.500.12556/RUL-86575 This link opens in a new window
UDC:519.17:628.1(043.3)
COBISS.SI-ID:7741537 This link opens in a new window
Publication date in RUL:14.11.2016
Views:4862
Downloads:785
Metadata:XML DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Title:Using graph theory for designing district metered areas in water supply network
Abstract:
Many water distribution systems (WDS) have high percentage of non revenue water (NRW). In order to decrease the volume of NRW, district metered areas (DMAs) are introduced, where hydraulic parameters such as pressure and flow are measured. Knowing the volume of inlet water into the DMA and the volume of revenue water at the demand nodes, it is easy to calculate the volume of NRW. Dividing WDS into different DMAs enables the water management utilities faster identification of water losses and effective control over the whole system. However, there are also some negative effects such as lower pressure and problems related to water quality. The objective is to divide WDS into DMAs in such way that the hydraulic conditions don’t get worse. Many of known methods are limited to small or skeletioned WDS. Therefore our aim is to find a fast and effective algorithm for partitioning complex networks. Among several algorithms the algorithm for spectral partitioning was selected. Some hydraulic parameters are included in the method as input data in order to generate hydraulically suitable solutions. Numerous solutions are obtained, among which the optimal is selected. All of them are tested with program EPANET 2.0 and MATLAB 2015 using the EPANET Programmer Toolkit. The proposed method was also tested on a real case study.

Keywords:civil engineering, master of science thesis, water supply system, DMA, algorithm, graph theory

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back