3 research outputs found

    Development of a Flow-Measuring Hydropneumatic Bench for Testing Pipeline Valves

    Get PDF
    Pipe fittings are an important element of any pipeline network, ensuring stable and safe operation by regulating the flow of the working medium. To control the performance of pipeline valves, it is necessary to conduct various tests, the main ones of which are hydraulic and pneumatic. It is important to expand testing capabilities and reduce time costs. The purpose of this work is to combine hydraulic and pneumatic tests into one test complex, which will reduce the time of the test complex due to the absence of the need for reinstallation and reconfiguration. The subject of the study is the determination of the design, technical, and operational characteristics of such a stand, as well as the simulation of operating conditions to confirm its operability. During the development, methods of solid and surface modeling, the finite element method, and analytical calculation methods were used. The results of the stand design are presented, and the features of the process of its development are described, including the analysis of the stress-strain state and the analysis of reliability and durability indicators. The obtained values of the distribution of equivalent stresses, deformations, and displacements of the structure elements do not exceed the maximum allowable values and do not lead to destruction. The analysis shows that the developed stand has improved capabilities compared to those previously used. Doi: 10.28991/CEJ-2023-09-01-013 Full Text: PD

    Bookings in the European Gas Market: Characterisation of Feasibility and Computational Complexity Results

    Get PDF
    International audienceAs a consequence of the liberalisation of the European gas market in the last decades, gas trading and transport have been decoupled. At the core of this decoupling are so-called bookings and nominations. Bookings are special long-term capacity right contracts that guarantee that a specified amount of gas can be supplied or withdrawn at certain entry or exit nodes of the network. These supplies and withdrawals are nominated at the day-ahead. The special property of bookings then is that they need to be feasible, i.e., every nomination that complies with the given bookings can be transported. While checking the feasibility of a nomination can typically be done by solving a mixed-integer nonlinear feasibility problem, the verification of feasibility of a set of bookings is much harder. The reason is the robust nature of feasibility of bookings-namely that for a set of bookings to be feasible, all compliant nominations, i.e., infinitely many, need to be checked for feasibility. In this paper, we consider the question of how to verify the feasibility of given bookings for a number of special cases. For our physics model we impose a steady-state potential-based flow model and disregard controllable network elements. For this case we derive a characterisation of feasible bookings, which is then used to show that the problem is in coNP for the general case but can be solved in polynomial time for linear potential-based flow models. Moreover, we present a dynamic programming approach for deciding the feasibility of a booking in tree-shaped networks even for nonlinear flow models. It turns out that the hardness of the problem mainly depends on the combination of the chosen physics model as well as the specific network structure under consideration. Thus, we give an overview over all settings for which the hardness of the problem is known and finally present a list of open problems
    corecore