Next Article in Journal
Radial Movement Optimization Based Optimal Operating Parameters of a Capacitive Deionization Desalination System
Next Article in Special Issue
Answer Set Programming for Computing Constraints-Based Elementary Flux Modes: Application to Escherichia coli Core Metabolism
Previous Article in Journal
Rapid TLC with Densitometry for Evaluation of Naproxen Stability
Previous Article in Special Issue
Metabolic Efficiency of Sugar Co-Metabolism and Phenol Degradation in Alicyclobacillus acidocaldarius for Improved Lignocellulose Processing
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Enhanced Segment Particle Swarm Optimization Algorithm for Kinetic Parameters Estimation of the Main Metabolic Model of Escherichia Coli

by
Mohammed Adam Kunna
1,
Tuty Asmawaty Abdul Kadir
1,*,
Muhammad Akmal Remli
2,*,
Noorlin Mohd Ali
1,
Kohbalan Moorthy
1 and
Noryanti Muhammad
3
1
Faculty of Computing, College of Computing and Applied Science, Universiti Malaysia Pahang, Kuantan, Pahang 26300, Malaysia
2
Institute for Artificial Intelligence and Big Data, Universiti Malaysia Kelantan, City Campus, Pengkalan Chepa, Kota Bharu 16100, Kelantan, Malaysia
3
Centre for Mathematical Sciences, Universiti Malaysia Pahang, Kuantan, Pahang 26300, Malaysia
*
Authors to whom correspondence should be addressed.
Processes 2020, 8(8), 963; https://doi.org/10.3390/pr8080963
Submission received: 1 June 2020 / Revised: 21 July 2020 / Accepted: 30 July 2020 / Published: 10 August 2020

Abstract

:
Building a biologic model that describes the behavior of a cell in biologic systems is aimed at understanding the physiology of the cell, predicting the production of enzymes and metabolites, and providing a suitable data that is valid for bio-products. In addition, building a kinetic model requires the estimation of the kinetic parameters, but kinetic parameters estimation in kinetic modeling is a difficult task due to the nonlinearity of the model. As a result, kinetic parameters are mostly reported or estimated from different laboratories in different conditions and time consumption. Hence, based on the aforementioned problems, the optimization algorithm methods played an important role in addressing these problems. In this study, an Enhanced Segment Particle Swarm Optimization algorithm (ESe-PSO) was proposed for kinetic parameters estimation. This method was proposed to increase the exploration and the exploitation of the Segment Particle Swarm Optimization algorithm (Se-PSO). The main metabolic model of E. coli was used as a benchmark which contained 172 kinetic parameters distributed in five pathways. Seven kinetic parameters were well estimated based on the distance minimization between the simulation and the experimental results. The results revealed that the proposed method had the ability to deal with kinetic parameters estimation in terms of time consumption and distance minimization.

1. Introduction

Mathematical modeling is a compelling strategy for predicting and recognizing the biologic behavior of a cell’s system. The mathematical model can create and predict the results of the empirical hypotheses that can be used to examine the process. In this regard, the biologic model studies the chemical metabolism and the pathways to construct a kinetic model that can give a clear understanding of a cell mechanism [1].
Therefore, building and developing a kinetic model requires a large number of parameters such as kinetic parameters, potential of hydrogen (pH) and initial enzymatic and metabolite concentration. In the same vein, the building and the developing of the kinetics model gives a clear picture of cell behavior when it is needed in biotechnology applications [2]. In addition, building and developing a kinetic model is a challenging task because it requires kinetic parameter estimation [3].
Kinetic parameters estimation is the finding of the nearest value that minimizes the distance between the simulated and the real experimental results [4]. Kinetic parameters estimation is a complex task because of the nonlinearity of the kinetic model, and it is usually measured in different conditions and time consumption [5]. Usually, the kinetic parameters stored in the database are insufficient for building accurate kinetic model due to the cell behavior in different measurements stated by different laboratories utilizing various in vitro models and conditions [6].
Normally, the model is built depending on time derivative expressions using Ordinary Differential Equations (ODEs) which describe the changes in a state or quantity of interest over time. Recently, several kinetic models of cell metabolism are based on ODEs which have been developed to detect time-dependent changes in metabolic concentration. For example, models of glycolysis and pentose phosphate (PP) pathways in E. coli [7,8] and the tri-carboxylic acid (TCA) cycle in Dictyostelium discoideum [9] have been constructed. Furthermore, large scale model integration has been performed. For example, the model of [7] has been integrated with the model of (TCA) cycle [8,10] and amino acid biosynthesis [11]. Researchers have studied the glycolysis pathway to clone a new host and observe its changes and effects [12].
Therefore, because of the difficulty in estimating kinetic parameters, many researchers lately have used the metaheuristic optimization algorithms’ methods to estimate the kinetics of the E. coli model and other biologic models. Some of these metaheuristic algorithms were used in order to estimate the kinetic parameters employed by [13,14,15,16,17,18,19,20,21] and some of these algorithms have used experimental data taken from [7,22,23] to investigate their abilities in the kinetic parameters estimation.
In this regards, the biologic kinetic models contain hundreds to thousands of kinetic parameters which have caused serious challenges in parameter estimation due to the high dimension of search space that is required to be explored. Thus, in high dimensional kinetic models (containing hundreds to thousands of kinetic parameters), the procedures are considered to be expensive in terms of computational cost and the performance of the aforementioned algorithms tend to deteriorate, which may lead to low accuracy [6].
The Differential Evolution (DE) algorithm is an example that is widely used and studied in parameter estimation of metabolic model [6,17]. Time consumption is the main weakness of (DE) algorithm; this makes it difficult for the (DE) algorithm to tune its parameters when it involves a large number of processors and multiple local searches. In addition, the Genetic Algorithm (GA) belongs to the class of evolutionary algorithms which almost share the same idea as DE. This algorithm is a popular method that is used in parameter estimation of metabolic model. The main weakness of this algorithm is the high computational time which mostly does not perform effectively when it is compared to DE and Particle Swarm Optimization (PSO) algorithms [24,25,26].
Since 1995, the PSO algorithm has been making great impact in solving many problems in different fields such as [14,27,28,29]. This method was proposed by [30] and it was adopted in simulating flock of birds and a school of fish in order to locate their food. The algorithm particles during their movement in the process of searching share the information with each other and then they search for their destination stochastically and independently. Therefore, the particles’ movements in the search space move towards the optimum solution by taking different paths and directions.
Moreover, the method of Se-PSO was proposed and developed based on the PSO algorithm in order to increase the computational time, and the accuracy of PSO was presented by [31]. This development is based on the recognition of the local and global point problem of PSO [30]. In this regard, the segmentation divides the particles into groups so as to move together towards the optimal solution. This algorithm was adapted for large-scale kinetic parameters of E. coli model [32] and governor–turbine model identification of single area power plant [28,32] was used in a linear inertia weight. Due to the nonlinearity of the model which uses linear inertia weight ( ω ) by [32], this inertia weight affects the exploration and exploitation of the particles. Consequently, there is need for large exploration at the beginning and small exploitation at the end of the algorithm execution. The purpose for this is to avoid the local optima trap so as to increase the efficiency of the kinetic parameters estimation with a view to minimizing the model distances in reasonable time.
In this study, the method of Se-PSO algorithm was enhanced by adding a damping process which helped the particles to have a wide exploration at the beginning and small exploitation at the end during the algorithm execution. The aim was to investigate the amount of each solution to be found at the search space. Thus, the enhanced Se-PSO was adapted to estimate large-scale kinetic parameters of E. coli and to increase the efficiency of the Se-PSO algorithm in terms of exploration and exploitation.
The other sections of the study are organized as follows: Section 2 describes the problem formulation. Section 3 describes the materials and methods. Section 4 describes the obtained results. Section 5 gives the conclusion of the findings of this study.

2. Problem Formulation

Kinetic parameters estimation of the kinetic model was formulated to find the best set of kinetics that minimizes the model simulation differences with real experimental data. This formulation was set as a global optimization problem. In this regard, optimization algorithm methods can be adapted in order to estimate the kinetic parameters and minimize the differences between the model simulation and real experimental result. The formulation of this problem mathematically was set as a fitness function in Equation (1) [13]:
f i t n e s s = i = 1 R | y s , i y e , i y e , i |
where R is the number of metabolites i experimental data; so R = 12 , y s , i is the estimated metabolites concentration s of metabolite i , y e , i is the real metabolites experimental data e of metabolite i .

3. Materials and Methods

3.1. Kinetic Model Structure

The dynamic model of the main metabolic of E. coli formulated by [10] was used as a benchmark. This model, which consists of (glycolysis, pentose phosphate, TCA cycle, gluconeogenesis and glyoxylate) pathways in addition to acetate formation with phosphotransferase system, is described in Figure 1.
This model has 23 metabolites, 28 enzymatic reactions, 10 co-factors (e.g., Adenosine triphosphate (ATP), Coenzyme A (COA), Nicotinamide adenine dinucleotide phosphate (NADPH)) and 172 kinetic parameters. The rate at which the concentration of the metabolite in the considered model changes is given by Equation (2) as follows:
d C i d t = j = 1 S i , j v j μ C i
where C i is the concentration of metabolite i , v i is the rate of reaction j , S i , j is the stoichiometric coefficient of the metabolite i in the reaction j and μ is the specific growth rate. Thus, the term μ C i represents the dilution effect due to biomass growth. The model mass balance equations and the kinetic rate equations of the considered model are stated in Appendix A Table A1 and Table A2, respectively.

3.2. Parameter Estimation by (ESe-PSO) Algorithm

In this study, an enhanced (Se-PSO) algorithm was proposed. This method shares the same idea as Se-PSO, but it is different in terms of exploration and exploitation of the inertia weight [27]. Decreasing linear inertia weight ( ω = 0.9   t o   0.4 ) [27] was used. The inertia weight controlled the effect which the last iteration speed had on the current speed, and thus allowed the particles to explore wider areas in the beginning and nearby areas in later stages with reduced speed for exploitation. Here, the main plan of ESe-PSO was to add a damping process to the inertia weight so as to support the exploration and exploitation of the particles towards the optimum solution. The development was done by initializing the inertia weight ω = 1 and damping parameter called ω d a m p = 0.99 . This damp parameter was calculated in the iteration process to increase the controlled convergence and to support the particles for reaching the global solution. In Table 1 below, the (ESe-PSO) algorithm is described:
Table 1 describes the steps of the enhanced segment particle swarm optimization algorithm used to estimate the kinetic parameters. These algorithms were started by initializing the particles that had the highest number of generation S = 30 . The bird number B = 10 and b e 1 : b e n was the kinetic parameter boundaries b from e 1   t o   e n parameters. The problem dimension D = 7 , inertia weight   ω = 1 and damping process ω d a m p = 0.99 were in step 2. Then step 3 initialized the velocity and position of particles with the parameters of PSO which are acceleration coefficients towards the best personal position p i and the global best position of the entire G i , respectively, where c 1 &   c 2 are constants called cognitive and social scaling parameters, respectively, and a random number between 0 and 1 for ( r 1 , r 2 ).
The calculation of the segment length was obtained by utilizing step 4. Each kinetic parameter of the boundaries, both of the upper and lower, regarding the dimension of the problem D was created in step 5. Based on the number of segments, the calculation of the initial fitness of the whole segments was done with the assumption that the initial fitness was the best fitness step for 6, 7 and 8.
Here, the new fitness was calculated based on the fitness equation stated in step 11. Where the fitness was greater than the best fitness set, the iteration updated the velocity and the position towards the new fitness steps of 15, 17 and 19. If the new fitness was smaller than or equal to the best fitness print, the global best particles position updated the kinetic parameter, based on the global best particles position which is supposed to be the new initial kinetic parameters step in 22 and 23. If the fitness was greater than the best fitness, it returned to step 2 until the program highly figured out a solution or the iteration was met in step 25. The global point of segments is set equal to the global best position which was then used to calculate the optimal segment by its Equations (28)–(30). After the optimum segments were identified, they were used as the new initial kinetic parameter; PSO algorithm in [13] was searched among them and ended the program in step 31.

4. Results

The estimation of large-scale kinetic parameters in the kinetic model was a difficult task due to the nonlinearity of the model. For this reason, the kinetic parameters were reported from different laboratories and time consumption [32]. It was stated that during the application of the local sensitivity analysis to [14] model result, each kinetic parameter increased up to 200% by step 0.5 to calculate its sensitivity. It was found out that 7 kinetic parameters were highly affected by the used model’s response for estimating the proposed algorithm. These sensitive kinetic parameters are v m a x p y k , n p k , i c d h , k i c d h f , k i c d h n a p d , k i c d h n a p m and v m a x i c l which were involved in this reaction rate of V p y k ,   V i c d h ,   a n d   V i c l . In addition, the experimental data of [16] were taken. These experimental data are G l c , G 6 P , F 6 P , F D P , P E P , P Y R , 6 P G , R u 5 P , X u 5 P , S 7 P , R 5 P and E 4 P .
As a matter of fact, during the ESe-PSO algorithm execution, the segments of the kinetic parameters of [32] were increased by adding 1 segment to each kinetic to increase the possibility of searching the wide-area and finding an accurate solution which is depicted in Appendix A Table A3.
The ESe-PSO algorithm parameters such as c 1   a n d   c 2 was initialized as mentioned in [32], ω = 1 and ω d a m p = 0.99 . In this regard, the kinetic boundaries with their upper and lower bounds values were initialized with small increase based on [32] to allow the proposed algorithm search large space. Here, the mechanism for selecting the boundaries was based on the original kinetic parameters values, which assumed that these values are ± with each kinetics’ small value, so that the optimum result may be around it. These kinetic parameters boundaries are depicted in Table 2 with their estimation as follows:
After the kinetic parameters were initialized, the kinetic parameters were segmented to find the optimal segment for each kinetics. Later on, the updating of position, velocity and the fitness function was done based on the initialization of ESe-PSO parameters such as the inertia weight, damping process and the acceleration coefficient ( c 1   a n d   c 2 ). Thus, the optimal segment was determined based on the fitness function. The optimal segments were sent to the PSO algorithm which provided a local best solution so that PSO would search around the optimal segments.
In this regard, the ESe-PSO algorithm estimated the kinetic parameters and minimized the model distance to 28.94%. The model simulation was moved closer to the real experimental data when compared to the considered model; the Se-PSO, GA and DE algorithms are described in Table 3. The GA parameters were set as follows: generation gap = 0.8, crossover = 0.85, mutation = 0.05 [33] and maximum generation = 500. The DE parameters were set as follows: scaling factor F = 0.7 , crossover rate C r = 0.8 , search strategy was DE/rand/1/bin as stated in [6], population size = 100 and a number of generation = 500 [32].
Table 3 shows how the proposed method moved the model simulation towards the experimental data closely. This simulation increased P E P metabolites and this may be due to the other pathways engaged during the execution of the algorithm such as anaplerotic, TCA, with acetate formation. In addition, this increase may be the O A A , P E P and P Y R metabolites that were affecting the cell’s growth [10].
The analysis of the model distance minimization showed that 12 out of the 12 datasets were moving towards the real experimental data. These metabolites are G l c , G 6 P , F 6 P , F D P , P E P , P Y R , 6 P G , R u 5 P , X u 5 P , R 5 P , S 7 P and E 4 P ; thus, the metabolites were still slightly far from the experiment, perhaps because of the model complexity, shortage of data and the portion of some metabolites. Furthermore, the G6P empirical data were 3.48 mM and the simulation outcome of G6P could be leading to the empirical data rather than the G6P result model under examination when related to the G6P model. This discrepancy may be because of the model resolution of G6P consistency in the presence of 5   m M M g S O 4 and 0.48   m M N A D P + after the addition of 0.7   U   m l 1 of G 6 P D H as reported by [10].
Moreover, the F D P model simulation was having a better movement towards the experimental data rather than the considered model. This may be due to the nonlinearity of the system or the lumping of G A P and D H A P metabolites in one equation. The changes in F D P may be due to the lumping of p y k II and p y k I as stated in [10].
As stated in Table 3 above, the simulation response of the distance model minimization was moving towards the experimental data in 12 metabolites. Moreover, the model under investigation had five pathways than the data of only two pathways where only one metabolite was not well minimized ( P E P ) due to the lack of experimental data. The estimated kinetic parameters were used in the model simulation to compare our model responses to [10] model responses. The result of the comparison is depicted in Figure 2 below:
In order to prove that the result is statistically consistent, the STD, mean and F value were calculated for the considered model. The result of the simulated model is displayed in Table A3 and Equations (3)–(6).
In Appendix A Table A4, the mean and STD were calculated for the proposed algorithm results and the response of the considered model’s result. The proposed algorithm showed 0.6855 mean compared to the considered model (0.5251), DE (0.6189) and GA (0.6216) which indicated that the proposed algorithm result moved to the experimental data mean of 0.9647. In addition, DE algorithms showed a better result than GA in the mean values.
In addition, the proposed algorithm showed 0.9320 STD compared to the considered model’s 0.9198 STD which indicated that the proposed algorithm result moved to the experimental data STD of 1.2271. Thus, the hypothesis of the result in Table 4 is calculated as follows:
The hypothesis of Table A4 is calculated and decided below:
H 0 : S T D E 2 S T D D 2
H 1 : S T D E 2 < S T D D 2
F t e s t = S T D E 2 S T D D 2 = 0.8686 0.8286 = 1.0482
F 1 0.05 = 1 F 0.05 , n E , n D = 1 F 0.05 , 11 , 11 = 1 2.7186 = 0.3678
where S T D E 2 is the standard deviation of the optimized result E , S T D D 2 is the standard deviation of the considered model D and the n E , n D are the number of variables for the optimized and model result. This hypothesis was locking for minimizing the considered model’s errors. This suggests that we accepted H 0 and rejected H 1 as the accepted result. Thus, the F test showed that the proposed method had moved to the critical F value better than Se-PSO, DE and GA by indicating1.0482, 1.0497, 1.2881 and 1.3156, respectively.
The objective function and time consumption were calculated for the proposed algorithm, DE and GA as depicted in Table 4 below:
Table 4 demonstrates a comparison between the proposed algorithm with DE and GA algorithms. Table indicates that the proposed algorithm in this study produced superior results in terms of objective function values over 10 runs. The mean, STD, best and lowest objective functions were calculated. ESe-PSO algorithm produced the best mean (7.035E–05) and STD (0.000272) when compared to Se-PSO (mean 0.000603; STD 0.003567), DE (mean 0.049185; STD 0.251213) and GA, (mean 0.11476; STD 0.258243). The proposed method achieved the best objective function (2.3E-06) while Se-PSO ((0.00352), DE (0.00827) and GA (0.002579) achieved the best objective function. The consumed time by the proposed algorithm was achieved in 19 h while Se-PSO, DE and GA achieved the result in 19, 26 and 29 h, respectively.

5. Conclusions

The proposed method of ESe-PSO was used in order to estimate large scale kinetic parameters based on a large kinetic model. The estimation was carried by minimizing the model response distances with real experimental data. Seven kinetic parameters were estimated using 12 metabolites and the method optimized the 12 metabolites. These metabolites are G l c , G 6 P , F 6 P , F D P , P E P , P Y R , 6 P G , R u 5 P , X u 5 P , R 5 P S 7 P and E 4 P . The metabolites were well minimized with a slightly small error which may be due to the lump of G A P / D A H P metabolites or t k t b involvement in the pentose phosphate and glycolysis pathways. However, the proposed method of ESe-PSO algorithm revealed that it had the ability to perform kinetic parameters estimation. It is hereby suggested that further study can be carried out on the evaluation of large scale kinetic parameters segmentation of other algorithms like Firefly and Bat algorithms.

Author Contributions

M.A.K. and T.A.A.K. conceived the research. M.A.K. provided the methodology, formal analysis, writing—original draft preparation, data curation and software. M.A.K. provided supervision, project administration and reviewing. M.A.R. provided reviewing, editing, funding acquisition, investigations and resources. N.M.A. provided validation and resources. K.M. provided funding acquisition. N.M. provided mathematical analysis. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Malaysian Ministry of Higher Education via the Fundamental Research Grant Scheme (FRGS) [FRGS/1/2018/ICT02/UMP/02/8], FRGS-RACER [RACER/1/2019/ICT02/UMP//4 and RACER/1/2019/ICT02/UMP//1] and Universiti Malaysia Pahang [RDU190396].

Acknowledgments

The authors acknowledge support from the Ministry of Higher Education Malaysia, Universiti Malaysia Pahang (UMP) and Universiti Malaysia Kelantan (UMK).

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Mathematical proofs of results not central to the study can be added as an appendix.
Table A1. Mass balance equation.
Table A1. Mass balance equation.
MetabolitesMass Balance Description
cell ( X ) d [ X ] dt = μ [ X ]
extra glucose ( GLC ex ) d [ GLC ex ] dt = v PTS [ X ]
glucose-6-phosphate ( G 6 P ) d [ G 6 P ] dt = v PTS v PGI v G 6 PDH μ [ G 6 P ]
fructose 6-phospahte ( F 6 P ) d [ F 6 P ] dt = v PGI v PFK + v TKTB + v TAL μ [ F 6 P ]
fructose 1,6-phosphate ( FDP ) d [ FDP ] dt = v PFK v ALDO μ [ FDP ]
glyceraldehyde 3-phosphate ( GAP ) d [ GAP ] dt = 2 v ALDO v GAPDH + v TKTA + v TKTB v TAL μ [ GAP ]
phosphoenolpyruvate ( PEP ) d [ PEP ] dt = v GAPDH + v PCK v PTS v PYK v PPC μ [ PEP ]
pyruvate ( PYR ) d [ PYR ] dt = v PYK + v PTS + v MEZ v PDH μ [ PYR ]
acetyl-CoA ( AcCoA ) d [ AcCoA ] dt = v PDH + v ACS + v CS v PTA μ [ AcCoA ]
isocitrate ( ICIT ) d [ ICIT ] dt = v CS v ICDH v ICL μ [ ICIT ]
2-keto-d-gluconate ( 2 KG ) d [ 2   kG ] dt = v ICDH v 2 KGDH μ [ 2 KG ]
succinate ( SUC ) d [ SUC ] dt = v 2 KGDH + v ICL v SDH μ [ SUC ]
fumarate ( FUM ) d [ FUM ] dt = v SDH v FUM μ [ FUM ]
malate ( MAL ) d [ MAL ] dt = v FUM + v MS v MDH v MEZ μ [ MAL ]
oxaloacetate ( OAA ) d [ OAA ] dt = v MDH + v PPC v CS v PCK μ [ OAA ]
glyoxylate ( GOX ) d [ GOX ] dt = v ICL v MS μ [ GOX ]
acetyl phosphate ( ACP ) d [ ACP ] dt = v PTA v ACK μ [ ACP ]
acetate ( ACE ) d [ ACE ] dt = ( v ACK v ACS ) [ X ]
6-phosphogluconolactone ( 6 PG ) d [ 6 PG ] dt = v G 6 PDH v 6 PGDH μ [ 6 PG ]
ribose 5-phosphate ( Ru 5 P ) d [ Ru 5 P ] dt = v 6 PGDH v RPE v RPI μ [ Ru 5 P ]
ribulose 5-phosphoenolpyruvate ( R 5 P ) d [ R 5 P ] dt = v RPI v TKTA μ [ R 5 P ]
xylulose 5-phsophate ( Xu 5 P ) d [ Xu 5 P ] dt = v RPE v TKTA v TKTB μ [ Xu 5 P ]
sedoheptulose 7-phosphate ( S 7 P ) d [ S 7 P ] dt = v TKTA v TAL μ [ S 7 P ]
erythrose 4-phsophate ( E 4 P ) d [ E 4 P ] dt = v TAL v TKTB μ [ E 4 P ]
Table A2. Reaction rate equations.
Table A2. Reaction rate equations.
ReactionsKinetic Equation
cell growth ( X ) { μ m ( 1 [ X ] X m ) ( [ G L c e x ] K s + [ G L c e x ] ) k A T P v A T P ( . ) , ( [ G L c e x ] > 0 ) μ m A [ A c e e x ] K s A + [ A c e e x ]   k A T P v A T P ( . ) , ( [ G L c e x ] 1   a n d [ A c e e x ] > 0 )
PTS (phosphotransferase system) v P T S m a x [ G L c e x ] [ P E P ] P Y R ( K a 1 + K a 2 [ P E P ] [ P Y R ] + K a 3 [ G L c e x ] + [ G L c e x ] [ P E P ] [ P Y R ] ) ( 1 + [ G 6 P ] n G 6 P K G 6 P )
PGI (phosphoglucoseisomerase) v P G I   m a x ( [ G 6 P ] [ F 6 P ] K e q ) K G 6 P   ( 1 + [ F 6 P ] K F 6 P   ( 1 + [ F 6 P ] K 6 p g i n h F 6 P ) + [ 6 P G ] K 6 p g i n h G 6 P ) + G 6 P
PFK (phospho-fructokinase) v P F K m a x K A T P   [ F 6 P ] K ( A T P ,   A D P ) ( [ F 6 P ] + K z F 6 P K b ( A D P , A M P ) + [ P E P ] K P E P K a ( A D P , A M P ) ) ( 1 + L p f k ( 1 + [ F 6 P ]   ( K a ( A D P , A M P ) K s F 6 P ( K b ( A D P , A M P ) + [ P E P ] K P E P ) ) ) n P F K )
Aldo (aldolase) v A L D O   m a x ( [ F D P ] [ D H A P ] [ G A P ] K e q ) ( K F D P   + [ F D P ] + K G A P [ D A H P ] [ K e q V b i f ] + K D H A P [ G A P ] [ K e q V b i f ] + [ F D P ] [ G A P ] K i n h P E P + [ D H A P ] [ G A P ] K e q V b i f )
GAPDH (glyceraldehyde 3-phosphate dehydrogenase) v G A P D H m a x ( [ G A P ] [ P E P ] [ N A D H ] K e q [ N A D ] ) ( K G A P ( 1 + [ P E P ] K P G P ) + [ G A P ] ) ( K N A D N A D ( 1 + [ N A D H ] K N A D H ) + 1 )
PYK (pyruvate kinase) v P Y K m a x   [ P E P ] ( P E P K P E P + 1 ) n p y k 1 [ A D P ] K P E P ( L P Y K ( 1 + [ A T P ] K A T P [ F D P ] K F D P + [ A M P ] K A M P + 1 ) n p y k + ( [ P E P ] K P E P + 1 ) n p y k )   ( [ A D P ] + K A D P )
Ppc (PEP carboxylase) K 1 + K 2 [ A c C O A ] + K 3 [ F D P ] + K 4 [ A c C O A ] [ F D P ] 1 + K 5 [ A c C O A ] + K 6 [ F D P ] ( [ P E P ] K m + [ P E P ] )
G6PDH v G 6 P D H m a x [ G 6 P ] [ N A D P ] ( [ G 6 P ] + K g 6 p ) ( 1 + [ N A D P H ] K n d p h ) ( K n a d p ( 1 + [ N A D P H ] K n a d p h ) + N A D P )
PGDH (phosphogluconate dehydrogenase) v P G D H m a x [ 6 P G ] [ N A D P ] ( [ 6 P G ] + K 6 p g ) ( [ N A D P ] + K n a d p ( 1 + [ N A D P H ] K n a d p h ) ( 1 + [ A T P ] K a t p ) )
Rpe (ribulose-phosphate 3-epimerase) v R p e m a x ( [ R u 5 P ] [ R 5 P ] K e q R p e )
Rpi (ribose-5-phosphate isomerase) v R p i m a x ( [ R u 5 P ] [ R 5 P ] K e q R p i )
TktA (transketolase A) v T K t A m a x ( [ R 5 P ] [ X u 5 P ] [ S 7 P ] [ G A P ] K e q T K t A )
TktB (transketolase B) v T K t B m a x ( [ X u 5 P ] [ E 4 P ] [ F 6 P ] [ G A P ] K e q T K t B )
Tal (tyrosine ammonia lyase) v T a L m a x ( [ G A P ] [ S 7 P ] [ E 4 P ] [ F 6 P ] K e q T K t B )
PcK (PEP carboxykinase) v P c K m a x ( [ O A A ] [ A T P ] [ A D P ] K m O A A [ A T P ] [ A D P ] + [ O A A ] [ A T P ] [ A D P ] + K i A T P K m O A A K i A D P + K i A T P K m O A A K m P E P K i A D P [ P E P ] + K i A T P K m O A A K i P E P K l A T P   [ A T P ] [ P E P ] [ A D P ] + K i A T P K m O A A K i A D P K l O A A [ O A A ] )
PDH (pyruvate dehydrogenase complex) v P D H m a x [ N A D ] ( 1 1 + K i [ N A D H ] [ N A D ] ) ( [ P Y R ] K m P Y R ) ( 1 K m N A D ) ( [ C O A ] K m C O A ) ( 1 + [ P Y R ] K m P Y R ) ( 1 N A D + 1 K m N A D + [ N A D H ] K m N A D H [ N A D ] ) ( 1 + [ C O A ] K m C O A + [ A c C O A ] K m A c C O A )
Pta (phosphotransacetylase) v P t a m a x ( 1 K i A c C O A K m P ) ( [ A c C o A ] [ P ] [ A c P ] [ C o A ] K e q ) ( 1 + [ A c C o A ] K i A c C o A + [ P ] K i P + [ A C P ] K i A C P + [ C o A ] K i C o A + ( [ A c C o A ] [ P ] K i A c C o A K m P ) + ( [ A c P ] [ C o A ] K m A C P K i C o A ) )
Ack (acetate kinase) v A c k m a x ( 1 K m A D P K m A C P ) ( [ A c P ] [ A D P ] [ A C E ] [ A T P ] K e q ) ( 1 + [ A c p ] K m A c P + [ A C E ] K m A C E ) ( 1 + [ A D P ] K m A D P + [ A T P ] K m A T P )
Acs (acyl-coenzyme A synthetase) v A c s m a x [ A C E ] [ N A D P ] ( K m + [ A C E ] ) ( K e q + [ N A D P ] )
Cs (citrate synthase) v C S m a x [ A c C o A ] [ O A A ] ( K d A c C o A K m O A A + K m A c C o A [ O A A ] ) + ( [ A c C o A ] K m O A A ( 1 + [ N A D H ] K i 1 N A D H ) ) + ( [ A c C o A ] [ O A A ] ( 1 + [ N A D H ] K i 2 N D A H ) )
ICDH (isocitrate dehydrogenase) [ I C D H ] K f K m I C I T K d N A D P ( [ I C I T ] [ N A D H ] [ 2 K G ] K e q I C D H [ N A D P ] ) ( 1 [ N A D P ] + [ I C I T ] K m N A D P K m I C I T K d N A D P [ N A D P ] + 1 K d N A D P + [ I C I T ] K m I C I T K d N A D P + [ I C I T ] K d I C I T [ N A D P ]   [ N A D P H ] K m N A D P K m I C I T K m N A D P K e i n h N A D P H + [ N A D P H ] K e k n h 2 K G K m 2 K G K e n h e N A D P H [ N A D P ] + [ 2 K G ] K m N A D P H K m 2 K G K e n h e N A D P H [ N A D P ] + [ 2 K G ] K m 2 K G   [ N A D P H ] K e n h e N A D P H [ N A D P ] + [ 2 K G ] K m N A D P H K m 2 K G K m N A D P H   [ N A D P H ] K e k n N A D P [ N A D P ] )
IcL (isocitrate lyase) v l c l f m a x [ I C I T ] K m I C I T ( 1 + [ I C I T ] K m I C I T + [ S U C ] K m S U C + [ P E P ] K m P E P + [ 2 K G ] K m 2 K G + 1 K l )
MS (malate synthase) v M S m a x   [ G O X ] K m G O X     [ A c C o A ] K m A c C o A v M S m a x   [ M A L ] K m M A L ( 1 + [ G O X ] K m G O X + [ M A L ] K m M A L + ( 1 + [ A c C o A ] K m A c C o A ) )
aKGDH (akg dehydrogenase) v 2 K G D H m a x   [ a K G ] [ C o A ] ( K m N A D   [ a K G ] [ C o A ] [ N A D ] + K m C o A   [ a K G ] + K m 2 K G [ C o A ] + [ a K G ] [ C o A ] + K m 2 K G K z [ a K G ] [ S U C ] [ N A D H ] K 1 2 K G K 1 S U C [ N A D ] K m 2 K G   K z [ S U C ] [ N A D H ] K 1 S U C   [ N A D ] + K m N A D   [ a K G ] [ C o A ] [ N A D H ]   K 1 N A D H [ N A D ] + K m C o A   [ a K G ] [ S U C ]   K 1 S U C )
SDH (succinate dehydrogenase) v S D H 1 v S D H 2 ( [ S U C ] [ F U M ] K e q ) K m S U C v S D H 2 + v S D H 2 [ S U C ] + v S D H 1 [ F U M ] K e q
Fum (fumarase) v F u m 1 v F u m 2 ( [ F U M ] [ M A L ] k F u m   e q ) K m F u m v F u m 1 + v F u m 2 [ F U M ] + V F u m 1 [ M A L ] K e q
Mez (malic enzyme) v M e z m a x   [ M A L ]   [ N A D P ] ( K M A L + [ M A L ] )   ( K e q + [ N A D P ] )
MDH (malate dehydrogenase) v M D H 1 v M D H 2 ( [ M A L ] [ O A A ] K e q ) ( K 1 N A D K m M A L v M D H 2 [ N A D ] + K m M A L   v M D H 2 + K m N A D v M D H 2 [ M A L ] [ N A D ] + v M D H 2 [ M A L ] + K m O A A v M D H 1 [ N A D H ] K e q [ N A D ] + K m N A D H v M D H 1 [ O A A ] K e q [ N A D ] + v M D H 1 [ N A D H ] [ O A A ] K e q [ N A D ] + v M D H 1 K m O A A [ N A D H ] K e q K 1 N A D + v M D H 2 K m N A D [ M A L ] [ O A A ] K 1 O A A [ N A D ] + v M D H 2 [ M A L ] [ N A D H ] K 1 N A D + v M D H 1 [ M A L ] [ N A D H ] [ O A A ] K e q K 1 M A L [ N A D ] + v M D H 2 [ M A L ] [ O A A ] K Ι Ι O A A + v M D H 1 [ N A D H ] [ O A A ] K Ι Ι N A D K e q + K 1 N A D v M D H 2 [ M A L ] [ N A D H ] [ O A A ] K Ι Ι N A D K m O A A K 1 N A D H )
Table A3, describes the kinetic parameters segmentation of the proposed algorithm.
Table A3. Kinetic parameters segmentation.
Table A3. Kinetic parameters segmentation.
KineticsNumber of Segments
v m a x p y k 2
n p k 3
i c d h 2
k i c d h f 2
k i c d h n a p d 3
k i c d h n a p m 2
v m a x i c l 3
Table A4. STD and mean of the simulated results.
Table A4. STD and mean of the simulated results.
MetabolitesExperimental DataThe Model under Study DataSe-PSO EstimationESe-PSO EstimationDE EstimationGA Estimation
G l c 0.05560.12200.10230.09230.10250.1174
G 6 P 3.480.12980.31201.32810.19930.1412
F 6 P 0.60.02140.05320.08720.02350.0221
F D P 0.2721.51862.52571.33352.01251.975
P E P 2.671.50761.83202.03211.84701.9832
P Y R 2.672.82792.93802.72563.01003.002
6 P G 0.8080.01780.07520.20430.01940.0187
R u 5 P 0.1110.02140.06280.08700.02320.0228
X u 5 P 0.1380.02650.09250.09020.02840.0279
S 7 P 0.2760.00470.05240.08020.04820.0480
R 5 P 0.3980.07630.09670.09850.08420.0772
E 4 P 0.0980.27830.05680.06710.02830.0242
MEAN0.96470.52510.68330.68550.61890.6216
STD1.22710.91021.08320.93201.04391.0554
Variance1.50590.82861.17350.86861.08981.1138
N121212121212
Distance model minimization 45.56%29.16%28.94%35.58%35.55%
F test 1.04971.04821.28811.3165
Critical value of F 0.36780.36780.36780.3678
Table A4 describes the STD, MEAN, Variance and F test of the simulated results.

The Parameters

In Table A5 the parameters of the proposed method are stated as follows:
Table A5. The parameters used in the algorithm.
Table A5. The parameters used in the algorithm.
ParametersValues
Inertia weight ω 1
Damping process ω d a m p 0.99
Cognitive learning rate c 1 and c 2 4   w e r e   c 1 = 1.2   a n d   c 2 = 1.2
Random number r 1 and r 2 B e t w e e n   0   a n d   1
Optimal segment10
Bird number B of Se-PSO10
Iteration of Se-PSO30
Iteration of PSO500
Bird step of PSO100
Where ω is the inertia weight, ω   damp is the damping process, c 1   and   c 2 are the cognitive and social scaling parameters, respectively, and r 1   and   r 2 are random numbers drawn from a uniform distribution. The damping process was added and the c 1 = 1.2   and   c 2 = 1.2 were equal due to the trial and errors which were performed [32].

References

  1. Votapka, L.W.; Amaro, R.E. multiscale estimation of binding kinetics using brownian dynamics, molecular dynamics and milestoning. PLoS Comput. Boil. 2015, 11, e1004381. [Google Scholar] [CrossRef] [Green Version]
  2. Jahan, N.; Maeda, K.; Matsuoka, Y.; Sugimoto, Y.; Kurata, H. Development of an accurate kinetic model for the central carbon metabolism of Escherichia coli. Microb. Cell Factories 2016, 15, 112. [Google Scholar] [CrossRef] [Green Version]
  3. Mukkula, A.R.G.; Paulen, R. Model-based design of optimal experiments for nonlinear systems in the context of guaranteed parameter estimation. Comput. Chem. Eng. 2017, 99, 198–213. [Google Scholar] [CrossRef]
  4. Yang, X.-S.; Karamanoglu, M.; Luan, T.; Koziel, S. Mathematical modelling and parameter optimization of pulsating heat pipes. J. Comput. Sci. 2014, 5, 119–125. [Google Scholar] [CrossRef] [Green Version]
  5. Marino, I.P.; Ullner, E.; Zaikin, A.A. Parameter estimation methods for chaotic intercellular networks. PLoS ONE 2013, 8, e79892. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  6. Remli, M.A.; Deris, S.; Mohamad, M.S.; Omatu, S.; Rodríguez, J.M.C. An enhanced scatter search with combined opposition-based learning for parameter estimation in large-scale kinetic models of biochemical systems. Eng. Appl. Artif. Intell. 2017, 62, 164–180. [Google Scholar] [CrossRef] [Green Version]
  7. Chassagnole, C.; Noisommit-Rizzi, N.; Schmid, J.; Mauch, K.; Reuss, M. Dynamic modeling of the central carbon metabolism of Escherichia coli. Biotechnol. Bioeng. 2002, 79, 53–73. [Google Scholar] [CrossRef]
  8. Usuda, Y.; Nishio, Y.; Iwatani, S.; Van Dien, S.J.; Imaizumi, A.; Shimbo, K.; Kageyama, N.; Iwahata, D.; Miyano, H.; Matsui, K. Dynamic modeling of Escherichia coli metabolic and regulatory systems for amino-acid production. J. Biotechnol. 2010, 147, 17–30. [Google Scholar] [CrossRef]
  9. Wright, B.E.; Butler, M.H.; Albe, K.R. Systems analysis of the tricarboxylic acid cycle in Dictyostelium discoideum. I. The basis for model construction. J. Biol. Chem. 1992, 267, 3101–3105. [Google Scholar] [PubMed]
  10. Kadir, T.A.A.; Mannan, A.A.; Kierzek, A.M.; McFadden, J.; Shimizu, K. Modeling and simulation of the main metabolism in Escherichia coli and its several single-gene knockout mutants with experimental verification. Microb. Cell Factories 2010, 9, 88. [Google Scholar] [CrossRef] [Green Version]
  11. Lee, F.C.; Rangaiah, G.; Lee, D.-Y. Modeling and optimization of a multi-product biosynthesis factory for multiple objectives. Metab. Eng. 2010, 12, 251–267. [Google Scholar] [CrossRef] [PubMed]
  12. Gábor, A.; Villaverde, A.F.; Saez-Rodriguez, J. Parameter identifiability analysis and visualization in large-scale kinetic models of biosystems. BMC Syst. Boil. 2017, 11, 54. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  13. Tohsato, Y.; Ikuta, K.; Shionoya, A.; Mazaki, Y.; Ito, M. Parameter optimization and sensitivity analysis for large kinetic models using a real-coded genetic algorithm. Gene 2013, 518, 84–90. [Google Scholar] [CrossRef]
  14. Kunna, M.A.; Kadir, T.A.A.; Jaber, A.S.; Odili, J.B. Large-Scale kinetic parameter identification of metabolic network model of E. coli using PSO. Adv. Biosci. Biotechnol. 2015, 6, 120–130. [Google Scholar] [CrossRef] [Green Version]
  15. Di Maggio, J.; Paulo, C.; Estrada, V.; Perotti, N.; Ricci, J.C.D.; Diaz, M.S. Parameter estimation in kinetic models for large scale biotechnological systems with advanced mathematical programming techniques. Biochem. Eng. J. 2014, 83, 104–115. [Google Scholar] [CrossRef]
  16. Remli, M.A.; Mohamad, M.S.; Deris, S.; A Samah, A.; Omatu, S.; Rodríguez, J.M.C. Cooperative enhanced scatter search with opposition-based learning schemes for parameter estimation in high dimensional kinetic models of biological systems. Expert Syst. Appl. 2019, 116, 131–146. [Google Scholar] [CrossRef]
  17. Sagar, A.; Le Cover, R.; Shoemaker, C.A.; Varner, J.D. Dynamic optimization with particle swarms (DOPS): A meta-heuristic for parameter estimation in biochemical models. BMC Syst. Boil. 2018, 12, 87. [Google Scholar] [CrossRef]
  18. Villaverde, A.F.; Henriques, D.; Smallbone, K.; Bongard, S.; Schmid, J.; Cicin-Sain, D.; Crombach, A.; Saez-Rodriguez, J.; Mauch, K.; Balsa-Canto, E.; et al. Biopredyn-bench: A suite of benchmark problems for dynamic modelling in systems biology. BMC Syst. Biol. 2015, 9, 8. [Google Scholar] [CrossRef] [Green Version]
  19. Egea, J.A.; Rodriguez-Fernandez, M.; Banga, J.R.; Martí, R. Scatter search for chemical and bio-process optimization. J. Glob. Optim. 2006, 37, 481–503. [Google Scholar] [CrossRef] [Green Version]
  20. Rodriguez-Fernandez, M.; Egea, J.A.; Banga, J.R. Novel metaheuristic for parameter estimation in nonlinear dynamic biological systems. BMC Bioinform. 2006, 7, 483. [Google Scholar] [CrossRef] [Green Version]
  21. Villaverde, A.F.; Egea, J.A.; Banga, J.R. A cooperative strategy for parameter estimation in large scale systems biology models. BMC Syst. Boil. 2012, 6, 75. [Google Scholar] [CrossRef] [Green Version]
  22. Ishii, N.; Nakahigashi, K.; Baba, T.; Robert, M.; Soga, T.; Kanai, A.; Hirasawa, T.; Naba, M.; Hirai, K.; Hoque, A.; et al. Multiple high-throughput analyses monitor the response of E. coli to perturbations. Science 2007, 316, 593–597. [Google Scholar] [CrossRef]
  23. Hoque, M.A.; Ushiyama, H.; Tomita, M.; Shimizu, K. Dynamic responses of the intracellular metabolite concentrations of the wild type and pykA mutant Escherichia coli against pulse addition of glucose or NH3 under those limiting continuous cultures. Biochem. Eng. J. 2005, 26, 38–49. [Google Scholar] [CrossRef]
  24. Baker, S.M.; Schallau, K.; Junker, B.H. Comparison of different algorithms for simultaneous estimation of multiple parameters in kinetic metabolic models. J. Integr. Bioinform. 2010, 7, 254–262. [Google Scholar] [CrossRef]
  25. Ghovvati, M.; Khayati, G.; Attar, H.; Vaziri, A. Kinetic parameters estimation of protease production using penalty function method with hybrid genetic algorithm and particle swarm optimization. Biotechnol. Biotechnol. Equip. 2016, 30, 404–410. [Google Scholar] [CrossRef] [Green Version]
  26. Calçada, D.; Rosa, A.C.; Duarte, L.C.; Lopes, V.V. Comparison of GA and PSO performance in parameter estimation of microbial growth models: A case-study using experimental data. In Proceedings of the IEEE Congress on Evolutionary Computation, Barcelona, Spain, 18–23 July 2010; pp. 1–8. [Google Scholar]
  27. Lin, Q.; Liu, S.; Zhu, Q.; Tang, C.; Song, R.; Chen, J.; Coello, C.A.C.; Wong, K.-C.; Zhang, J. Particle swarm optimization with a balanceable fitness estimation for many-objective optimization problems. IEEE Trans. Evol. Comput. 2018, 22, 32–46. [Google Scholar] [CrossRef]
  28. He, J.; Liu, Z.-H. Estimation of stator resistance and rotor flux linkage in SPMSM using CLPSO with opposition-based-learning strategy. J. Control. Sci. Eng. 2016, 2016, 1–7. [Google Scholar] [CrossRef] [Green Version]
  29. Srisukkham, W.; Zhang, L.; Neoh, S.C.; Todryk, S.; Lim, C. Intelligent leukaemia diagnosis with bare-bones PSO based feature optimization. Appl. Soft Comput. 2017, 56, 405–419. [Google Scholar] [CrossRef]
  30. Eberhart, R.; Kennedy, J. A new optimizer using particle swarm theory. In Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 4–6 October 1995; IEEE: New York, NY, USA, 1995; pp. 39–43. [Google Scholar]
  31. Jaber, A.S.; Ahmad, A.Z.; Abdalla, A.N. A new parameters identification of single area power system based LFC using Segmentation Particle Swarm Optimization (SePSO) algorithm. In Proceedings of the 2013 IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC), Kowloon, China, 8–11 December 2013; IEEE: New York, NY, USA, 2013; pp. 1–6. [Google Scholar]
  32. Azrag, M.A.K.; Kadir, T.A.A.; Jaber, A.S. Segment particle swarm optimization adoption for large-scale kinetic parameter identification of Escherichia Coli metabolic network model. IEEE Access 2018, 6, 78622–78639. [Google Scholar] [CrossRef]
  33. Angelova, M.; Pencheva, T. Tuning Genetic algorithm parameters to improve convergence time. Int. J. Chem. Eng. 2011, 2011, 1–7. [Google Scholar] [CrossRef] [Green Version]
Figure 1. Main metabolic model of E. coli.
Figure 1. Main metabolic model of E. coli.
Processes 08 00963 g001
Figure 2. Model simulation based on real experimental data.
Figure 2. Model simulation based on real experimental data.
Processes 08 00963 g002
Table 1. Pseudo-code of Enhanced Segment Particle Swarm Optimization Algorithm (ESe-PSO).
Table 1. Pseudo-code of Enhanced Segment Particle Swarm Optimization Algorithm (ESe-PSO).
Algorithm ESe-PSO Adoption
1. Begin
2. Initialize B, S, D, ω, and ωdamp
3. Initialize v i ,   X i ,   c 1 , c 2 ,   r 1 ,   r 2 , number_segment
4. Segment length = initial value/number_segment
5. Adopt the b e 1 : b e n parameters boundaries with respect to D
6. For j = 1 to the number of the segment
7. Determine initial fitness for segment J
8. Assume Best fitness = initial fitness
9. End for
10. For m data account
11. f i t n e s s = i = 1 R | y s i y e i y e i |
12. End for
13. If f i t n e s s > Best   f i t n e s s
14. For each S
15. iter S = 1, S++
16. Updating the velocity V i towards fitness:
17. v i ( t + 1 ,   j ) = ( ω ω d a m p ) v i ( t , j ) + c 1 r 1 ( p i ( t , j ) x i ( t , j ) ) c 2 r 2 ( G ( t , j ) x ( t , j ) )
18. Update the position X i j towards fitness;
19. X i ( t + 1 ,   j ) = X i ( t ,   j ) + v i ( t + 1 ,   j )
20. End for
21. End if
22. If f i t n e s s Best   f i t n e s s
23. Print G i best of each particles
24. Update the b e 1 : b e n based of   G i best of each kinetic parameters
25. If f i t n e s s > Best   f i t n e s s return step 2 till the iteration is finished or discover high-quality solution
26. End if
27. End if
28. Global point(j) = G i best
29. Next j
30. Optimal segment =   max   ( Global   point ) ± segment   length / 2
31. Repeat algorithm 1 for the new initial values
Table 2. Kinetic parameters boundaries.
Table 2. Kinetic parameters boundaries.
KineticsOriginalLower BoundUpper BoundEstimated Kinetics
v m a x p y k 1.08500.85001.50001.10000
n p k 3.00002.30003.50002.83000
i c d h 24.42123.50024.900024.1020
k i c d h f 289,800289,799289,800289,799.5
k i c d h n a d p d 0.00600.00300.05000.00920
k i c d h n a d p m 0.01700.00600.06000.01920
v m a x i c l 3.83153.3004.30003.64000
Table 3. Comparison of Enhanced Segment Particle Swarm Optimization algorithm (ESe-PSO) algorithm estimations with Segment Particle Swarm Optimization algorithm (Se-PSO), Differential Evolution (DE) and Genetic Algorithm (GA) algorithms.
Table 3. Comparison of Enhanced Segment Particle Swarm Optimization algorithm (ESe-PSO) algorithm estimations with Segment Particle Swarm Optimization algorithm (Se-PSO), Differential Evolution (DE) and Genetic Algorithm (GA) algorithms.
MetabolitesExperimental DataKadir DataSe-PSO EstimationESe-PSO EstimationDE EstimationGA Estimation
G l c 0.05560.122030.10230.09230.102500.11740
G 6 P 3.48000.129890.31201.32810.199300.14120
F 6 P 0.60000.021460.05320.08720.023500.02210
F D P 0.27201.518602.52571.33352.012501.97500
P E P 2.67001.507601.83202.03211.847001.98320
P Y R 2.67002.827902.93802.72563.010003.00200
6 P G 0.80800.017850.07520.20430.019470.01874
R u 5 P 0.11100.021400.06280.08700.023240.02280
X u 5 P 0.13800.026520.09250.09020.028470.02794
S 7 P 0.27600.004730.05240.08020.048270.04803
R 5 P 0.39800.076390.09670.09850.084250.07727
E 4 P 0.09800.278370.05680.06710.028350.02428
Table 4. Objective function of each algorithm over 10 runs.
Table 4. Objective function of each algorithm over 10 runs.
MethodsMeanSTDBestLowerTime-Consuming
ESe-PSO7.035 ×10−52.72 × 10−42.3 × 10−61.58 × 10−419 h
Se-PSO6.03 × 10−43.567 × 10−32.24 × 10−53.52 × 10−319 h
DE4.9185 × 10−22.51213 × 10−18.27 × 10−31.7643 × 10−126 h
GA1.1476 × 10−12.58243 × 10−12.579 × 10−31.4673 × 10−129 h

Share and Cite

MDPI and ACS Style

Kunna, M.A.; Kadir, T.A.A.; Remli, M.A.; Ali, N.M.; Moorthy, K.; Muhammad, N. An Enhanced Segment Particle Swarm Optimization Algorithm for Kinetic Parameters Estimation of the Main Metabolic Model of Escherichia Coli. Processes 2020, 8, 963. https://doi.org/10.3390/pr8080963

AMA Style

Kunna MA, Kadir TAA, Remli MA, Ali NM, Moorthy K, Muhammad N. An Enhanced Segment Particle Swarm Optimization Algorithm for Kinetic Parameters Estimation of the Main Metabolic Model of Escherichia Coli. Processes. 2020; 8(8):963. https://doi.org/10.3390/pr8080963

Chicago/Turabian Style

Kunna, Mohammed Adam, Tuty Asmawaty Abdul Kadir, Muhammad Akmal Remli, Noorlin Mohd Ali, Kohbalan Moorthy, and Noryanti Muhammad. 2020. "An Enhanced Segment Particle Swarm Optimization Algorithm for Kinetic Parameters Estimation of the Main Metabolic Model of Escherichia Coli" Processes 8, no. 8: 963. https://doi.org/10.3390/pr8080963

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop