Experimental comparison of two evolutionary algorithms for the independent set problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2611, Issue , 2003, Pages 154-164

  Borisovsky, Pavel A ^a   Zavolovskaya, Marina S ^b  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b OMSK STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS;

COMPETITIVE PERFORMANCE; COMPUTATIONAL EXPERIMENT; EXPERIMENTAL COMPARISON; INDEPENDENT SET PROBLEMS; PENALTY FUNCTION; STEADY-STATE GENETIC ALGORITHMS;

EVOLUTIONARY ALGORITHMS;

EID: 35248819178     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36605-9_15     Document Type: Review

References (14)

1. Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press (1995)
2. Schöning, U.: A probabilistic algorithm for κ-SAT and constraint satisfaction problems. Proc. 40th IEEE Symposium on Foundations of Computer Science (1999) 410-414
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
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
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
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
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
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
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)
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
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
12. See the FTP site: ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/clique/
13. 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.
14. Bäck, Th., Schwefel H.-P.: An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1 (1) (1993) 1-23