Skip to main content
SpringerLink
Log in

Experimental Comparison of Two Evolutionary Algorithms for the Independent Set Problem

  • Conference paper
  • First Online:
Applications of Evolutionary Computing (EvoWorkshops 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2611))

Included in the following conference series:

Abstract

This work presents an experimental comparison of the steady-state genetic algorithm to the (1+1)-evolutionary algorithm applied to the maximum vertex independent set problem. The penalty approach is used for both algorithms and tuning of the penalty function is considered in the first part of the paper. In the second part we give some reasons why one could expect the competitive performance of the (1+1)-EA. The results of computational experiment are presented.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press (1995)

    Google Scholar 

  2. Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. Proc. 40th IEEE Symposium on Foundations of Computer Science (1999)410–414

    Google Scholar 

  3. Borisovsky, P.A., Eremeev, A.V.: A Study on Performance of the (1+1)-Evolutionary Algorithm. Proc. of Foundations of Genetic Algorithms-2002 (FOGA-2002) (2002) 367–383

    Google Scholar 

  4. Droste, S., Jansen, T., Tinnefeld K., Wegener, I.: A new framework for the valuation of algorithms for black-box optimisation. Proc. of Foundations of Genetic Algorithms-2002 (FOGA-2002) (2002) 197–214

    Google Scholar 

  5. Fogel, D. B., Ghozeil, A.: Using fitness distributions to design more efficient evolutionary computations. In Fukuda, T (ed.): Proc. Third IEEE International Conference on Evolutionary Computation, IEEE (1996) 11–19

    Google Scholar 

  6. Kallel, L., Schoenauer, M.: A priori comparison of binary crossover operators: No universal statistical measure, but a set of hints. Proc. Artificial Evolution’97, LNCS Num. 1363. Springer Verlag (1997) 287–299

    Google Scholar 

  7. Bäck, Th., Khuri, S.: An Evolutionary Heuristic for the Maximum Independent Set Problem. Proc. First IEEE Conference on Evolutionary Computation, IEEE (1994) 531–535

    Google Scholar 

  8. Balas, E., Niehaus, W.: Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems. Journ. of Heuristics, 4 (4) (1998) 107–122

    Article  MATH  Google Scholar 

  9. Bomze, I. M., Budinich M., Pardalos P. M., Pelillo, M.: The maximum clique problem. In Du, D.-Z. and Pardalos, P. M. (eds): Handbook of Combinatorial Optimization, Vol. 4. Kluwer Academic Publishers (1999)

    Google Scholar 

  10. Goldberg, D. E., Deb, K.: A comparative study of selection schemes used in genetic algorithms. In G. Rawlins (ed.): Foundations of Genetic Algorithms(FOGA). Morgan Kaufmann (1991) 69–93

    Google Scholar 

  11. Syswerda, G.: A study of reproduction in generational and steady state genetic algorithm. In G. Rawlins (ed.): Foundations of Genetic Algorithms (FOGA). Morgan Kaufmann (1991) 94–101

    Google Scholar 

  12. Richardson, J.T., Palmer, M.R., Liepins, G., Hilliard M.: Some guidelines for genetic algorithms with penalty functions. In J. David Schaffer (ed.): Proc. of the 3rd International Conference on Genetic Algorithms. Morgan Kaufmann (1989) 191–197.

    Google Scholar 

  13. Bäck, Th., Schwefel H.-P.: An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1 (1) (1993) 1–23

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Omsk Branch of Sobolev Institute of Mathematics, 13 Pevtsov str., 644099, Omsk, Russia

    Pavel A. Borisovsky

  2. Mathemetical Department, Omsk State University, 55 Mira str., 644077, Omsk, Russia

    Marina S. Zavolovskaya

Authors
  1. Pavel A. Borisovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marina S. Zavolovskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Engineering, University of Parma, Parco Area delle Scienze 181/a, 43100, Parma, Italy

    Stefano Cagnoni

  2. Computing Laboratory, University of Kent, Canterbury, Kent, CT2 7NF, UK

    Colin G. Johnson

  3. Dept. of Information and Communications Technologies Faculty of Computer Science, University of A Coruña, A Coruña, CP 15071, Spain

    Juan J. Romero Cardalda

  4. Dept. of Mathematics and Computer Science, Free University of Amsterdam, de Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Elena Marchiori

  5. Schol of Systems Engineering, University of Reading, PO Box 225, Whiteknights, Reading, RG6 6AY, UK

    David W. Corne

  6. AnimatLab, 8 rue du capitaine Scott, 75015, Paris, France

    Jean-Arcady Meyer  & Agnès Guillot  & 

  7. SAP AG, Neurottstrasse 16, 69190, Walldorf, Germany

    Jens Gottlieb

  8. Parallel Computing and Complex Systems Group, University of Leipzig, Augustusplatz 10/11, 04109, Leipzig, Germany

    Martin Middendorf

  9. Algorithms and Data Structures Group Institute of Computer Graphics, Vienna University of Technology, Favoritenstrasse 9-11/186, 1040, Vienna, Austria

    Günther R. Raidl

  10. School of Computing, Napier University, 219 Colinton Road, Edinburgh, EH14 1DJ, UK

    Emma Hart

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Borisovsky, P.A., Zavolovskaya, M.S. (2003). Experimental Comparison of Two Evolutionary Algorithms for the Independent Set Problem. In: Cagnoni, S., et al. Applications of Evolutionary Computing. EvoWorkshops 2003. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36605-9_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-36605-9_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00976-4

  • Online ISBN: 978-3-540-36605-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation