scholarly journals Improved models for operation modes of complex compressor stations

Author(s):  
Benjamin Hiller ◽  
René Saitenmacher ◽  
Tom Walther

AbstractWe study combinatorial structures in large-scale mixed-integer (nonlinear) programming problems arising in gas network optimization. We propose a preprocessing strategy exploiting the observation that a large part of the combinatorial complexity arises in certain subnetworks. Our approach analyzes these subnetworks and the combinatorial structure of the flows within these subnetworks in order to provide alternative models with a stronger combinatorial structure that can be exploited by off-the-shelve solvers. In particular, we consider the modeling of operation modes for complex compressor stations (i.e., ones with several in- or outlets) in gas networks. We propose a refined model that allows to precompute tighter bounds for each operation mode and a number of model variants based on the refined model exploiting these tighter bounds. We provide a procedure to obtain the refined model from the input data for the original model. This procedure is based on a nontrivial reduction of the graph representing the gas flow through the compressor station in an operation mode. We evaluate our model variants on reference benchmark data, showing that they reduce the average running time between 10% for easy instances and 46% for hard instances. Moreover, for three of four considered networks, the average number of search tree nodes is at least halved, showing the effectivity of our model variants to guide the solver’s search.

Author(s):  
Felix Hennings ◽  
Lovis Anderson ◽  
Kai Hoppmann-Baum ◽  
Mark Turner ◽  
Thorsten Koch

Abstract Compressor stations are the heart of every high-pressure gas transport network. Located at intersection areas of the network, they are contained in huge complex plants, where they are in combination with valves and regulators responsible for routing and pushing the gas through the network. Due to their complexity and lack of data compressor stations are usually dealt with in the scientific literature in a highly simplified and idealized manner. As part of an ongoing project with one of Germany’s largest transmission system operators to develop a decision support system for their dispatching center, we investigated how to automatize the control of compressor stations. Each station has to be in a particular configuration, leading in combination with the other nearby elements to a discrete set of up to 2000 possible feasible operation modes in the intersection area. Since the desired performance of the station changes over time, the configuration of the station has to adapt. Our goal is to minimize the necessary changes in the overall operation modes and related elements over time while fulfilling a preset performance envelope or demand scenario. This article describes the chosen model and the implemented mixed-integer programming based algorithms to tackle this challenge. By presenting extensive computational results on real-world data, we demonstrate the performance of our approach.


2013 ◽  
Vol 221 (3) ◽  
pp. 190-200 ◽  
Author(s):  
Jörg-Tobias Kuhn ◽  
Thomas Kiefer

Several techniques have been developed in recent years to generate optimal large-scale assessments (LSAs) of student achievement. These techniques often represent a blend of procedures from such diverse fields as experimental design, combinatorial optimization, particle physics, or neural networks. However, despite the theoretical advances in the field, there still exists a surprising scarcity of well-documented test designs in which all factors that have guided design decisions are explicitly and clearly communicated. This paper therefore has two goals. First, a brief summary of relevant key terms, as well as experimental designs and automated test assembly routines in LSA, is given. Second, conceptual and methodological steps in designing the assessment of the Austrian educational standards in mathematics are described in detail. The test design was generated using a two-step procedure, starting at the item block level and continuing at the item level. Initially, a partially balanced incomplete item block design was generated using simulated annealing, whereas in a second step, items were assigned to the item blocks using mixed-integer linear optimization in combination with a shadow-test approach.


PLoS ONE ◽  
2011 ◽  
Vol 6 (9) ◽  
pp. e24162 ◽  
Author(s):  
Joonhoon Kim ◽  
Jennifer L. Reed ◽  
Christos T. Maravelias

Author(s):  
Haijuan Yang ◽  
Xiwu Hu

Ecological civilization construction and rural revitalization is a strategic decision made by the central government to solve the problems of ecological protection and rural sustainable poverty alleviation. At present, the dominant agricultural operation modes in China can be roughly divided into three types: family farm mode, agricultural enterprise mode and cooperative mode. Practice has proved that different agricultural operation modes have different effects. In ecological fragile areas, how to adopt agricultural operation modes can not only promote agricultural prosperity and increase farmers' income, but also protect the ecological environment and promote the coordinated development of ecology and economy needs further analysis. Based on the current rural revitalization strategy and ecological protection background, this paper analyzes the operation mechanism of agricultural operation mode from the principal-agent and ecological land rent theory, and analyzes the development dimensions of advantageous agriculture of various modes. On the basis of rural and farmers, this paper provides references for the selection of agricultural operation mode in different regions. There are many factors that need to be considered in the choice of agricultural operation mode in ecological fragile area. In the future, each region should conduct analysis and treatment according to its own actual situation.


Agriculture ◽  
2021 ◽  
Vol 11 (2) ◽  
pp. 86
Author(s):  
Youzhu Li ◽  
Rui He ◽  
Jinsi Liu ◽  
Chongguang Li ◽  
Jason Xiong

To ease the fluctuation of hog prices and maintain the hog market’s stability, the central government of China has issued a series of hog price control policies. This paper, supplemented by co-word analysis and LDA thematic modeling, constructed 9 first-level indicators and 36 s-level indicators and used a PMC index model to conduct quantitative research on the selected 74 policies and regulations of China’s pig price regulation policies from July 2007 to April 2020. The research concludes that the research tool system of China’s hog price control is formed. The overall design of the hog price control policy is relatively reasonable, but there are still the following problems: the subject of China’s pig price control policy is singular, so it is difficult to form a resultant force; the policy pays attention to the price regulation in the short term, but ignores the long-term industrial structure adjustment; it emphasizes market supervision, but insufficient support for slaughtering and processing; it focuses on production and management to improve the development quality and efficiency of the pig industry, but does not take social equity into account. Finally, some policy suggestions are put forward: multi-department division of labor and close cooperation; adjusting the industrial structure of hog and carrying out appropriate large-scale breeding; establishing the operation mode of slaughtering and processing in the producing area to reduce the circulation cost of the pig industry; ensuring the consumption of pork by low-income groups and giving consideration to social efficiency and equity.


1974 ◽  
Vol 14 (01) ◽  
pp. 44-54 ◽  
Author(s):  
Gary W. Rosenwald ◽  
Don W. Green

Abstract This paper presents a mathematical modeling procedure for determining the optimum locations of procedure for determining the optimum locations of wells in an underground reservoir. It is assumed that there is a specified production-demand vs time relationship for the reservoir under study. Several possible sites for new wells are also designated. possible sites for new wells are also designated. The well optimization technique will then select, from among those wellsites available, the locations of a specified number of wells and determine the proper sequencing of flow rates from Those wells so proper sequencing of flow rates from Those wells so that the difference between the production-demand curve and the flow curve actually attained is minimized. The method uses a branch-and-bound mixed-integer program (BBMIP) in conjunction with a mathematical reservoir model. The calculation with the BBMIP is dependent upon the application of superposition to the results from the mathematical reservoir model.This technique is applied to two different types of reservoirs. In the first, it is used for locating wells in a hypothetical groundwater system, which is described by a linear mathematical model. The second application of the method is to a nonlinear problem, a gas storage reservoir. A single-phase problem, a gas storage reservoir. A single-phase gas reservoir mathematical model is used for this purpose. Because of the nonlinearity of gas flow, purpose. Because of the nonlinearity of gas flow, superposition is not strictly applicable and the technique is only approximate. Introduction For many years, members of the petroleum industry and those concerned with groundwater hydrology have been developing mathematical reservoir modeling techniques. Through multiple runs of a reservoir simulator, various production schemes or development possibilities may be evaluated and their relative merits may be considered; i.e., reservoir simulators can be used to "optimize" reservoir development and production. Formal optimization techniques offer potential savings in the time and costs of making reservoir calculations compared with the generally used trial-and-error approach and, under proper conditions, can assure that the calculations will lead to a true optimum.This work is an extension of the application of models to the optimization of reservoir development. Given a reservoir, a designated production demand for the reservoir, and a number of possible sites for wells, the problem is to determine which of those sites would be the best locations for a specified number of new wells so that the production-demand curve is met as closely as possible. Normally, fewer wells are to be drilled than there are sites available. Thus, the question is, given n possible locations, at which of those locations should n wells be drilled, where n is less than n? A second problem, that of determining the optimum relative problem, that of determining the optimum relative flow rates of present and future wells is also considered. The problem is attacked through the simultaneous use of a reservoir simulator and a mixed-integer programming technique.There have been several reported studies concerned with be use of mathematical models to select new wells in gas storage or producing fields. Generally, the approach has been to use a trial-and-error method in which different well locations are assumed. A mathematical model is applied to simulate reservoir behavior under the different postulated conditions, and then the alternatives are postulated conditions, and then the alternatives are compared. Methods that evaluate every potential site have also been considered.Henderson et al. used a trial-and-error procedure with a mathematical model to locate new wells in an existing gas storage reservoir. At the same time they searched for the operational stratagem that would yield the desired withdrawal rates. In the reservoir that they studied, they found that the best results were obtained by locating new wells in the low-deliverability parts of the reservoir, attempting to maximize the distance between wells, and turning the wells on in groups, with the low-delivery wells turned on first.Coats suggested a multiple trial method for determining well locations for a producing field. SPEJ P. 44


Author(s):  
Alexander Murray ◽  
Timm Faulwasser ◽  
Veit Hagenmeyer ◽  
Mario E. Villanueva ◽  
Boris Houska

AbstractThis paper presents a novel partially distributed outer approximation algorithm, named PaDOA, for solving a class of structured mixed integer convex programming problems to global optimality. The proposed scheme uses an iterative outer approximation method for coupled mixed integer optimization problems with separable convex objective functions, affine coupling constraints, and compact domain. PaDOA proceeds by alternating between solving large-scale structured mixed-integer linear programming problems and partially decoupled mixed-integer nonlinear programming subproblems that comprise much fewer integer variables. We establish conditions under which PaDOA converges to global minimizers after a finite number of iterations and verify these properties with an application to thermostatically controlled loads and to mixed-integer regression.


Sign in / Sign up

Export Citation Format

Share Document