Deutsch
 
Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

Heuristic Methods for Minimum-Cost Pipeline Network Design – a Node Valency Transfer Metaheuristic

Urheber*innen
/persons/resource/yeates

Yeates,  Christopher
4.8 Geoenergy, 4.0 Geosystems, Departments, GFZ Publication Database, Deutsches GeoForschungsZentrum;

/persons/resource/conny

Schmidt-Hattenberger,  Cornelia
4.8 Geoenergy, 4.0 Geosystems, Departments, GFZ Publication Database, Deutsches GeoForschungsZentrum;

/persons/resource/wolfgang

Weinzierl,  Wolfgang
4.8 Geoenergy, 4.0 Geosystems, Departments, GFZ Publication Database, Deutsches GeoForschungsZentrum;

/persons/resource/dbruhn

Bruhn,  David
4.8 Geoenergy, 4.0 Geosystems, Departments, GFZ Publication Database, Deutsches GeoForschungsZentrum;

Externe Ressourcen
Es sind keine externen Ressourcen hinterlegt
Volltexte (frei zugänglich)

5007250.pdf
(Verlagsversion), 3MB

Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Yeates, C., Schmidt-Hattenberger, C., Weinzierl, W., Bruhn, D. (2021): Heuristic Methods for Minimum-Cost Pipeline Network Design – a Node Valency Transfer Metaheuristic. - Networks and Spatial Economics, 21, 839-871.
https://doi.org/10.1007/s11067-021-09550-9


Zitierlink: https://gfzpublic.gfz-potsdam.de/pubman/item/item_5007250
Zusammenfassung
Designing low-cost network layouts is an essential step in planning linked infrastructure. For the case of capacitated trees, such as oil or gas pipeline networks, the cost is usually a function of both pipeline diameter (i.e. ability to carry flow or transferred capacity) and pipeline length. Even for the case of incompressible, steady flow, minimizing cost becomes particularly difficult as network topology itself dictates local flow material balances, rendering the optimization space non-linear. The combinatorial nature of potential trees requires the use of graph optimization heuristics to achieve good solutions in reasonable time. In this work we perform a comparison of known literature network optimization heuristics and metaheuristics for finding minimum-cost capacitated trees without Steiner nodes, and propose novel algorithms, including a metaheuristic based on transferring edges of high valency nodes. Our metaheuristic achieves performance above similar algorithms studied, especially for larger graphs, usually producing a significantly higher proportion of optimal solutions, while remaining in line with time-complexity of algorithms found in the literature. Data points for graph node positions and capacities are first randomly generated, and secondly obtained from the German emissions trading CO2 source registry. As political will for applications and storage for hard-to-abate industry CO2 emissions is growing, efficient network design methods become relevant for new large-scale CO2 pipeline networks.