A Genetic Algorithm with a Non-binary Representation for the Set Covering Problem

@inproceedings{Eremeev1999AGA,
  title={A Genetic Algorithm with a Non-binary Representation for the Set Covering Problem},
  author={Anton V. Eremeev},
  year={1999}
}
A genetic algorithm (GA) for the set covering problem is developed using a non-binary solution representation. The paper describes the GA and the new problem-speciic operators of crossover and local improvement that we have implemented in it. Usage of these operators leads to a substantial improvement of the algorithm. Finally, some promising results of computation experiment and comparison to other algorithms are reported. 

From This Paper

Topics from this paper.
14 Citations
5 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

Publications referenced by this paper.
Showing 1-5 of 5 references

A Genetic Algorithm for the Set Covering Problem

  • J.E.Beasley, P.C.Chu
  • European Journal of Operation Research,
  • 1996
Highly Influential
9 Excerpts

On Some Genetic and L-class Enumeration Algorithms in Integer Programming

  • A.V.Eremeev, A.A.Kolokolov
  • In Proceedings of the First International…
  • 1996
1 Excerpt

Handbook of Genetic Algorithms, Van Nostrand Reinhold

  • L. Davis
  • New York,
  • 1991
1 Excerpt

Similar Papers

Loading similar papers…