A new model for gas flow in pipe networks

We introduce a new model for gas dynamics in pipe networks by asymptotic analysis. The model is derived from the isothermal Euler equations. We present the derivation of the model as well as numerical results illustrating the validity and its properties. We compare the new model with existing models from the mathematical and engineering literature. We further give numerical results on a sample network. Copyright © 2009 John Wiley & Sons, Ltd.     

Multiscale modeling for gas flow in pipe networks

We consider a multiscale network of natural gas pipelines. Different arcs of the network are to be modeled by possibly different models depending on the requisite qualitative detail required: an isothermal Euler system of equations; linearized model derived from the isothermal Euler system or a steady-state model of gas flow also referred to as an algebraic model. At the vertices (or joints) of the network coupling conditions are defined. An analysis of the well posedness of the hierarchial coupling conditions is presented. The analytical results are tested numerically on different network configurations including a real-world network based on the Canadian mainline gas network. Copyright © 2007 John Wiley & Sons, Ltd.     

Endogenous production capacity investment in natural gas market equilibrium models

The large-scale natural gas equilibrium model applied in Egging, 2013 combines long-term market equilibria and investments in infrastructure while accounting for market power by certain suppliers. Such models are widely used to simulate market outcomes given different scenarios of demand and supply development, environmental regulations and investment options in natural gas and other resource markets.     

A cross entropy approach to design of reliable networks

One of the most important parameters determining the performance of communication networks is network reliability. The network reliability strongly depends on not only topological layout of the communication networks but also reliability and availability of the communication facilities. The selection of optimal network topology is an NP-hard problem so that computation time of enumeration-based methods grows exponentially with network size. This paper presents a new solution approach based on cross-entropy method, called NCE, to design of communication networks. The design problem is to find a network topology with minimum cost such that all-terminal reliability is not less than a given level of reliability. To investigate the effectiveness of the proposed NCE, comparisons with other heuristic approaches given in the literature for the design problem are carried out in a three-stage experimental study. Computational results show that NCE is an effective heuristic approach to design of reliable networks.     

A cutting plane procedure for the travelling salesman problem on road networks

A cutting plane algorithm for the exact solution of the symmetric travelling salesman problem (TSP) is proposed. The real tours on a usually incomplete road network, which are in general non-Hamiltonian, are characterized directly by an integer linear programming model. The algorithm generates special cutting planes for this model. Computational results for real road networks with up to 292 visiting places are reported, as well as for classical problems of the literature with up to 120 cities. Some of the latter problems have been solved for the first time with a pure cutting plane approach.     

Symmetrization of the nonlinear system of gas dynamics equations

We describe a method for representing the nonlinear system of gas dynamics equations in quasilinear form with symmetric coefficient matrices and, moreover, with a positive definite matrix at the time derivative.     

A mathematical modeling for incorporating energy price hikes into total natural gas consumption forecasting

In some countries that energy prices are low, price elasticity of demand may not be significant. In this case, large increase or hike in energy prices may impact energy consumption in a way which cannot be drawn from historical data. This paper proposes an integrated adaptive fuzzy inference system (FIS) to forecast long-term natural gas (NG) consumption when prices experience large increase. To incorporate the impact of price hike into modeling, a novel procedure for construction and adaptation of Takagi–Sugeno fuzzy inference system (TS-FIS) is suggested. Linear regressions are used to construct a first order TS-FIS. Furthermore, adaptive network-based FIS (ANFIS) is used to forecast NG consumption in power plants. To cope with random uncertainty in small historical data sets, Monte Carlo simulation is utilized to generate training data for ANFIS. To show the applicability and usefulness of the proposed model, it is applied for forecasting of annual NG consumption in Iran where removing energy subsidies has resulted in a hike in NG prices.     

A simulated annealing algorithm for transient optimization in gas networks

In this paper we present a simulated annealing approach for the gas network optimization problem. A gas network consists of a set of pipes to transport the gas from the sources to the sinks whereby gas pressure gets lost due to friction. Further on there are compressors, which increase gas pressure, and valves. The aim is to minimize fuel gas consumption of the compressors whereas demands of consumers have to be satisfied. The problem of transient (time-dependent) optimization of gas networks results in a highly complex mixed integer nonlinear program. We relax the equations describing the gas dynamic in pipes by adding these constraints combined with appropriate penalty factors to the objective function. A suitable neighborhood structure is developed for the relaxed problem where time steps as well as pressure and flow of the gas are decoupled. Our approach convinces with flexibility and very good computational results.     

On the analysis of optimization problems in arc-dependent networks

This paper is concerned with the design and analysis of algorithms for optimization problems in arc-dependent networks. A network is said to be arc-dependent if the cost of an arc $a$ depends upon the arc taken to enter $a$. These networks are fundamentally different from traditional networks in which the cost associated with an arc is a fixed constant and part of the input. We first study the arc-dependent shortest path (ADSP) problem, which is also known as the suffix-1 path-dependent shortest path problem in the literature. This problem has a polynomial time solution if the shortest paths are not required to be simple. The ADSP problem finds applications in a number of domains, including highway engineering, turn penalties and prohibitions, and fare rebates. In this paper, we are interested in the ADSP problem when restricted to simple paths. We call this restricted version the simple arc-dependent shortest path (SADSP) problem. We show that the SADSP problem is NP-complete. We present inapproximability results and an exact exponential algorithm for this problem. We also extend our results for the longest path problem in arc-dependent networks. Additionally, we explore the problem of detecting negative cycles in arc-dependent networks and discuss its computational complexity. Our results include variants of the negative cycle detection problem such as longest, shortest, heaviest, and lightest negative simple cycles.²     

Optimization of component reliability in the design phase of capital goods

We introduce a quantitative model to support the decision on the reliability level of a critical component during its design. We consider an OEM who is responsible for the availability of its systems in the field through service contracts. Upon a failure of a critical part in a system during the exploitation phase, the failed part is replaced by a ready-for-use part from a spare parts inventory. In an out-of-stock situation, a costly emergency procedure is applied. The reliability levels and spare parts inventory levels of the critical components are the two main factors that determine the downtime and corresponding costs of the systems. These two levels are decision variables in our model. We formulate the portions of Life Cycle Costs (LCC) which are affected by a component’s reliability and its spare parts inventory level. These costs consist of design costs, production costs, and maintenance and downtime costs in the exploitation phase. We conduct exact analysis and provide an efficient optimization algorithm. We provide managerial insights through a numerical experiment which is based on real-life data.     

A distributed approach to capacity allocation in logical networks

We consider a dynamic capacity reallocation scheme in a logically fully-connected telecommunications network. We show that the problem of optimal capacity allocation can be solved in a distributed manner, an essential feature of such a scheme. Our continuous-capacity reallocation scheme can be used as a foundation for a discrete system. This is useful from the perspective of practical implementation.     

The limits of Riemann solutions for the isentropic Euler system with extended Chaplygin gas

The Riemann problem for the isentropic Euler system with the state equation for the extended Chaplygin gas is considered, and the Riemann solutions are constructed completely for all the cases. The limiting relations of Riemann solutions for the isentropic Euler system with the state equation from the extended Chaplygin gas to the Chaplygin gas are derived in detail when the corrected term tends to zero. The formation of delta shock wave solution and two-contact-discontinuity solution is investigated during the process of taking the limit.     

Vanishing pressure limits of Riemann solutions to the isentropic relativistic Euler system for Chaplygin gas

The Riemann solutions to the isentropic relativistic Euler system for Chaplygin gas with a small parameter are considered. Unlike the polytropic or barotropic gas cases, we find that firstly, as the parameter decreases to a certain critical number, the two-shock solution converges to a delta shock wave solution of the same system. Moreover, as the parameter goes to zero, that is, the pressure vanishes, the solution is nothing but the delta shock wave solution to the zero-pressure relativistic Euler system. Meanwhile, the two-rarefaction wave solution tends to the vacuum solution to the zero-pressure relativistic system, and the solution containing one rarefaction wave and one shock wave tends to the contact discontinuity solution to the zero-pressure relativistic system as pressure vanishes.     

A fluid system with coupled input and output,and its application to bottlenecks in ad hoc networks

This paper studies a fluid queue with coupled input and output. Flows arrive according to a Poisson process, and when n flows are present, each of them transmits traffic into the queue at a rate c/(n+1), where the remaining c/(n+1) is used to serve the queue. We assume exponentially distributed flow sizes, so that the queue under consideration can be regarded as a system with Markov fluid input. The rationale behind studying this queue lies in ad hoc networks: bottleneck links have roughly this type of sharing policy. We consider four performance metrics: (i) the stationary workload of the queue, (ii) the queueing delay, i.e., the delay of a ‘packet’ (a fluid particle) that arrives at the queue at an arbitrary point in time, (iii) the flow transfer delay, i.e., the time elapsed between arrival of a flow and the epoch that all its traffic has been put into the queue, and (iv) the sojourn time, i.e., the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. For each of these random variables we compute the Laplace transform. The corresponding tail probabilities decay exponentially, as is shown by a large-deviations analysis. F. Roijers’ work has been carried out partly in the SENTER-NOVEM funded project Easy Wireless.     

A complete solution to the existence problem for 1‐rotational k‐cycle systems of Kv

The necessary and sufficient conditions for the existence of a 1‐rotational k‐cycle system of the complete graph K_v are established. The proof provides an algorithm able to determine, directly and explicitly, an odd k‐cycle system of K_v whenever such a system exists. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 283–293, 2009     

Uniqueness of limit cycles in predator-prey system: the role of weight functions

We consider a Gause type model of interactions between predator and prey populations. Using the ideas of Cheng and Liou we give a sufficient condition for uniqueness of the limit cycle, which is more general than their condition. That is, we include a kind of weight function in the condition. It was motivated by a result due to Hwang, where the prey isocline plays a role of weight function. Moreover, we show that the interval where the condition from Hwang's result is to be fulfilled can be narrowed.     

A few practical problems on the application of OD-estimation in motorway networks

In the recent years OD-estimation has become an accepted tool for traffic analysis and control. There are many different OD-estimation models available each of them requiring a strict traffic and network database. In real road network one has to solve many practical problems such as location of detectors, missing of incorrect traffic data, variable route choice, the variability of the OD-matrix and the computing time in large networks. In this paper some results of analysing three different OD-estimators and testing them in a motorway network are presented. Furthermore some problems which arise when carrying out estimations are discussed.     

Semiparametric modeling of the spatiotemporal trends in natural gas consumption: Methodology,results, and consequences

Household consumption of natural gas is usually considered to be quite stable as cooking, space, and water heating belong to basic needs. The improvement of technologies together with possibilities of switching to alternative sources can, however, lead to a decreasing consumption trend. Knowing more about such trend, especially of its spatial distribution, can be useful for strategic planning. In this paper, we describe a general statistical methodology allowing to study the spatiotemporal behavior of consumption. It is based on semiparametric modeling. Formalized error and sensitivity analyses are part of the methodology. Presented methods are illustrated on large‐scale data from the Czech Republic.     

A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks

Recently Estrada and Hatano proposed an algorithm for the detection of community structure in complex networks using the concept of network communicability. Here we amend this algorithm by eliminating the subjectivity of choosing degree of overlapping and including an additional check of the fitness of detected communities. We show that this amendment can detect some communities which remain undetected by Estrada and Hatano’s algorithm. For instance, let G(p, q) be a graph obtained from two cliques, K_p and K_q(p ? q ? 3), joined by a single edge. It is apparent that this graph contains two communities, namely the two cliques. However, Estrada and Hatano’s algorithm detects only K_q as a community when p is sufficiently larger than q. Our algorithm correctly detects both communities. Also, our method also finds the correct community structure in one of the classic benchmark networks, the Zachary karate club.     

三次系统E_3~1存在二角形双曲线分界线环的充要条件

得到了三次系统 E1 3存在二角形双曲线分界线环的充要条件 .并给出了它们的拓扑分类和各种拓扑结构的参数条件 .