论文信息 - A genetic algorithm approach to the maximum independent set problem

A genetic algorithm approach to the maximum independent set problem

The results obtained from the application of a genetic algorithm to the NP-complete maximum independent set problem are reported in this work. In contrast to many other genetic algorithm-based approaches that use domain-specific knowledge, the approach presented here relies on a graded penalty term component of the objective function to penalize infeasible solutions. The method is applied to several large problem instances of the maximum independent set problem, and the results clearly indicate that genetic algorithms can be successfully used as heuristics for finding good approximate solutions for this highly constrained optimization problem.

Thomas Bck | Thomas Bck

[1] Lawrence. Davis,et al. Handbook Of Genetic Algorithms , 1990 .

[2] Gunar E. Liepins,et al. Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.

[3] Schloss Birlinghoven,et al. How Genetic Algorithms Really Work I.mutation and Hillclimbing , 2022 .

[4] Alice E. Smith,et al. Genetic Optimization Using A Penalty Function , 1993, ICGA.

[5] Thomas Bäck,et al. The zero/one multiple knapsack problem and genetic algorithms , 1994, SAC '94.

[6] Thomas Bäck,et al. A Comparative Study of a Penalty Function, a Repair Heuristic and Stochastic Operators with the Set-Covering Problem , 1995, Artificial Evolution.

[7] Thomas Bäck,et al. The Interaction of Mutation Rate, Selection, and Self-Adaptation Within a Genetic Algorithm , 1992, PPSN.

[8] Seymour E. Goodman,et al. Introduction to the Design and Analysis of Algorithms , 1977 .

[9] Thomas Bäck,et al. An evolutionary heuristic for the maximum independent set problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.