Skip to main content

Bioprocess Modeling Using Genetic Programming Based on a Double Penalty Strategy

  • Conference paper
  • 1640 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3801))

Abstract

Using genetic programming (GP) integrated with nonlinear parameter estimation we can identify the model for avermectin process. In order to reduce the effect caused by bloating which appears when a GP run stagnates in the later period, a fitness function with a double penalty strategy is proposed. GP with this penalty strategy is less sensitive to the choice of penalty parameters and compromises the fitness and the complexity of an individual, so the method can save considerable amounts of computational effort and find models with better quality. In addition, we combine the mechanism knowledge of the fermentation in GP to increase the quality of population and the convergence speed. Experiments prove that this method outperforms standard GP in reducing computational effort and finding better models more quickly.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shuqing, W.: Bioprocess modeling and computer control. ZheJiang Univ. publishing company (1998)

    Google Scholar 

  2. Wolfgang, B., Francone, F.D., Robert, E.K., Peter, N.: Genetic programming: An Introduction. Morgan Kaufmann, San Francisco (1998)

    MATH  Google Scholar 

  3. Yong, L., Lishan, K.: Nonnumeric parallel algorithm-Genetic Algorithm. Science publishing company, BeiJing (2000)

    Google Scholar 

  4. Malinowski, E.R., Howery, D.G.: Factor Analysis in Chemistry. Wiley, New York (1980)

    MATH  Google Scholar 

  5. Terence, S., James, A.F.: Effects of code growth and parsimony pressure on populations in genetic programming. Evolutionary Computation 6(4), 293–309 (1999)

    Google Scholar 

  6. John, R.K.: Genetic programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  7. Riche, R.L., Knopf-Lenoir, C., Haftka, R.T.: A Segregated Genetic Algorithm for Con-strained structural Optimization. In: Proceedings of the 6th International Conference on GA, San Francisco, USA, pp. 558–565 (1995)

    Google Scholar 

  8. Baker, J.E.: Adaptive Selection Methods for Genetic Algorithms. In: Proceedings of the 1st International Conference on GA, Grefenstette, pp. 110–111 (1985)

    Google Scholar 

  9. Poli, R.: Evolution of graph-like programs with parallel distributed genetic programming. In: Bäck, T. (ed.) Proceedings of the 7th International Conference on Genetic Algorithms, pp. 346–353. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  10. Tomassini, M., Vanneschi, L., Cuendet, J., Fernandez, F.: A new technique for dynamic size populations in genetic programming. Evolutionary Computation, CEC 1, 486–493 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, Y., Lu, J., Sun, Y., Yu, P. (2005). Bioprocess Modeling Using Genetic Programming Based on a Double Penalty Strategy. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_137

Download citation

  • DOI: https://doi.org/10.1007/11596448_137

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30818-8

  • Online ISBN: 978-3-540-31599-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics