Skip to main content

Advertisement

Springer Nature Link
Log in

A pseudo genetic algorithm

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Random individual initialization tends to generate too many eccentric and homogeneous individuals which cause slow and premature convergence. It needs many operations (selection strategy, incest prevention and mutation) to fix, which consume too much computation and lose many good genes. The proposed complementary-parent strategy initializes every other pair of parents with dynamically or statically complementary chromosomes (such as 010101…0101 and 101010…1010). Crossover of every generation is only performed between the offspring from the same parents, during which the parents are completely replaced by their own children. Higher population diversity is got without gene lost at all, by which search ability is enhanced. Incest prevention, selection strategies and mutation are unnecessary and consequently cancelled (so it is named pseudo genetic algorithm). As indicated by the simulation results, the speed of elitist search is accelerated greatly and computation complexity is reduced by half.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  2. Jong D (1975) Analysis of behaviour of a class of genetic adaptive systems. PhD Thesis, Department of Computer and Communication Science, University of Michigan, Ann Arbor

  3. Adler D (1993) Genetic algorithms and simulated annealing: a marriage proposal, neural networks. In: IEEE international conference on 28 March–1 April 1993, 2:1104–1109

  4. Morimoto T, Takeuchi T, Hashimto Y (1993) Growth optimization of plant by means of the hybrid system of genetic algorithm and neural network. In: Proceedings of 1993 international joint conference on neural networks

  5. Srinivas M, Patnaik LM (1994) Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans Syst Man Cybern 24(4):656–667. doi:10.1109/21.286385

    Article  Google Scholar 

  6. Mahfoud SW (1995) Niching methods for genetic algorithms. PhD thesis, University of Illinois

  7. Harik G, Lobo F, Goldberg DE (1997) The compact genetic algorithm, IlliGAL Report 97006. University of Illinois, Illinois Genetic Algorithms Laboratory, Urbana-Champaign

  8. Xu Z, Gao Y (1997) Characteristic analysis and prevention on premature convergence in genetic algorithms. Sci China Ser E Technol Sci 40(2):113–125. doi:10.1007/BF02916943

    Article  MATH  MathSciNet  Google Scholar 

  9. Rudolph G (1994) Convergence analysis of canonicalal genetic algorithms. IEEE Trans Neural Netw 5(1)

  10. Eshelman U, Schaffer JD (1991) Preventing premature convergence in genetic algorithms by preventing incest. In: Proceedings of the fourth international conference on genetic

  11. Goldberg DE (1989) Genetic algorithms in search. Optimization and machine learning. Addison-Wesley, Reading

    MATH  Google Scholar 

  12. Goldberg DE, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. In: Rawlins GJE (ed) Foundatins of genetic algorithms. Morgan Kaufmann, San Mateo, pp 69–93

    Google Scholar 

  13. Tsutsui S, Ghosh A (2003) Effects of adding perturbations to phenotypic parameters in genetic algorithms for searching robust solutions. In: advances in evolutionary computing: theory and applications. Springer, New York

  14. Xinchao Z (2005) A greedy genetic algorithm for unconstrained global optimization. J Syst Sci Complex 18(1):102–110

    MATH  MathSciNet  Google Scholar 

  15. Pankratz G (2005) A grouping genetic algorithm for the pickup and delivery problem with time windows. Spectrum 27(1):21–41. doi:10.1007/s00291-004-0173-7

    Article  MATH  MathSciNet  Google Scholar 

  16. Yokoyama N, Suzuki S (2005) Modified genetic algorithm for constrained trajectory optimization. J Guid Control Dyn 28(1):139–144. doi:10.2514/1.3042

    Article  Google Scholar 

  17. Tu Z, Lu Y (2004) A robust stochastic genetic algorithm (StGA) for global numerical optimization. IEEE Trans Evol Comput 8(5):456–470. doi:10.1109/TEVC.2004.831258

    Article  Google Scholar 

  18. Wei L, Zhao M (2005) A niche hybrid genetic algorithm for global optimization of continuous multimodal functions. Appl Math Comput 160(3):641–649

    MathSciNet  Google Scholar 

  19. Liu D, Cao YD (2006) A chaotic genetic algorithm for fuzzy grid job scheduling. In: International conference on computational-intelligence and security, Guangzhou, People’s Republic of China, Pts 1 and 2, pp 320–323

  20. Tan KC, Wang ML, Peng W (2005) A P2P genetic algorithm environment for the internet. Commun ACM 48(4):113–116. doi:10.1145/1053291.1053297

    Article  Google Scholar 

  21. Zeqing Y, Libing L, Zhihong T, Weiling L, Control Conference (2008). Application of adaptive genetic algorithm in flexible inspection path planning. In: 2008 Chinese control conference (CCC), pp 75–80

  22. Hinterding R, Michalewicz Z, Eiben AE (1997) Adaptation in evolutionary computation: a survey, evolutionary computation. In: IEEE international conference on 13–16 April 1997, pp 65–69

  23. Herrera F, Lozano M, Sánchez AM (2005) Hybrid crossover operators for real-coded genetic algorithms: an experimental study, soft computing—a fusion of foundations. Methodol Appl 9(4):280–298

    MATH  Google Scholar 

  24. Drezner Z (2005) A distance based rule for removing population members in genetic algorithms. 4OR: Q J Oper Res 3(2):109–116

    Article  MATH  MathSciNet  Google Scholar 

  25. Turkcan A, Akturk MS (2003) A problem space genetic algorithm in multiobjective optimization. J Intell Manuf 14(3–4):363–378. doi:10.1023/A:1024605927329

    Article  Google Scholar 

  26. He Y, Chu F, Zhong B (2002) A hierarchical evolutionary algorithm for constructing and training wavelet networks. Neural Comput Appl 10(4):357–366. doi:10.1007/s005210200008

    Article  MATH  Google Scholar 

  27. Sun H, Lam K-Y, Chung S-L et al (2005) Efficient vector quantization using genetic algorithm. Neural Comput Appl 14(3):203–211. doi:10.1007/s00521-004-0455-7

    Article  Google Scholar 

  28. Dracopoulos DC, Jones AJ (1994) Neuro-genetic adaptive attitude control. Neural Comput Appl 2(4):183–204 C45

    Article  Google Scholar 

  29. Paul RJ, Chanev TS (1997) Optimising a complex discrete event simulation model using a genetic algorithm. Neural Comput Appl 6(4):229–237. doi:10.1007/BF01501509

    Article  Google Scholar 

  30. Lee M, Joo S, Kim HS (2004) Realization of emergent behavior in collective autonomous mobile agents using an artificial neural network and a genetic algorithm. Neural Comput Appl 13(3):237–247. doi:10.1007/s00521-004-0410-7

    Article  Google Scholar 

  31. Eshelman LJ, Schaffer JD (1993) Real-coded genetic algorithms and interval-schemata. Found Genet Algorithms 2:187–202

    Google Scholar 

  32. Radcliffe NJ (1990) Genetic neural networks on MIMD computers. PhD thesis, University of Edinburgh, Edinburgh

  33. Ono I, Kobayashi S (1997) A real-coded genetic algorithm for function optimization using unimodal normal distribution crossover. In: Proceedings of 7th international conference on genetic algorithms, pp 246–253

  34. Barrios D, Carrascal A, Manrique D, Ríos J (2003) Cooperative binary-real coded genetic algorithms for generating and adapting artificial neural networks. Neural Comput Appl 12(2):49–60. doi:10.1007/s00521-003-0364-1

    Article  Google Scholar 

  35. Hamming RW (1950) Error detecting and error correcting codes. Bell Syst Tech J 29:147–160

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Communication Engineering, Chongqing University, Chongqing, China

    Qijian Chen & Yuanchang Zhong

  2. College of Software Engineering, Chongqing University, Chongqing, China

    Xiaohong Zhang

Authors
  1. Qijian Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Yuanchang Zhong
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Xiaohong Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Qijian Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, Q., Zhong, Y. & Zhang, X. A pseudo genetic algorithm. Neural Comput & Applic 19, 77–83 (2010). https://doi.org/10.1007/s00521-009-0237-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-009-0237-3

Keywords