280
Views
6
CrossRef citations to date
0
Altmetric
Original Articles

Solution of an inverse adsorption problem with an epidemic genetic algorithm and the generalized extremal optimization algorithm

, , &
Pages 289-302 | Received 16 Apr 2007, Accepted 30 Nov 2007, Published online: 24 Mar 2009

Abstract

In the present work two recently developed stochastic methods, the epidemic genetic algorithm and the generalized extremal optimization algorithm are used for the solution of an inverse mass transfer problem, which is implicitly formulated as an optimization problem, for the estimation of parameters associated with the adsorption of biomolecules in resin beds. The estimates obtained with both methods present good accuracy, even in the presence of noisy data, provided that the model and experiment used are sensitive to the parameters being estimated. With Thomas' model for the direct mass transfer problem and real experimental data for lisozyme in adsorption columns, it is possible to estimate the maximum adsorption capacity in Langmuir's adsorption isotherm.

1. Introduction

Due to the relevant applications in the food and pharmaceutical industries, there is a growing demand for the formulation and solution of direct and inverse mass transfer problems Citation1–5. A high demand for purification processes for increasingly complex substances has been observed in recent years, with one of the most promising alternatives being the simulated moving bed (SMB) chromatography. For a full understanding of the operation and optimization Citation6 of SMBs, and a possible scale-up to industrial production, an accurate knowledge of mass transfer mechanisms and their dependence on the physico-chemical and process parameters involved is required. The first step in that direction consists of the characterization of adsorption columns Citation7.

Kowalczyk et al. Citation8 estimated the pore-size distribution function that is used as a quantitative characteristic of the porous structure of solid adsorbents with respect to their heterogeneity, and Kowalczyk et al. Citation9 used a simple adsorption genetic algorithm (GA) for the estimation of parameters in a equation that models the adsorption process in a homogeneous micropore system.

The estimation of adsorption parameters for chromatography systems is a very important step in the column characterization used in the design of continuous separation processes based on the adsorption phenomenon, such as in simulated moving beds. For that purpose Forssén et al. Citation10 and Câmara et al. Citation11 used the least squares approach, the former having calculated the Jacobian matrix with numerical differentiation with complex variables. Vasconcellos et al. Citation12 used GAs. Lage et al. Citation13 have also used GA and a hybridization of GA with the Levenberg-Marquardt method (GA-LM), while Lage et al. Citation14 applied artificial neural networks (ANNs) developed for the solution of the inverse mass transfer problem, and Lage et al. Citation15 used a hybridization of ANNs with the Levenberg-Marquardt method (LM).

Yu et al. Citation16 and Ziyang et al. Citation17 have estimated adsorption equilibrium constants and kinetic parameters using GA. James et al. Citation18 estimated adsorption isotherms coefficients with the conjugate gradient method, and Zhang et al. Citation19 used a variation of GA for the same purpose.

In the present work, two stochastic methods are applied for the estimation of adsorption isotherm coefficients: (i) the generalized extremal optimization (GEO) Citation20; and (ii) the epidemic genetic algorithm (EGA) Citation21.

For the solution of the direct problem Thomas' model is used, which provides accurate results when the effects of axial dispersion are negligible in comparison with other mass transfer mechanisms Citation7, Citation22Citation23.

2. Mathematical formulation and solution of the direct problem

A mobile liquid phase composed by a diluted solution of the adsorbate of interest, for example a biomolecule, percolates through a resin bed, the solid fixed phase. The adsorbate is transferred from the bulk of the solution to the vicinity of the resin particles, i.e. a mass transfer mechanism through the liquid film, and then it diffuses to the interior of the particle pores being then adsorbed by the solid matrix.

The mathematical model for the separation chromatographic process is based on the mass balance for the two phases; one for the mobile phase that flows through the macroscale porous fixed resin bed, and the other for the resin particles involving the microscale porous solid matrix Citation24.

For the particular case in which the axial dispersion may be neglected, and the adsorbate inflow to the column of resins is constant, with concentration C0, the adsorption problem described here has an analytical solution Citation25–27, which was first derived by Thomas Citation28. According to this solution, the adsorbate concentration in the mobile liquid phase at the exit of the adsorption column, C, as a function of time, t, i.e. the breakthrough curve, is given by (1) where (2) (3) (4) Q is the volumetric flow rate, h is the total length of the adsorption column, Ac is the cross section of the column, kd is the dissociation rate constant defined as (5) k1 is the adsorption rate constant, k2 is the desorption rate constant and qm is the maximum adsorbate concentration that the adsorbent may adsorb (maximum adsorption capacity), according to the Langmuir adsorption isotherm, (6) The function J in Equation (1) corresponds to (7) where I0 is the modified Bessel function of the first kind and order zero, which may be approximated by an asymptotic series whose two first terms are given by (8) When the geometry, initial condition, boundary conditions, physico-chemical and process parameters are known, we are able to calculate the concentration of the adsorbate at the exit of the column, i.e. C(h,t). This is the direct problem, i.e. the determination of the breakthrough curve.

3. Mathematical formulation and solution of the inverse problem

Here, we are interested in the estimation of the coefficients in the adsorption isotherm given by Equation (6) using measured values of the adsorbate concentration at the exit of the column, i.e. Cmeasi = Cmeas(ti) with i = 1,2,…,Nd, where Nd represents the total number of experimental data available.

According to the sensitivity analysis performed by Folly et al. Citation7 we may try to estimate the vector of unknowns (9) but difficulties may arise due to low values of the sensitivity coefficients related to the parameter kd, and that behaviour was in fact observed by Lage et al. Citation15.

In the present work besides the estimation of we will also look into the estimation of (10) fixing the value of kd, and also into the estimation of (11) fixing the value of qm.

As the number of experimental data available, Nd, will be much larger than the number of unknowns considered, Nu = 1 or 2, we formulate the inverse problem implicitly as an optimization problem in which we seek to minimize the cost function given by the summation of the squared residues between the calculated and measured adsorbate concentrations at the exit of the adsorption column, i.e. Ccalci and Cmeasi, respectively, with i = 1,2,…,Nd, (12) In order to find the value of for which S is minimum, we have used two recently proposed stochastic methods: (i) GEO Citation20; and (ii) EGA Citation21. Both the methods will be described next.

4. The generalized extremal optimization algorithm

GEO has been proposed and implemented recently Citation20, and was devised to be applied in complex optimization problems. Based on the Back-Sneppen simplified model of evolution Citation29, it has been applied successfully to design optimization problems Citation30, Citation31 as well as to an inverse radiative transfer problem Citation32.

GEO makes no use of derivatives requiring only the solution of the direct problem given by Equations (1–4). The main steps of the canonical GEO algorithm are shown in .

Figure 1. The canonical GEO algorithm.

Figure 1. The canonical GEO algorithm.

A very attractive feature of GEO is that it has only one free parameter to adjust, τ, which may be considered an advantage when compared to other stochastic methods that have a larger number of parameters to be set.

In GEO, a string of L bits, which encodes the Nu unknowns, is considered a population of species, i.e. each bit represents a species. Each bit is associated to a fitness number that is proportional to the gain, or loss, the cost function value has in flipping that particular bit. All bits are then ranked from k = 1, for the least adapted bit, to k = L for the best adapted. A bit is then mutated according to the probability distribution , where k is the rank of a selected bit candidate to mutate. Making all bits have the same probability to mutate, whereas for only the worst adapted bit will mutate.

In practice, it has been observed that the best value of τ, i.e. the one that yields the best performance of the algorithm for a given application, usually lies in the range (0.75,3.0). A detailed description of GEO can be found in Sousa et al. Citation20.

5. The epidemic genetic algorithm

Simple GAs operate on a fixed-sized population of fixed-length individuals, and in general the individuals are represented by a binary string that encodes the variables of the problem that the algorithm is trying to minimize.

In the present work, each individual is composed by the unknowns of the inverse problem, which are given by Equations (9–11), and in fact is represented by a real-valued string.

Simple GAs use basically three operators: selection, crossover and mutation. The selection operator identifies the fittest individuals of a given population to serve as parents of the next generation. The fitness value of each individual is related to the value of the cost function given by Equation (12). The selection operator ensures that the best fit individuals have a higher probability to be selected to reproduce and form a new generation.

The crossover operator randomly chooses a pair of individuals among those previously selected to breed and exchanges information between them.

The mutation operator is usually considered a secondary operator. Its main function is to restore diversity that may be lost from the repeated application of the selection and crossover operators. This operator simply takes one string from the population and randomly alters some value within it. Following the example of nature, the probability of applying the mutation operator is very low compared to the probability of applying the crossover operator.

In the present work, a fourth operator is applied, the epidemical strategy Citation21, leading to EGA. This operator is activated when a prescribed number of generations are reached without improvement of the best individual. Then, all the population is affected by a plague, and only those that have the best fit, say the top 10% individuals better fitted, survive. The remaining individuals die and are replaced by new individuals with new genetic variability, such as immigrants arriving in order to evolve the population. Two parameters need to be chosen: one determines when the strategy will be activated, i.e. the number of generations without improvement of the fitness value of the best individual, Ne, and the other determines the fraction of the population that will survive the plague, fe.

Slow convergence is a particular problem for the stochastic optimization schemes, the same observation is valid to the GA. Alternative GA techniques have been designed to improve the convergence performance. Another challenge is to design a GA for dealing with multimodal function optimization. For attending to such features some genetic operators were proposed such as: micro-GA Citation33 and niching Citation34. A niche is a particular sub-domain of the entire search space, where each niche has different nuances on each other. This is a natural feature to maintain the genotype diversity in a population Citation35–37, under insulation these niches are a mechanism for the speciation. Goldberg and Richardson Citation34 have introduced the method of sharing functions–now the method is known as sharing, and it is directly applicable to the multimodal function optimization Citation36. Sharing is a natural algorithm to implement niching Citation38.

Another procedure to preserve the diversity in the GA population is the re-initialization. Mahfoud Citation36 has reported that Goldberg Citation39 has investigated such ideas, but re-initialization is not treated as a new GA operator. Micro-genetic algorithms are GAs with small populations with re-initialization. Krishnakumar's Citation33 micro-GA approach uses a population with five individuals, driven by elitism. He compared his micro-GA with standard GA (SGA), resulting in a faster and better solution to a engineering control problem. Other applications of micro-GA have been presented by Liu and Han Citation37. We pointed out that Chakraborti et al. Citation40 addressed a solution, an important and difficult real-world problem, where it was shown to be of little additional advantage over the simple GA, when the objective function is stationary. Micro-GA deals with selection and crossover GA operators, while mutation is usually omitted Citation36, Citation37. On the other hand, EGA employs all standard GA operators, and also the typical population size of the SGA, but it introduces the epidemic strategy.

An interesting issue would be a comparison among the diversity preservation strategies (niching, micro-GA, EGA, for example). This will be the focus of a future work. Here, the goal is just the performance comparison between GEO and EGA.

6. Results and discussion

Because of the availability of real experimental data, we have chosen the system investigated by Chase Citation26 for the substance lisozyme as our test case. presents the process and physico-chemical parameters used.

Table 1. Process and physico-chemical parameters for Chase's experiment with lisozyme 26.

The values of k1, kd and qm shown in were obtained using a batch experiment and considering a Langmuir adsorption isotherm.

From the sensitivity analysis performed by Folly et al. Citation7 one concludes that using Thomas' model and the experimental data obtained by Chase Citation26 for lisozyme it is not possible to estimate k1. Therefore, in all computations, the results of which will be presented next, a fixed value for this parameter has been considered, i.e. the one shown in .

and show the estimates obtained for the vector of unknowns , see Equation (9), for lisozyme, using GEO and EGA, respectively, and Chase's experimental data Citation26. Each table shows the results obtained for 10 different runs of each algorithm, as well as the average and the standard deviation for each unknown. It also shows the value of a measure of the dispersion of the estimates given by (13)

Table 2. Estimates for kd and qm for lisozyme using GEO with τ = 1.25 and Chase's experimental data 26. d = 0.11514 (Equation (13)).

Table 3. Estimates for kd and qm for lisozyme using EGA with an initial population of 100 individuals, Chase's experimental data 26 and ne = 3 and fe = 0.1. d = 0.047396 (Equation (13)).

and show graphically the dispersion of the results obtained with the stochastic methods GEO and EGA, respectively. Observe that the scales used in the two figures are different.

Figure 2. Dispersion of the results obtained with GEO.

Figure 2. Dispersion of the results obtained with GEO.

Figure 3. Dispersion of the results obtained with EGA.

Figure 3. Dispersion of the results obtained with EGA.

shows Chase's experimental data Citation26 and the breakthrough curves calculated using the average values obtained for qm and kd, shown in and , using GEO and EGA, respectively.

Figure 4. Chase's experimental data Citation26 and calculated breakthrough curves using the average of the estimated values for qm and kd with GEO and EGA ( and ).

Figure 4. Chase's experimental data Citation26 and calculated breakthrough curves using the average of the estimated values for qm and kd with GEO and EGA (Tables 2 and 3).

From the results presented we conclude that the low sensitivity to the parameter kd may be affecting negatively the estimation of qm when the two parameters are estimated simultaneously.

We may also conclude that with the control parameters chosen for GEO and EGA the latter presents a lower dispersion of the estimates. This fact is confirmed by the value of the measure d, given by Equation (13), shown in and .

We have then fixed the value of qm as 14 mg mL−1 and have estimated kd using both GEO and EGA. The results obtained after 10 runs of both algorithms are shown in .

Table 4. Estimated values for kd, being qm fixed at 14 mg mL−1, after 10 runs of GEO and EGA.

Even though the dispersion of the estimates is smaller with EGA we observe from and that the estimated average value for kd obtained with GEO is closer to the experimental value shown in . Nonetheless, as mentioned before, due to the low value of the sensitivity coefficient related to this parameter the estimates may not be accurate.

shows Chase's experimental data and the breakthrough curves calculated using the values for qm and kd shown in .

Figure 5. Chase's experimental data Citation26 and calculated breakthrough curves using the average estimated values for kd with GEO and EGA being qm fixed at 14 mg mL−1 ().

Figure 5. Chase's experimental data Citation26 and calculated breakthrough curves using the average estimated values for kd with GEO and EGA being qm fixed at 14 mg mL−1 (Table 4).

Finally, we have varied the value of kd in the range from 0.015 mg mL−1 up to 0.035 mg mL−1, and for each fixed value of kd we have estimated qm using both GEO and EGA. The results obtained after 10 runs of both algorithms are shown in and .

Table 5. Estimated values for qm, being kd fixed, after 10 runs of GEO.

Table 6. Estimated values for qm, being kd fixed, after 10 runs of EGA.

and show Chase's experimental data Citation26 and the calculated breakthrough curves for lisozyme with the fixed value of kd and the estimated values of qm with GEO and EGA, respectively.

Figure 6. Chase's experimental data Citation26 and calculated breakthrough curves using the fixed value of kd and the average estimated values for qm with GEO ().

Figure 6. Chase's experimental data Citation26 and calculated breakthrough curves using the fixed value of kd and the average estimated values for qm with GEO (Table 5).

Figure 7. Chase's experimental data Citation26 and calculated breakthrough curves using the fixed value of kd and the average estimated values for qm with EGA ().

Figure 7. Chase's experimental data Citation26 and calculated breakthrough curves using the fixed value of kd and the average estimated values for qm with EGA (Table 6).

From the results shown in and we observe a good agreement with the experimental value of qm shown in and again it seems that the dispersion of the estimates is smaller with EGA.

From and it is observed that kd, as expected, seems to have a negligible effect on the breakthrough curves.

All results shown for GEO were obtained using 5000 evaluations of the cost function. The dispersion of the estimates may become smaller if a larger number of function evaluations is considered. Of course a higher amount of CPU time will be required. This subject must be further investigated.

Due to the simplicity of the solution obtained for the direct problem with Thomas' model, only 10 generations were required to obtain the results presented before using EGA. Tests were performed with a total of 100 or 1000 generations, nonetheless no improvement was observed in the value of the cost function.

Concerning the accuracy of the solutions found by GEO and EGA when compared to the experimental data, for the results with fixed kd, both algorithms presented similar average results, with the EGA ones presenting a lower dispersion. On the other hand, when estimating kd and qm simultaneously, the EGA had clearly a better performance than GEO.

7. Conclusions

The application of two stochastic methods, EGA and GEO yielded good estimates for the maximum adsorption capacity, one parameter in Langmuir's adsorption isotherm, for a system with lisozyme in a diluted solution being adsorbed in resin beds.

It was observed that EGA tends to provide estimates with a smaller dispersion when compared to GEO. Nonetheless this conclusion cannot yet be generalized. A small number of function evaluations was considered for GEO. With a larger number of functions evaluations a reduction in the dispersion may occur.

The results obtained so far are very encouraging and the application of the recently developed stochastic methods in the solution of inverse mass transfer problems deserves further investigation.

Acknowledgements

The authors acknowledge the financial support provided by CNPq, Conselho Nacional de Desnvolvimento Científico e Tecnológico, and FAPERJ, Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro.

References

  • Guiochon, G, 2002. Preparative liquid chromatography (Review), J. Chromat. 965 (2002), pp. 129–161.
  • Silva, FRC, and Santana, CC, 2000. Adsorption of inulinases in ion exchange columns, Appl. Biochem. Biotech. 84–86 (2000), pp. 1063–1078.
  • Denisov, AM, 2000. Inverse problems of absorption dynamics Minisymposium on Inverse Problems in Medicine. Santos, Brazil: Engineering and Geophysics, XXIII Brazilian Congress on Applied and Computational Mathematics; 2000. pp. 24–32.
  • Vasconcellos, JF, Silva Neto, AJ, and Santana, CC, 2003. An inverse mass transfer problem in solid-liquid adsorption systems, Inv. Prob. Eng. 11 (2003), pp. 391–408.
  • Câmara, LDT, Santana, CC, and Neto, AJSilva, 2007. Kinetic modeling of properties adsorption with a methodology of error analysis., J. Separat. Sci. 30 (2007), pp. 688–692.
  • Paredes, G, and Mazzotti, M, 2007. Optimization of simulated moving bed and column chromatography for a plasmid DNA purification step and for a chiral separation, J. Chromat. A 1142 (2007), pp. 56–68.
  • Folly, FM, Neto, AJSilva, and Santana, CC, 2005. An inverse mass transfer problem for the characterization of simulated moving beds adsorption columns, 5th International Conference on Inverse Problems in Engineering: Theory and Practice. UK: Cambridge; 2005.
  • Kowalczyk, P, Terzyk, AP, Gauden, PA, Leboda, R, Szmechtig-Gauden, E, Rychlicki, G, Ryu, Z, and Rong, H, 2003. Estimation of the pore-size distribution function from the nitrogen adsorption isotherm. Comparison of density functional theory and the method of Do and co-workers, Carbon 41 (2003), pp. 1113–1125.
  • Kowalczyk, P, Terzyk, AP, Gauden, PA, and Leboda, R, 2001. The characterization of microporous activated carbons utilizing a Simple Adsorption Genetic Algorithm (SAGA) (Letter to the editor), J. Colloid Inter. Sci. 239 (2001), pp. 591–594.
  • Forssén, P, Arnell, R, and Fornstedt, T, 2006. An improved algorithm for solving inverse problems in liquid chromatography, Comp. Chem. Eng. 30 (2006), pp. 1381–1391.
  • Câmara, LDT, Santana, CC, and Neto, AJSilva, 2006. Direct and inverse modeling of enzymes adsorption kinetics in macro-porous adsorbents, 14th Inverse Problems in Engineering Seminar. USA: Ames; 2006.
  • Vasconcellos, JFV, Neto, AJSilva, Santanta, CC, and Soeiro, FJCP, 2002. Parameter estimation in adsorption columns with a stochastic global optimization method, 4th International Conference on Inverse Problems in Engineering: Theory and Practice. Vol. II. 2002. pp. 227–234, Angra dos Reis, Brazil, 2002.
  • Lage, LF, Cuco, APC, Folly, FM, Soeiro, FJCP, and Neto, AJSilva, Stochastic and hybrid methods for the solution of an inverse mass transfer problem. Presented at III European Conference on Computational Mechanics. Lisbon, Portugal, 2006.
  • Lage, LF, Cuco, APC, Soeiro, FJCP, and Neto, AJSilva, 2006. Characterization of adsorption columns with Thomas' model and artificial neural networks. Recife, Brazil: IV Brazilian National Congress of Mechanical Engineering; 2006.
  • Lage, LF, Cuco, APC, Neto, AJSilva, Folly, FM, and Soeiro, FJCP, 2006. Solution of an inverse mass transfer problem with a hybridization of artificial neural networks and Levenberg-Marquardt method, 11th Brazilian Congress of Thermal Sciences and Engineering. Curitiba, Brazil. 2006.
  • Yu, W, Hidajat, K, and Ray, AK, 2004. Determination of adsorption and kinetic parameters for methyl acetate esterification and hydrolysis reaction catalyzed by Amberlyst 15, Appl. Cataly. A: Gen. 260 (2004), pp. 191–205.
  • Ziyang, Z, Hidajat, K, and Ray, AK, 2001. Determination of adsorption and kinetic parameters for methyl tert-butyl ether synthesis from tert-butyl alcohol and methanol, J. Cataly. 200 (2001), pp. 209–221.
  • James, J, Sepúlveda, M, Charton, F, Quiñones, I, and Guiochon, G, 1999. Determination of binary competitive equilibrium isotherms from the individual chromatographic band profiles, Chem. Eng. Sci. 54 (1999), pp. 1677–1696.
  • Zhang, Y, Hidajat, K, and Ray, AK, 2006. Determination of competitive adsorption isotherm parameters of pindolol enantiometers on α1-acid glycoprotein chiral stationary phase, J. Chromat. A 1131 (2006), pp. 176–184.
  • Sousa, FL, Ramos, FM, Paglione, P, and Girardi, RM, 2003. New stochastic algorithm for design optimization, AIAA J. 41 (2003), pp. 1808–1818.
  • Chiwiacowski, LD, and Campos Velho, HF, 2003. Different approaches for the solution of a backward heat conduction problem, Inv. Prob. Eng. 11 (2003), pp. 471–494.
  • Felinger, A, Cavazzini, A, and Guiochon, G, 2003. Numerical determination of the competitive isotherm of enantiometers, J. Chromat. A 986 (2003), pp. 207–225.
  • Hao, W, and Wang, J, 2005. Evaluation of nonlinear chromatographic performance by frontal analysis using a single multi-plate mathematical model, J. Chromat. A 1063 (2005), pp. 47–56.
  • Guiochon, G, and Lin, B, 2003. Modeling for Preparative Chromatography. Great Britain: Academic Press; 2003.
  • Blanch, HW, and Clark, DS, 1997. Biochemical Engineering. New York: Marcel Dekker; 1997.
  • Chase, HA, 1984. Prediction of the performance of preparative affinity chromatography, J. Chromat. 297 (1984), pp. 179–202.
  • Rice, GR, and Do, DD, 1994. Applied Mathematics and Modeling for Chemical Engineers. New York: John Wiley & Sons; 1994.
  • Thomas, H, 1944. Heterogeneous ion exchange in flowing system, J. Am. Chem. Soc. 66 (1944), pp. 1664–1668.
  • Bak, P, and Sneppen, K, 1993. Punctuated equilibrium and criticality in a simple model of evolution, Phys. Rev. Lett. 71 (1993), pp. 4083–4086.
  • Vlassov, VV, de Sousa, FL, and Takahashi, WK, 2006. Comprehensive optimization of a heat pipe radiator assembly filled with ammonia or acetone, Int. J. Heat Mass Tran. 49 (2006), pp. 4584–4595.
  • Vlassov, VV, Cuco, APC, Sousa, FL de, and Neto, AJSilva, Presented at Design optimization of two-stage radiator with variable emittance: Analysis of concept feasibility, 11th Brazilian Congress of Thermal Sciences and Engineering. Curitiba, Brazil, 2006.
  • Sousa, FL, Soeiro, FJCP, Neto, AJSilva, and Ramos, FM, 2007. Application of the generalized extremal optimization algorithm to an inverse radiative transfer problem, Inv. Prob. Sci. Eng. 15 (2007), pp. 699–714.
  • Krishnakumar, K, 1989. Micro-Genetic Algorithms for Stationary and Non-Stationary Function Optimization, Intell. Contr. Adap. Syst., SPIE 1196 (1989), SPIE, Bellingham, USA.
  • Goldberg, DE, and Richardson, J, 1987. "Genetic algorithms with sharing for multimodal function optimization". In: Grefenstette, JJ, ed. Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms. USA: Cambridge; 1987. pp. 41–49.
  • Melanie, MM, 1998. An Introduction to Genetic Algorithms. Cambridge, USA: MIT Press; 1998.
  • Mahfoud, SW, 1995. Niching Methods for Genetic Algorithms. USA: Computer Science Thesis, University of Illinois at Urbana-Champaign; 1995.
  • Liu, GR, and Han, X, 2003. Computational Inverse Techniques in Nondestructive Evaluation. Florida, USA: CRC Press; 2003.
  • Horn, J, 1997. The Nature of Niching:Genetic Algorithms and the Evolution of Optimal, Cooperative Populations. USA: Computer Science Thesis, University of Illinois at Urbana-Champaign; 1997.
  • Goldberg, DE, Sizing populations for serial and parallel genetic algorithms.. Presented at Proceedings of the third International Conference on Genetic Algorithms. 1989.
  • Chakraborti, N, Deb, K, and Jha, A, 2000. A genetic algorithm based heat transfer analysis of a bloom re-heating furnace, Steel Res. 71 (2000), pp. 396–402.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.