Comparing severe gas transport situations through the network: Similarity or reduction methods

A number of severe entry-exit combinations is selected, to investigate whether or not all possible future gas transport situations through the gas transport network of Gasunie Transport Services can be met. These severe entry-exit combinations are selected, such that if the transport capacity is manageable regarding the pipeline network for these entry-exit combinations, then it is possible to satisfy all possible entry-exit combinations. In short, these severe entry-exit combinations represent the most severe transport situations through the gas network within contractual limits, describing realistic market behavior, and determining the size and shape of the gas transport network. These are often called shipping variants or stress tests. These stress tests are denoted by vectors which components represent the gas capacities at entry and exit points. If a large set of stress tests is generated, then it takes a relatively large amount of time to evaluatethesestresstests. The aim of this project is, therefore, to reduce this generated set as much as possible. When reducing this set, we have to make sure that we derive a minimal set, which is still a complete set. So, our goal is to delete identical stress tests from the generated set, but also less severe transport situations. This report focuses on the quadratic form distance, which can measure similarities between vectors for which the individual components are correlated. In addition, some generated sets of stress tests are reduced according to reducing criteria.

Subject

gas transport
quadratic form distance
similarity search
positive semidefinite

To reference this document use:

http://resolver.tudelft.nl/uuid:f110568e-def4-4664-9839-9b30ce5c42b1

Part of collection

Student theses

Document type

master thesis

Rights

Files

PDF

mscThesis_KLindenberg_.pdf

3.4 MB

Close viewer