Skip to main content

Advertisement

SpringerLink
Log in

An improved genetic algorithm with conditional genetic operators and its application to set-covering problem

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

Abstract

The genetic algorithm (GA) is a popular, biologically inspired optimization method. However, in the GA there is no rule of thumb to design the GA operators and select GA parameters. Instead, trial-and-error has to be applied. In this paper we present an improved genetic algorithm in which crossover and mutation are performed conditionally instead of probability. Because there are no crossover rate and mutation rate to be selected, the proposed improved GA can be more easily applied to a problem than the conventional genetic algorithms. The proposed improved genetic algorithm is applied to solve the set-covering problem. Experimental studies show that the improved GA produces better results over the conventional one and other methods.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41:1069–1072

    Article  Google Scholar 

  • Caldas LG, Norford LK (2002) A design optimization tool based on a genetic algorithm. Autom Construct 11:173–184

    Article  Google Scholar 

  • Caldero NM, Flores M (1996) Solving combinatorial problems through tabu search. Computing Engineer Final Project, Departamento de Ingeniermà Informàtica, Universidad de Santiago de Chile (in Spanish)

  • De Jong KA (1975) An analysis of the behaviour of a class of genetic adaptive systems. PhD thesis, University of Michigan

  • Duclos F (1998) Parallel hybrid algorithms to solve the SCP. Computing Engineer Final Project, Departamento de Ingeniermà Informàtica, Universidad de Santiago de Chile

  • Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, San Francisco

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  • Haupt RL, Haupt SE (1998) Practical genetic algorithms. Wiley Interscience, New York

    MATH  Google Scholar 

  • Holland JH (1975) Adaption in natural and artificial system. MIT Press, Cambridge

    Google Scholar 

  • Hwang SF, He RS (2006) Improved real-parameter genetic algorithm with simulated annealing for engineering problems. Adv Eng Softw 37:406–418

    Article  Google Scholar 

  • Jog P, Suh JY, Van Gucht D (1989). The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem. In: Schaffer JD (eds). Proceedings of the 3rd international conference on genetic algorithms. Morgan Kaufmann, Los Altos, pp. 110–115

    Google Scholar 

  • van Laarhoven PJM, Aarts EHL (1988) Simulated annealing: theory and applications. Kluwer, Dordrecht

    Google Scholar 

  • Satoh H, Ono I, Kobayashi S (1997) A new generation alternation model of genetic algorithms and its assessment. J Japanese Soc Artif Intell 22:734–744

    Google Scholar 

  • Sawai H, Kizu S, Endo T (1998) Performance comparison of parameter-free genetic algorithm with steady-state genetic algorithm. IEICE D-II, J81-D-II:1455–1459

  • Schmitt LJ, Amini MM (1998) Performance characteristics of alternative genetic algorithm approaches to the traveling salesman problem using path representation: an empirical study. Eur J Oper Res 108:551–570

    Article  MATH  Google Scholar 

  • Solar M, Parada V, Urrutia R (2002) A parallel genetic algorithm to solve the set-covering problem. Comput Oper Res 29:1221–1235

    Article  MATH  MathSciNet  Google Scholar 

  • Whiley D (1993) A genetic algorithm tutorial. Technical Report CS-93–103, Department of Computer Science, Colorado State University

  • Whitley D, Beverridge R, Graves C, Mathias K (1995) New test functions and geometric matching. J Heuristics 1:77–104

    Article  MATH  Google Scholar 

  • Whitley D, Kauth J (1988) GENITOR: a different genetic algorithm. In: Proceedings of the Rocky Mountain conference on artificial intelligence, Denver, Colorado, pp 118–130

  • Wong SV, Hamouda AMS (2000) Optimization of fuzzy rules design using genetic algorithm. Adv Eng Softw 31:251–262

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Engineering, Fukui University, Fukui-shi, 910-8507, Japan

    Rong-Long Wang & Kozo Okazaki

Authors
  1. Rong-Long Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kozo Okazaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rong-Long Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, RL., Okazaki, K. An improved genetic algorithm with conditional genetic operators and its application to set-covering problem. Soft Comput 11, 687–694 (2007). https://doi.org/10.1007/s00500-006-0131-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-006-0131-1

Keywords

Search

Navigation