{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T01:38:36Z","timestamp":1777945116103,"version":"3.51.4"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T00:00:00Z","timestamp":1777680000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T00:00:00Z","timestamp":1777680000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006470","name":"Aristotle University of Thessaloniki","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006470","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2026,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>This study addresses the challenge of efficiently distributing water from a central source to distinct demand points through an irrigation canal system. In this network design, the demand locations serve as network nodes, interconnected by arcs that represent the canals to be built. The building expense for each canal is influenced by various factors, including land structure and topography. The rate of water flow along a canal path from the main source to a specific demand location is restricted by the minimum capacity of the canal along that route. The primary objective is to identify a subset of canals that can maximize water delivery per unit of time to each demand location while minimizing construction costs and satisfying constraints due to canal capacities. The proposed graph-theoretic approach is validated using a semi-real irrigation case study with an irregular, free-form, topology.<\/jats:p>","DOI":"10.1007\/s12351-026-01054-z","type":"journal-article","created":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T09:26:16Z","timestamp":1777713976000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing irrigation network system design through canal capacity analysis"],"prefix":"10.1007","volume":"26","author":[{"given":"Dimitra","family":"Alexiou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitra","family":"Vagiona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Sifaleras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,2]]},"reference":[{"issue":"6","key":"1054_CR1","doi-asserted-by":"publisher","first-page":"06017002","DOI":"10.1061\/(ASCE)IR.1943-4774.0001170","volume":"143","author":"D Alexiou","year":"2017","unstructured":"Alexiou D, Tsouros C (2017) Design of an irrigation network system in terms of canal capacity using graph theory. J Irrig Drain Eng 143(6):06017002","journal-title":"J Irrig Drain Eng"},{"key":"1054_CR2","volume-title":"Graph theory, an algorithmic approach","author":"N Christofides","year":"1975","unstructured":"Christofides N (1975) Graph theory, an algorithmic approach. Academic Press, Cambridge"},{"key":"1054_CR3","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2022","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2022) Introduction to algorithms, 4th edn. MIT press, Cambridge","edition":"4"},{"issue":"1","key":"1054_CR4","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/s12205-020-0272-2","volume":"24","author":"PW Gajghate","year":"2020","unstructured":"Gajghate PW, Mirajkar A (2020) Irrigation pipe network planning at tertiary level: an Indian case study. KSCE J Civ Eng 24(1):322\u2013335","journal-title":"KSCE J Civ Eng"},{"issue":"1","key":"1054_CR5","first-page":"6657459","volume":"2021","author":"PW Gajghate","year":"2021","unstructured":"Gajghate PW, Mirajkar A, Shaikh U, Bokde ND, Yaseen ZM (2021) Optimization of layout and pipe sizes for irrigation pipe distribution network using Steiner point concept. Math Probl Eng 2021(1):6657459","journal-title":"Math Probl Eng"},{"key":"1054_CR6","volume-title":"Data structures and algorithms in python","author":"MT Goodrich","year":"2013","unstructured":"Goodrich MT, Tamassia R, Goldwasser MH (2013) Data structures and algorithms in python. Wiley, Hoboken"},{"key":"1054_CR7","doi-asserted-by":"publisher","DOI":"10.1142\/13327","volume-title":"Applied graph theory: an introduction with graph optimization and algebraic graph theory","author":"CH Griffin","year":"2023","unstructured":"Griffin CH (2023) Applied graph theory: an introduction with graph optimization and algebraic graph theory. World Scientific, Singapore"},{"key":"1054_CR8","first-page":"137","volume-title":"GIS for water-supply and irrigation systems Geographic information systems in water resources engineering","author":"LE Johnson","year":"2008","unstructured":"Johnson LE (2008) GIS for water-supply and irrigation systems Geographic information systems in water resources engineering. CRC Press, Boca Raton, pp 137\u2013162"},{"key":"1054_CR9","unstructured":"Kaibel V, Peinhardt MAF (2006) On the bottleneck shortest path problem (Tech. Rep. No. 06-22). Konrad-Zuse-Zentrum f\u00fcr Informationstechnik"},{"issue":"6","key":"1054_CR10","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.ipl.2008.11.011","volume":"109","author":"AP Punnen","year":"2009","unstructured":"Punnen AP, Ruonan Z (2009) Bottleneck flows in unit capacity networks. Inf Process Lett 109(6):334\u2013338","journal-title":"Inf Process Lett"},{"key":"1054_CR11","first-page":"4794","volume":"433\u2013440","author":"S Renjie","year":"2012","unstructured":"Renjie S, Qinggang J, Yanyan L, Jing Z (2012) Identify the bottleneck of water network by using graph theory. Adv Mater Res 433\u2013440:4794\u20134797","journal-title":"Adv Mater Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01054-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-026-01054-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01054-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T09:26:19Z","timestamp":1777713979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-026-01054-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,2]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["1054"],"URL":"https:\/\/doi.org\/10.1007\/s12351-026-01054-z","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,2]]},"assertion":[{"value":"14 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"60"}}