Skip to main content

Advertisement

Log in

Improved genetic algorithm inspired by biological evolution

  • Original Paper
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

The process of mutation has been studied extensively in the field of biology and it has been shown that it is one of the major factors that aid the process of evolution. Inspired by this a novel genetic algorithm (GA) is presented here. Various mutation operators such as small mutation, gene mutation and chromosome mutation have been applied in this genetic algorithm. In order to facilitate the implementation of the above-mentioned mutation operators a modified way of representing the variables has been presented. It resembles the way genetic information is coded in living beings. Different mutation operators pose a challenge as regards the determination of the optimal rate of mutation. This problem is overcome by using adaptive mutation operators. The main purpose behind this approach was to improve the efficiency of GAs and to find widely distributed Pareto-optimal solutions. This algorithm was tested on some benchmark test functions and compared with other GAs. It was observed that the introduction of these mutations do improve the genetic algorithms in terms of convergence and the quality of the solutions.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Aguirre H, Tanaka K (2005) Selection, drift, recombination, and mutation in multiobjective evolutionary algorithms on scalable MNK-Landscapes. Evolutionary multi-criterion optimization. 3rd international conference, EMO 2005, Lecture notes in computer science, vol 3410, pp 355–369

  • Bagley JD (1967) The behavior of adaptive systems which employ genetic and correlation algorithms. PhD Thesis, University of Michigan

  • Brizuela CA, Aceves R (2003) Experimental genetic operators analysis for the multi-objective permutation flowshop. volutionary multi-criterion optimization. In: 2nd international conference, EMO 2003, vol 2632, pp 578–592

  • Chan TM, Man KF, Tang KS, Kwong S (2005) A jumping gene algorithm for multiobjective resource management in wideband CDMA systems. Comput J 48:749–768

    Article  Google Scholar 

  • Coello CAC (1993) A micro-genetic algorithm for multiobjective optimization. Lecture Notes in Computer Science

  • Coello CAC, Veldhuizen V et al. (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer, New York

    MATH  Google Scholar 

  • Coello CAC, PulidoD GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization. IEEE Trans Evol Comput 8:256–279

    Article  Google Scholar 

  • Darwin C, Huxely J (1859) Origin of Species. Signet Classics

  • Deb K (1999) Multiobjective genetic algorithms: problem difficulties and construction of test problems. Evol Comput 7:205–230

    Google Scholar 

  • Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, Chichester

    MATH  Google Scholar 

  • Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist nondominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: proceedings of the parallel problem solving from nature VI(PPSN-VI), pp 849–858

  • Fonseca CM, Fleming PJ (1993) Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In: Proceedings of the 5th international conference on genetic algorithms

  • Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley Publishing Company, Reading

    MATH  Google Scholar 

  • Holland JH (1975) Adaptation in natural and artificial systems. MIT Press, Cambridge

    Google Scholar 

  • Horn J, Nafploitis N, Goldberg DE (1994) A niched Paretogenetic algorithm for multi-objective optimization. In: proceedings of the 1st IEEE conference on evolutionary computation

  • Kita H, Yabumoto Y, Mori N, Nishikawa Y (1996) Multi-objective optimization by means of the thermodynamical genetic algorithm. In: Parallel problem solving from nature—PPSN IV. Voigt H-M, Ebeling W, Rechenberg I, Schwefel H-P, (eds) Springer Berlin Heidelberg New York, pp 504–512

  • Knowles J, Corne D (2002) On metrics for comparing nondominated sets. Congress on Evolutionary Computation CEC, 2002 Piscataway

  • Knowles JD, Corne DW (2000) Approximating the nondominated front using the Pareto archived evolution strategy. Evol Comput 8:149–172

    Article  Google Scholar 

  • Knowles J, Thiele L, Zitzler E (2006) A tutorial on the performance assessment of stochastic multiobjective optimizers no. 214. Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich

  • Kursawe F (1991) A variant of evolution strategies for vector optimization. Lecture Notes in Computer Science. In: Schwefel HP, Männer R, (eds) Springer Berlin Heidelberg New York, vol 496. pp 193–197

  • Li WH (1993) Molecular evolution. Sinauer, Sunderland, MA

    Google Scholar 

  • Nei M (1986) Molecular evolutionary genetics. Columbia University Press, New York

    Google Scholar 

  • Schott JR (1995) Fault tolerant design using single and multicriteria genetic algorithm optimization. M.S. Thesis, Dept. Aeronautics and Astronautics, MIT, Cambridge

  • Srinivas N, Deb K (1994) Multi-objective function optimization using non-dominated sorting genetic algorithms. Evol Comput J 3:221–248

    Google Scholar 

  • Tan KC, Lee TH, Khor EF (2001) Evolutionary algorithm with dynamic population size and local exploration for multiobjective optimization. IEEE Trans Evol Comput 5:565–586

    Article  Google Scholar 

  • Van Veldhuizen DA, Lamont GB (1998) Multiobjective evolutionary algorithm research: A history and analysis. Dept. Elec. Comput. Eng., Graduate School of Eng., Air Force Inst. Technol., Tech. Rep-98–03

  • Van Veldhuizen DA, Lamont GB (2000) On measuring multiobjective evolutionary algorithm performance. In: Congress on evolutionary computation (CEC 2000), vol 1, pp 204–211

  • Zitzler E, Thiele L (1998) Multiobjective optimization using evolutionary algorithms-A comparitive study. Parallel Probl Solv Nat 5:292–301

    Article  Google Scholar 

  • Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3:257–271

    Article  Google Scholar 

  • Zitzler E, Deb K, Thiele L (2000a) Multiobjective genetic algorithms: problem difficulties and construction of test problems. Evol Comput 7:205–230

    Google Scholar 

  • Zitzler E, Deb K, Thiele L (2000b) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8:173–195

    Article  Google Scholar 

  • Zitzler E, Thiele L, Laumanns M, Fonseca CM, Fonseca VG (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7:117–132

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to P. Bauer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kumar, P., Gospodaric, D. & Bauer, P. Improved genetic algorithm inspired by biological evolution. Soft Comput 11, 923–941 (2007). https://doi.org/10.1007/s00500-006-0143-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-006-0143-x

Keywords

Navigation