Research Article

Optimization of city gas network: a case study from Gujarat, India

Anirbid Sircar1 · Kriti Yadav1

© Springer Nature Switzerland AG 2019

Abstract
A natural gas flow network consists of city gate station, district regulator, pipelines, compressors and valves. The perfor-
mance of such a complex system cannot be studied by analysing individual constituents. Simultaneous performance
of integrated system can be expressed using non-linear equations to simulate and forecast operational behaviour. The
operational behaviour is subject to various alternative operational conditions also. Nodal analysis is performed to cal-
culate the flow capacity of each network segment and the pressure at each node. Two conditions are evaluated, namely,
keeping flow capacity unknown or by making nodal pressure primary unknown. The resulting set of governing equations
are then solved simultaneously. Genetic algorithm method is applied to solve the desired target unknown. Compressor
governs the energy supply required to transport gas from one end to another. The compressor equation is also incor-
porated in city gas network simulation. The simulations are performed by straight gas ducts and complex gas ducts.
Boundary conditions are dependent on the form in which gas duct is fed. It is assumed that the gas duct takes gas from
City Gate Station at x = 0 and supplies the gas to a consumer located at x = L according to a time variable curve demand
­Qn (L, t). The capacity of the compressor is also changed and it is observed that the demand is usually periodic in nature.
Flow demand at individual node of a gas pipeline network is calculated. Pressures at various nodes are also calculated
and matched with original pressure at nodes. Percentage deviation error suggest a range between 0 and 1.02%. The aim
of this paper is to optimise certain parameters of a gas transmission pipeline network namely flow rate, mass, cost and
pressure. This optimization is performed to gas transmission pipeline network of Gandhinagar, district, where Gujarat
State Petronet Limited (GSPL) and Sabarmati Gas Limited (SGL) are the major players. The network which has been chosen
for pipeline network consists of 10 CNG stations and 10 DRS.

Keywords City gas distribution · Genetic algorithm · Population · Mutation · Crossover

1 Introduction to end users by using different types of pipeline networks

According to Boston Consulting Group (BCG) in 2017
global gas consumption is estimated to have growth of
3.7% which is double the average annual growth rate from
2010 to 2016. In 2017 Asia and Europe were the leading
growth and development in gas sector. The gas consump-
tion in Asia was estimated to have grown by more than
35 bcm (5.3%) in 2017 which has been accounted for the
primary energy production. As we know that pipeline net-
works are the most important way to transport natural gas
like gathering network, trunk network and distribution
network. As the demand and consumption of natural
gas increases the evolved pipelines have more complex
systems. Flow of gas in pipeline gets affected by friction
with the walls of the pipes. The pressure drop here makes
more difficult to guarantee the supply security, so that the
inlet and outlet pressure of gas remains same. In this case
the compressor stations can be used to counterbalance
the pressure drop, but it has been found that they con-
sume around 3–5% proportion of gas which flows through

* Kriti Yadav, kriti.yphd15@spt.pdpu.ac.in | 1Centre of Excellence for Geothermal Energy, Pandit Deendayal Petroleum University,
Gandhinagar 382007, India.

SN Applied Sciences (2019) 1:769 | https://doi.org/10.1007/s42452-019-0755-2

Received: 22 March 2019 / Accepted: 11 June 2019 / Published online: 22 June 2019

Vol.:(0123456789)
Research Article SN Applied Sciences (2019) 1:769 | https://doi.org/10.1007/s42452-019-0755-2
the pipeline [26, 31].For such issues and challenges an
appropriate network is required to satisfy the demand for
natural gas while maximizing the operation benefits of
the networks. The evaluation of new operation schemes
includes a comprehensive and mathematical model which
simulates pressure and the mass flow rate of the pipeline
network under different operation conditions [16]. It has
been found that the estimated global optimization of
operations can be enhanced atleast by 15% of the network
operation benefit [32].
The objective of this paper is to optimize the flow of
gas in transmission pipeline network system by using
genetic algorithm method. The parameters which are
taken in consideration for optimization of system flow
rate, pressure, gas consumption, looping condition and
cost of the network. Genetic algorithm involves 5 major
steps, population, encoding, fitness function, crossover
and mutation. Gujarat State Petronet Limited (GSPL) and
Sabarmati Gas Limited (SGL) were looking for the optimi-
sation of gas transmission pipeline network so that the
cost of the network can be optimised at each node. In
this reference present researchers applied genetic algo-
rithm method to a gas pipeline network in Gandhinagar
we tried to optimise the cost at each node and the results
are encouraging. Optimising the parameters like flow rate,
pressure, mass consumption and loop condition leads to
the optimization of pipeline network cost.
2 Literature survey
A problem of gas network through compressor stations,
including the operation scheme optimization was intro-
duced by O’Neill et al. [20]. De Wolf and Smeers [9] modi-
fied the problem of O’Neill et al. [20] by using Piecewise
Linear Programing (PLP) approach. De Wolf and Smeers
[9] further represented this solution as “Special ordered
sets of type 2” by which the piecewise linear problem can
be globally solved by using mixed integer programming
code. In 2002 a reduction technique for minimizing fuel
consumption by compressors in steady state gas trans-
mission network was proposed by Rios-Mercado et al.
[24]. The base of this technique was novel combination of
graph theory and nonlinear functional analysis. This tech-
nique can optimize the problem size by without disrupting
its mathematical structure.
Differential evolution technique is applied by Babu
et al. [3] to optimize the design of gas transmission
pipeline network. The method was generally used for
complex and highly complicated non-linear problems.
This differential evolution technique was able to find
optimised solution which satisfies all the constraints
and takes less computational time. To cope up with the
Vol:.(1234567890)
forecasted demand for natural gas. Pietrasz et al. [22]
studied the problem of reinforcing regional gas trans-
mission pipeline network. The objective of this study
was to optimise the reinforcement costs. Depending
on topological decomposition techniques, evolution-
ary algorithms or search space reduction method is
categorised in three sections. It was based on truncated
branch and bound leaded to a solution which was locally
optimised in the neighbourhood of relaxed solution by
giving the continuous relaxation. A technique for opti-
mizing the investment costs on existing gas transmis-
sion pipeline network was proposed by Andre et al. [2].
The network was optimised by two findings first that the
location of pipeline segments to be reinforced and sec-
ond by optimizing sizes for the satisfaction of demands
with high pressure for all users. An ant colony optimiza-
tion technique was proposed by Chebouba et al. [7] for
steady state flow gas pipeline operations. The results of
this technique were compared with those which were
obtained by employing dynamic programing method
which shows that ant colony optimization is an effective
way of gas transmission network optimization. In recent
times the natural gas pipeline network optimization
research have been categorised into two categories. The
first category includes methods like regression method
including stochastic [33], linear programming [1], inter-
val analysis approach [4], a sequential quadratic method
[10], a non- sequential quadratic method [6], a bi-level
programing method [34] and economic nonlinear model
[11] and the other category is intelligent method [18].
3 Study area
Gujarat is India’s first completely covered piped gas state in
India. The pipeline networks are being operated by more
than one player namely, Gujarat State Petronet Limited
(GSPL), GAIL India Limited, Sabarmati Gas Limited (SGL),
Adani Gas Limited, Gujarat Gas company limited etc. The
major gas distribution source in this state is either from
Gandhar field of ONGC or from Oil and Natural Gas Cor-
poration (ONGC’s) General Petroleum Company (GPC)
at Hazira. In this paper Gandhinagar, Gujarat, India has
been selected as study area for optimisation of pipeline
network.
Gandhinagar is a capital of Gujarat which has an aerial
extent of 649 km2. GSPL and SGL are the major entities
working in this region. The pipeline network chosen here
for optimisation consists of 10 CNG stations and 10 DRS
(Fig. 1). This network have 12 nodes between 7 compres-
sors and 2 gas sources as shown in Fig. 2.
SN Applied Sciences (2019) 1:769 | https://doi.org/10.1007/s42452-019-0755-2 Research Article

Fig. 1  Study area for optimization of CGD network from Gujarat, India

Gas Transmission Network Problem 4 Need of optimisation

Optimisation helps to achieve best relative to a set of

Network Configurations
prioritized criteria or constraints. These includes max-
imising factors such as productivity, strength, reliabil-
ity, longevity, efficiency and utilisation. By increasing
Mass Flow Compressor Looping the efficiency of the existing network by lowering the
Pressure
balance equations equations conditions operational cost one can achieve higher profit from it.
equations
Optimisation leads to improvement of four attributes
discussed below:
Operation Optimization with Genetic Algorithm

• Profitability increase Even a small improvements in gas

Fig. 2  General procedure for mathematical formulation of trans- supply chain can gas market profitability and can be
mission pipeline network simulation. Modified after Woldeyo- viable in long term business.
hannes and Majid [29] • Reliability improvement A network optimizer can facilitate
to rapidly reallocate production upon equipment failure

Vol.:(0123456789)
Research Article SN Applied Sciences (2019) 1:769 | https://doi.org/10.1007/s42452-019-0755-2
to satisfy customers and honor contractual delivery com-
mitments.
• Investment planning The insights into network bottle-
necks and to enable planning for debottlenecking or
expansion projects are gained by comprehensive net-
work models.
• Flare reduction Minimize environmental and economic
penalties from inefficient operations.
5 Mathematical formulation for simulation
of gas transmission pipeline network
(GTPN)
The gas optimization network is categorised into 2 cat-
egories namely optimization of gas distribution network
and optimization of gas transmission pipeline. This study
is based on the gas transmission network including com-
pressor stations and other gas pipeline constraints. Opti-
mization of gas network is defined as means of objective
function searching for optimal design parameters, struc-
tures and developments for operation of networks [21].
Optimization of gas transmission network can be done
either in steady state or in transient state [27].
It has been found that when gas moves by GTPN, it
passes through pipelines, valves, regulators and compres-
sors. Friction of gas with the wall of pipes and heat transfer
between gas and the surrounding leads to gas pressure
drop in the pipeline. In order to boost the gas pressure
compressor stations are usually installed. Around 3–5% of
the gas is consumed by compressors while compensat-
ing the lost pressure of the gas [5, 31]. According to Wu
[30] even 1% of improvement on the performance of gas
transmission pipeline network of US can result in a saving
of 48.6 million dollars. The major constraints of designing
and operating of any gas transmission pipeline is mini-
mizing the energy consumption and increasing the gas
flow rate through pipes. After observing the above men-
tioned facts in this paper a mathematical model is used
for the simulation of gas transmission pipeline network.
This simulation optimizes parameters namely flow rate,
pressure, gas consumption, looping condition and cost
of the network. Figure 2 depicts the general outflow for
mathematical model based on configurations and basic
elements of gas transmission pipeline network. Woldeyo-
hannes and Majid [29] simulation method was adopted
in the present study which involves all the basic elements
of any gas transmission pipeline network. This method is
modified in the present study by adding the compressors
equation in governing simulation algorithm. By adding the
compressor equation we have optimised the cost at every
node and also the cost of whole network, shown in Table 5.
Vol:.(1234567890)
5.1 Formulation of different Constraints
5.1.1 Outflow and inflow rate
Flow rate depends on the area of the channel that the gas
is flowing from and the velocity of gas. The equation for
flow rate can be expressed as:
Q = Av (1)
where Q = gas flow rate (­ m3/s), A = area of the channel (­ m2)
and v = velocity of the gas (m/s).
Supply nodes should have gas at an optimum mass
flow rate as demanded by consumers. The mass flow rate
at supply nodes must be greater than the mass flow rate
produced by the well. Hence, Qimin ≤ Qi ≤ Qimax , i = 1, 2, …
­Nn. Where Qi represents the gas inflow and outflow rate at
node ‘i’ ­(m3), Qimin is minimum allowable inflow and outflow
rate of gas at node ‘i’ (­ m3) and Qimax is maximum allowable
inflow and outflow rate of gas at node ‘i’ ­(m3).
5.1.2 Pressure in pipe
The basic equation used for inlet and outlet pressures in
gas transmission pipeline can be given as [19]:
�� √ �� � �
104 Q f Ps � S.L.Z.T �0.5
2
Pi = po + (2)
7.574 E Ts D5
�� √ �� � �
104 Q f Ps � S.L.Z.T �0.5
Po = pi2 + (3)
7.574 E Ts D5
where L = pipe length (m), D = pipe diameter (mm),
­Ts = standard temperature (K), ­Ps = standard pressure
(1.01325 bar), f = friction factor, S = gas gravity, Z = gas
compressibility factor at the flowing temperature (dimen-
sionless), ­Pi = inlet pressure (bar) and P
­ o = outlet pressure
(bar).
The outflow and inflow pressure is similar to mass flow
rate, which means Pmin ≤ P ≤ Pmax . Where P is pressure at
particular node (MPa), Pmin is minimum allowable pressure
at particular node (MPa) and Pmax is maximum allowable
pressure at particular node (MPa).
5.1.3 Loop conditions
In loop piping two or more pipes are connected in such a
way that the gas flow can be split among branched pipes
and eventually downstream into a single pipe. According
to looping condition there is zero pressure drop in a closed
loop within the network system [17, 21].The loop which
SN Applied Sciences (2019) 1:769 | https://doi.org/10.1007/s42452-019-0755-2 Research Article

is considered here is mentioned in Fig. 2 which includes where H = head, ­Pi = inlet pressure, ­Po = outlet pressure,
node points 2, 5, 6, 8, 10 and 12. The equation for single m = (k − 1)/k, k is specific heat ration, Ts = inlet gas tempera-
phase general flow can be expressed as: ture, Z = compressibility of the gas and R = gas constant.
The compressor performance governing equation for
( )0.5 ( )2.5
Q2 L2 D1 the simulation model can be given as [15]:
= (4) ( )m
Q1 L1 D2 Po mn2 { }
= A + BH (Q∕n) + CH (Q∕n)2 + DH (Q∕n)3 + 1
Pi ZRTs H
where Q = gas flow rate through pipe, L = length of the
pipe and D = diameter of the pipe. (8)
where H = adiabatic head, ­Pi = inlet pressure, ­Po = outlet
5.1.4 Pressure drop equation of pipelines pressure, m = (k − 1)/k, k is specific heat ration, Ts = inlet gas
temperature, Z = compressibility of the gas, R = gas con-
It is the pressure drop in the pipeline as inlet and outlet stant, ­AH, ­BH, ­CH and ­DH = constants which depend on the
pressure [13]. The expression for this can be given as: unit, Q = flow rate, n = speed and η = adiabatic efficiency.
Equation 8 is a general compressor equation for single
⎡ ⎤ � � �2 � �2 � compressor. This equation is one of the most significant
⎢ 144gA 2 ⎥ Pi − Po
contribution in order to optimize gas transmission pipeline
w2 = ⎢ � �⎥ × (5)
⎢ V1 fL Pi
+ 2 log e P ⎥ Pi network.
⎣ D o ⎦

where w = flow rate, g = acceleration of gravity, A = cross-
sectional area of pipe, ­V 1 = specific volume of gas at
inflow condition (­ ft3/lbm), f = friction factor dimension-
less, L = length (ft), D = diameter of the pipe (ft), P
­ i = inflow
pressure (psi) and ­Po = outflow pressure (psi).
5.1.5 Mass flow rate balance equation
According to mass conservation law, the outflow rate and
inflow rate should be equal to 0.
∑ as flow rate, pressure, loop condition, mass consumption
𝛼ik Mik + Qi = 0
(6)
k∈Ci
where Ci = sets of elements connected with node ‘i’,
Mik = absolute value of inflow (outflow) rate of element
k connected with node ‘i’ ­(m3), Qi = exchange flow rate
between node ‘i’ and outside (inflow is set as positive value
and outflow is negative value) ­(m3) and aik = A coefficient,
its value is − 1 when gas in element k flow into node ‘i’, the
value is 1 when gas in element k flow out of node i.
5.1.6 Compressor equation
The compressor map information is related to outlet pres-
sure, the inlet pressure and flow rate. The relationship
between inlet pressure P­ i and outlet pressure P
­ o with head
H is expressed as [12]:
{[ ]m }
ZRTs Po
H= −1
m Pi
6 Simulation of optimization of gas network
using genetic algorithm
In genetic algorithm method a class of adaptive algorithm
are represented whose search methods are based on the
simulation of natural genetics. It falls under the class of
probabilistic algorithms. The parameters and steps which
will be involved in simulation of optimization of gas net-
working are discussed below. Before starting the genetic
algorithm, the sampling interval of each parameters such
and cost is calculated using the following expression:
( )
Smax − Smin
ΔS = (9)
(mn − 1)
where ΔS = sampling interval, Smax = maximum value of a
particular parameter, Smin = minimum value of a particu-
lar parameter, m = encoding base (for binary m = 2) and
n = number of bits which represent each parameter in
binary code.
The sampling is required to be estimated as it repre-
sents the whole population. Let us consider the case of
cost which varies from 60 to 74%, and each cost value is
binary coded with eight bits. The resolution of sampling
for the same is 0.05%.
6.1 Population
The primary set of population is generated randomly and
(7)
size of population depends upon the complexity of pipe-
line network [14]. In order to discover new clones [23] the
initial population should be a large pool of different genes.

Vol.:(0123456789)
Research Article SN Applied Sciences (2019) 1:769 | https://doi.org/10.1007/s42452-019-0755-2

Table 1  Binary form representation of initial population

String no. Initial population- Initial population Fitness Fitness probability Expected count Actual count
cost (x %) (encoded) f(x) = (x0.5)

1 70 01000110 8.3666 0.25516251 1.02065 1

2 55 00110111 7.4162 0.22617744 0.90471 0
3 65 01000001 8.0622 0.2458799 0.9835516 1
4 80 01010000 8.9443 0.27278106 1.091124 2

Table 2  Crossover operation of initial population with mating pool

String no. Initial population Mating pool Crossover Offspring after Cost at each Fitness Fitness probability ­(Fi)
(encoded) site crossover node (x %) f(x) = (x0.5)

1 01000110 010001 10 6 010001 00 68 8.2462 0.24040278

2 00110111 010100 00 6 010100 10 82 9.0554 0.26399352
3 01000001 0100 0001 4 0100 0000 64 8.000 0.23322527
4 01010000 0101 0000 4 0101 0001 81 9.000 0.26237843

Including different genes for initial population leads to an

algorithm which has enough diversity in the population ∑
n

to get fast and good solutions. In this paper the popula-

Favg = Fi (10)
i=1
tion size is taken to be 256 ­(28). The range of population is
taken here as 255. The equation for fitness function probability selection [8]
can be expressed as:
6.2 Encoding
F
Pi = ∑n i (11)
After the generation of population a standard binary cod- F
i=1 j
ing is followed. The pipeline parameters need to be con-
verted into binary numbers. As for example, the cost at ­1st where ­Pi = fitness probability and ­Fi = individual param-
node is “70” (hypothetical scenario) which can be encoded eters fitness.
as “01000110”. As the population size in present case is 256,
so for each parameter around 256 strings of populations 6.4 Expected count
will be estimated for optimization. The evaluation of full
cycle of genetic algorithm for cost is shown in Table 1. As The expected count (Ei) of each string for population size
the population size is big hence only 4 strings are chosen “n” can be given as:
for manual process, while the algorithm has taken care of
whole 256 population.
Ei = Pi × n (12)
For example if a string is having E­ i = 2.5 then it will have
6.3 Fitness function two outcomes one with probability of 0.1 and other with
a probability of 0.5. The minimum count is represented as
Fitness function is defined as the ratio of the assessment ­Ei = 0, which is removed from the population. Based upon
value of a particular clone to the average assessment of the expected count each individual get multiple copies.
all the clones. In this paper power law by Sadjadi [25] fit-
ness function f(x) = (xk) has been applied for each popula- 6.5 Crossover
tion assessment. For binary representation in this case × is
considered as 2 and the k (Problem dependent) value is Crossover is the process of generating better quality genes
taken 0.5 as the range of population is ­28. The “n” number by exchanging the good information between the particu-
of population size the fitness for ith chromosome can be lar parents. The crossover probability can be calculated as
given as ­Fi while the average fitness of the ith generation the ratio of pairs of clones which will be selected for mat-
can be calculated as: ing to the total number of pairs of clones.

Vol:.(1234567890)
SN Applied Sciences (2019) 1:769 | https://doi.org/10.1007/s42452-019-0755-2 Research Article

Table 3  Flip bit mutation with String no. Offspring after Offspring after Cost (x %) Fitness Fitness
fixed probability crossover mutation f(x) = (x0.5) probability
­(Fi)

1 01000100 0100010 1 69 8.3066 0.238371

2 01010010 01010010 82 9.0554 0.259859
3 01000000 0100 1 000 72 8.4853 0.243499
4 01010001 01010001 81 9.0000 0.25827

For example in present study single point crossover

method is used. In which the designed algorithm can
pick a single cross over site randomly. As we can see in
Table 2 that is based on the fitness value second string
has been replaced by the fourth string. In this case two
pairs of strings are evaluated, where the first two strings
have crossover site six and last two string have cross over
site four. Similarly for the last two strings, the tail bits are
exchanged at the crossover site after fourth bit.

6.6 Crossover probability
After the selection of a pair of chromosomes, crossover
is performed to generate offspring. Crossover probability
is defined as the ration of pairs of chromosomes which
will be selected for mating to the total number of pairs of
chromosomes. Crossover is performed to generate new
chromosomes which will accomplish good qualities of
the old chromosomes. Based on the various experiments
in this case the crossover probability is taken to be 65%.
65% of crossover probability means that out of 100 pairs of
strings, only 65 pairs of randomly chosen strings will have
crossover and the rest string pairs will remain unchanged.
6.7 Mutation
Mutation can generate new genes by flipping one or more
gene values randomly in a clone. The mutation probability
can be calculated as ratio of the bits to be flipped ran-
domly to the total bits of clones [28].
A multi- directional search is performed by genetic
algorithm in order to maintain a population of potential
solutions and encourage information formation along
with exchange between these directions. A number of
populated solutions are developed in this simulated evolu-
tion in which the relatively “good” solutions reproduce. The
different solutions are distinguished on the basis of evalu-
ation function which plays the role of an environment.
After the individuals are converted into population by
determining the fitness function of individual. The simula-
tion further proceeds to crossover selection and mutation
probability the simulation needs to be checked whether
Fig. 3  Gas transmission pipeline system consisting of 12 nodes, 7
compressors and 2 gas source
the termination conditions are satisfied or not. If it meets
the desired output than the outputs are the optimization
results otherwise it needs to be processed again from the
fitness function determination point.
In present study flip bit mutation method is used. In
this mutation process, the bits (0 and 1) of the selected
genes are flipped by mutation operator. Mutation operator
is generated randomly. According to Table 3 the first and
third string are having mutation. The last bit of the first
string and the fifth bit of the third string have been flipped
by the mutation operator.
6.8 Mutation probability
Mutation probability is defined as the ratio of the bits to
be flipped randomly to the total bits of the chromosomes.
For example a chromosome of length 100 bits have muta-
tion probability of 0.06 that means only six bits randomly
chosen will be flipped. In this example the mutation
probability value is kept at 12% because the high muta-
tion probability will change the maximum genes of the
chromosome, and the algorithm will relapse into a random
search for an optimum value.

Vol.:(0123456789)
Research Article SN Applied Sciences (2019) 1:769 | https://doi.org/10.1007/s42452-019-0755-2

Table 4  Basic data of each segment like description of pipes, pipe- constraints and purchasing price of gas of each node
line specification, length, etc before and after optimization are shown in Table 5.
Sr. no. Descrip- Pipeline speci- Length (km) Fitting It has been found according to Table 5 that the gas con-
tion of fication (mm) friction coef- sumption of each node has been optimized between of
pipes ficient 30,000–50,000 m3/h range, while pressure is optimized in
1. 1–4 820 × 10 1.2 0.3 the range of 3.01–3.99 MPa. The total cost before optimi-
2. 2–5 820 × 10 9 0.66 zation was 276 × 104 INR/day whereas after optimization
3. 2–6 820 × 10 6.5 0.32 it was found to be 280.32 × 104 INR/day.
4. 3–7 820 × 10 4 0.32
5. 4–9 820 × 10 2 0.32
6. 5–8 820 × 10 1.1 0.44 8 Conclusion
7. 6–8 820 × 10 10 0.32
8. 7–11 820 × 10 6 0.32 This paper present a mathematical model approach for
9. 8–10 820 × 10 3.3 0.32 optimization of gas transmission network. For gas trans-
10. 9–12 820 × 10 5 0.51 mission network the algorithm for genetic algorithm is
11. 10–12 820 × 10 1.4 0.32 developed in C ++. The objective of this research was to
12. 11–12 820 × 10 2.3 0.23 reach the global optimum solution instead of local minima
solution for interdependent parameters. In this paper the
simulation details are followed by the formulation of dif-
7 Simulation application ferent constraints like inlet and outlet pressure, inlet and
outlet flow rate, pressure drop equations of pipeline, loop
In this paper a 12 node gas transmission network is taken conditions, compressor equations and mass flow rate
which consist of 2 gas source and 7 compressors (Fig. 3). balance equation and lost at each node. Simulation was
The network was considered as in steady state condition. performed on the basis of four major steps namely popula-
A High Density Polyethylene (HDPE) type of pipe is used tion generation, fitness function, mutation and crossover.
in the segment after source pipeline to consumer seg- The simulation was used to optimize five parameters like
ment. The pressure of gas in the transmission pipeline pressure, flow rate, mass, loop and cost of a gas transmis-
network ranges from 2.2 MPa to 3.45 MPa. The factors sion network. It was considered that the network was in
like description of pipe, pipeline specification, length of steady state condition. The simulation was applied on 12
pipe and fitting friction coefficient is described in Table 4. node system where the pressure was optimized between
While the parameters like input/output quantity, quantity 3.01 and 3.99 MPa range while the gas consumption was

Table 5  Optimization data like income, maximum and minimum consumption, optimization consumption and pressure, etc. on each node
Courtesy: Gujarat Gas Companies
Sr. No. Gas consumption Optimization gas con- Optimization gas Optimization pres- Income ­(104 Income after opti-
­(m3/h) sumption ­(m3/h) flow ­(m3/h) sure (MPa) INR/day) mization ­(104 INR/
day)

1 20,000 30,000 55,000 3.21 50 50.56

2 31,000 40,000 40,000 3.22 11 11.43
3 40,000 43,000 34,000 3.01 27 27.1
4 36,000 50,000 42,000 3.24 26 26.33
5 50,000 30,000 33,000 3.42 9 9
6 43,000 42,000 30,000 3.333 42 42.12
7 32,000 30,000 51,000 3.124 36 36.99
8 40,000 33,000 54,000 3.56 12 12.2
9 57,000 40,000 43,000 3.56 12 12.33
10 22,000 49,000 46,000 3.47 14 14.26
11 43,000 38,000 32,000 3.48 16 16.12
12 60,000 50,000 44,000 3.67 21 21.88
Total 276 280.32

Vol:.(1234567890)
SN Applied Sciences (2019) 1:769 | https://doi.org/10.1007/s42452-019-0755-2
optimized between the ranges of 30,000–50,000 m3/h. It
has been seen that the cost at each node and for the whole
system is improved. According to Table 5 it has been seen
that the income of the chosen network was 276 × 104 INR/
day but after the optimization of various parameters
involved cost improves to 282.32 × 104 INR/day.
Compliance with ethical standards
Conflict of interest The authors declare that they have no competing
interests.
References
1. Amani H, Kariminezhad H, Kazemzadeh H (2016) Development
of natural gas flow rate in pipeline networks based on unsteady
state Weymouth equation. J Nat Gas Sci Eng 33:427–437
2. Andre J, Bonnans F, Cornibert L (2009) Optimization of capacity
expansion planning for gas transportation networks. Eur J Oper
Res 197(3):1019–1027
3. Babu BV, Angira R, Chakole PG, Syed Mubeen JH (2003) Optimal
design of gas transmission network using differential evolu-
tion. In: Proceedings of the second international conference on
computational intelligence, robotics, and autonomous systems
(CIRAS-2003), Singapore, December 15–18, PS0402, pp 01–07
4. Bonnans JF, Spiers G, Vie JL (2011) Global optimization of pipe
networks by the interval analysis approach: the Belgium net-
work case. INRIA. https​://hal.inria​.fr/hal-00642​932
5. Borraz-Sanchez C, Rios-Mercado RZ (2004) A non-sequential
dynamic programming approach for natural gas network opti-
mization. WSEAS Trans Syst 3:1384–1389
6. Borraz-Sánchez C, Ríos-Mercado RZ (2009) Improving the oper-
ation of pipeline systems on cyclic structures by tabu search.
Comput Chem Eng 33(1): 58–64
7. Chebouba A, Yalaoui F, Smati A, Amodeo L, Younsi K, Tairi A
(2009) Optimization of natural gas pipeline transportation using
ant colony optimization. Comput Oper Res 36:1916–1923
8. Chipperfield A, Fleming P, Pohlheim H, Fonseca C (1994) Genetic
algorithm toolbox. University of Sheffield, Sheffield, pp 1–105
9. De Wolf D, Smeers Y (2000) The gas transmission problem
solved by an extension of the simplex algorithm. Manag Sci
46(11):1454–1465
10. Furey BP (1993) A sequential quadratic programming-based
algorithm for optimization of gas networks. Automatica
29:1439–1450
11. Gopalakrishnan A, Biegler LT (2013) Economic nonlinear model
predictive control for periodic optimal operation of gas pipeline
networks. Comput Chem Eng 52:90–99
12. Gresh MT (2000) Compressor performance aerodynamics for the
user, 2nd edn. Butterworth Heinemann, Boston
13. Griffith P (1984) Multiphase flow in pipes. J Petrol Technol
36(3):361–367
14. Haupt RL, Haupt SE (2004) Practical genetic algorithms, 2nd edn.
Wiley Interscience Publication, Hoboke
15. Kurz R, Ohanian S (2003) Modeling turbo machinery in pipe-
line simulations. In: 35th annual meeting of Pipeline Simulation
Interest Group (PSIG), Bern, Switzerland
Research Article
16. Li CJ, Jia WL, Wu X (2009) Comprehensive valuation on regula-
tion schemes of gas transmission pipelines. In: ASCE proceed-
ings of the international conference on pipelines and trenchless
technology, Shanghai, China, pp 581–590
17. Menon ES (2005) Gas pipeline hydraulics, 1st edn. CRC Press,
New York
18. MohamadiBaghmolaei M, Mahmoudy M, Jafari D (2014) Assess-
ing and optimization of pipeline system performance using
intelligent systems. J Nat Gas Sci Eng 18:64–76
19. Nasr GG (2011) Gas flow and network analysis. Salford Univer-
sity, Salford
20. O’Neill RP, Williard M, Wilkins B, Pike R (1979) A mathematical
programming model for allocation of natural gas. Oper Res
27(5):857–873
21. Osiadacz AJ (1987) Simulation and analysis of gas networks, 1st
edn. Gulf Publishing Company, Houston
22. Pietrasz S, Antunes M, Cornibert L (2008) The problem of rein-
forcing regional gas transmission networks: a performance
study of three optimization methods. In: EngOpt 2008—interna-
tional conference on engineering optimization, Rio de Janeiro,
Brazil, 1–5 June 2008, pp 1–10
23. Rezaian A, Alipanah M, Pour HN, Kazemi H (2010) A genetic
algorithm approach to determination of optimum diameter of
gas transmission pipes. In: Paper SPE-140671-MS presented at
the 34th annual SPE international conference and exhibition,
Tinapa–Calabar, Nigeria, 31 July–7 August 2010
24. Rios-Mercado RZ, Wu S, Scout LR, Boyd EA (2002) A reduction
technique for natural gas transmission network optimization
problems. Ann Oper Res 117:217–234
25. Sadjadi FA (2004) Comparison of fitness scaling functions in
genetic algorithms with applications to optical processing. In:
Proceedings of SPIE (5557), SPIE, Bellingham
26. S’anchez BC, Mercado RZ (2005) A hybrid meta-heuristic
approach for natural gas pipeline network optimization. In:
LNCS, vol 3636, pp 54–65
27. Steinbach MC (2007) On PDE solution in transient optimization
of gas networks. J Comput Appl Math 203:345–361
28. Thander B, Sircar A (2014) Hydrocarbon resource estimation: a
stochastic approach. J Pet Explor Prod Technol 5(4):445–452
29. Woldeyohannes AD, Majid MAA (2010) Simulation model for
natural gas transmission pipeline network system. Simul Model
Pract Theory 19:196–212
30. Wu S (1998) Steady-state simulation and fuel cost minimization
of gas pipeline networks. Department of Mathematics, Ph.D.
Thesis, University of Houston
31. Wu S, Rios-Mercado RZ, Boyd EA, Scott LR (2000) Model relaxa-
tions for the fuel cost minimization of steady-state gas pipeline
networks. Math Comput Model 31:197–220
32. Wu Y, Lai KK, Liu YJ (2007) Deterministic global optimization
approach to steady-steady distribution gas pipeline. Optim Eng
8(3):259–275
33. Zavala VM (2014) Stochastic optimal control model for natural
gas networks. Comput Chem Eng 64:103–113
34. Zhang J, Zhu D (1996) A bilevel programming method for pipe
network optimization. SIAM J Optim 6:838–857
Publisher’s Note Springer Nature remains neutral with regard to
jurisdictional claims in published maps and institutional affiliations.
Vol.:(0123456789)