Skip to main content

An Approach to Codification Power on the Behavior of Genetic Algorithms

  • Conference paper
  • First Online:
Intelligent Computing Systems (ISICS 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 597))

Included in the following conference series:

  • 435 Accesses

Abstract

Genetics Algorithms (GAs) are based on the principles of Darwins evolution which are applied to the minimization complex function successfully. Codification is a very important issue when GAs are designed to dealing with a combinatorial problem. An effective crossed binary method is developed. The GAs have the advantages of no special demand for initial values of decision variables, lower computer storage, and less CPU time for computation. Better results are obtained in comparison the results of traditional Genetic Algorithms. The effectiveness of GAs with crossed binary coding in minimizing the complex function is demonstrated.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

References

  1. Wang, C., Quan, H., Xu, X.: Optimal design of multiproduct batch chemical process using genetic algorithm. Ind. Eng. Chem. Res. 35(10), 3560–3566 (1996)

    Article  Google Scholar 

  2. El Hamzaoui, Y., Hernandez, J.A., Cruz-Chavez, M.A., Bassam, A. Search for Optimal Design of Multiproduct Batch Plants under Uncertain Demand using Gaussian Process Modeling Solved by Heuristics Methods. Chem. Prod. Process Model. 5(1) (2010)

    Google Scholar 

  3. Patel, A.N., Mah, R.S.H., Karimi, I.A.: Preliminary design of multiproduct non-continuous plants using simulating annealing. Comput. Chem. Eng. 15, 451 (1991)

    Article  Google Scholar 

  4. Çelebi, M.: A new approach for the genetic algorithm. J. Stat. Comput. Simul. 79(3), 275–297 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press Inc., Ann Arbor (1975)

    Google Scholar 

  6. Goldberg, D.E.: Genetic Algorithms in Search Optimization and Machine Learning. Addison Wesley Publishing Company Inc., Chicago (1989)

    MATH  Google Scholar 

  7. Frantz, D.R.: Non-Linearities in Genetic Adaptive Search. Academic Press Inc., San Diego (1994)

    Google Scholar 

  8. Viennet, R.: Nouvel outil de planification experimentale pour l’optimisation multicritere des procedes. These de doctorat, INP Lorraine, France (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Y.El. Hamzaoui .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Hamzaoui, Y., Rodriguez, J., Puga, S., Escalante Soberanis, M., Bassam, A. (2016). An Approach to Codification Power on the Behavior of Genetic Algorithms. In: Martin-Gonzalez, A., Uc-Cetina, V. (eds) Intelligent Computing Systems. ISICS 2016. Communications in Computer and Information Science, vol 597. Springer, Cham. https://doi.org/10.1007/978-3-319-30447-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30447-2_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30446-5

  • Online ISBN: 978-3-319-30447-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics