YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASCE
    • Journal of Hydraulic Engineering
    • View Item
    •   YE&T Library
    • ASCE
    • Journal of Hydraulic Engineering
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    Graph Theory Modeling Approach for Optimal Operation of Water Distribution Systems

    Source: Journal of Hydraulic Engineering:;2016:;Volume ( 142 ):;issue: 003
    Author:
    Eyal Price
    ,
    Avi Ostfeld
    DOI: 10.1061/(ASCE)HY.1943-7900.0001099
    Publisher: American Society of Civil Engineers
    Abstract: A graph theory-based algorithm is demonstrated for optimal pump scheduling of two example application water networks. The hydraulic part of the problem is solved using a dedicated and efficient hydraulic solver. The pump scheduling part of the problem is solved using a skeletonized operational graph, representing only the basic logic operational relations existing in the network required for pump selection: the pumping units (with nominal operating costs), water tanks and clustered demand nodes. The hydraulic solver advances one time step at a time. After each time step advance, the nodes of the model are checked to see if satisfy minimum service pressure and minimum water tank level. For nodes not satisfying the service constraints, the Dijkstra’s shortest path algorithm is applied to the skeletonized graph to determine the optimal pumping unit to be activated and then updating the pumps operation pattern in the model. The hydraulic solver is then reinitialized to resolve and recheck the time steps one by one. The algorithm ends when the solver reaches the last time step with all nodes meeting service constraints. The algorithm returns an optimal minimal cost pump-scheduling pattern under greater-than constraints over the examined time period, such as (1) minimal consumer service pressure, and (2) water balance closure at the water tanks. The algorithm returns discrete pump operation scheduling with minimal pump switching and minimal water age in the tanks, demonstrating short solution times (28 s to schedule 11 pumps over a 168-hour period). The algorithm may be applicable for real-time pump scheduling. Future research may include water quality constraints and variable frequency drive pump scheduling. Pump selection is based on the assumption that the optimal pump operation order is not affected by changes in the network’s hydraulic conditions, such as water tank levels and location along the pump efficiency curve (assuming constant efficiency). If hydraulic conditions change the optimal activation order, then the pumps’ working points must by updated after each time step solution, which is not addressed in the current work.
    • Download: (1.884Mb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Price: 5000 Rial
    • Statistics

      Graph Theory Modeling Approach for Optimal Operation of Water Distribution Systems

    URI
    http://yetl.yabesh.ir/yetl1/handle/yetl/82099
    Collections
    • Journal of Hydraulic Engineering

    Show full item record

    contributor authorEyal Price
    contributor authorAvi Ostfeld
    date accessioned2017-05-08T22:31:50Z
    date available2017-05-08T22:31:50Z
    date copyrightMarch 2016
    date issued2016
    identifier other48564541.pdf
    identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/82099
    description abstractA graph theory-based algorithm is demonstrated for optimal pump scheduling of two example application water networks. The hydraulic part of the problem is solved using a dedicated and efficient hydraulic solver. The pump scheduling part of the problem is solved using a skeletonized operational graph, representing only the basic logic operational relations existing in the network required for pump selection: the pumping units (with nominal operating costs), water tanks and clustered demand nodes. The hydraulic solver advances one time step at a time. After each time step advance, the nodes of the model are checked to see if satisfy minimum service pressure and minimum water tank level. For nodes not satisfying the service constraints, the Dijkstra’s shortest path algorithm is applied to the skeletonized graph to determine the optimal pumping unit to be activated and then updating the pumps operation pattern in the model. The hydraulic solver is then reinitialized to resolve and recheck the time steps one by one. The algorithm ends when the solver reaches the last time step with all nodes meeting service constraints. The algorithm returns an optimal minimal cost pump-scheduling pattern under greater-than constraints over the examined time period, such as (1) minimal consumer service pressure, and (2) water balance closure at the water tanks. The algorithm returns discrete pump operation scheduling with minimal pump switching and minimal water age in the tanks, demonstrating short solution times (28 s to schedule 11 pumps over a 168-hour period). The algorithm may be applicable for real-time pump scheduling. Future research may include water quality constraints and variable frequency drive pump scheduling. Pump selection is based on the assumption that the optimal pump operation order is not affected by changes in the network’s hydraulic conditions, such as water tank levels and location along the pump efficiency curve (assuming constant efficiency). If hydraulic conditions change the optimal activation order, then the pumps’ working points must by updated after each time step solution, which is not addressed in the current work.
    publisherAmerican Society of Civil Engineers
    titleGraph Theory Modeling Approach for Optimal Operation of Water Distribution Systems
    typeJournal Paper
    journal volume142
    journal issue3
    journal titleJournal of Hydraulic Engineering
    identifier doi10.1061/(ASCE)HY.1943-7900.0001099
    treeJournal of Hydraulic Engineering:;2016:;Volume ( 142 ):;issue: 003
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian