A genetic algorithm for the set covering problem

In this paper we present a genetic algorithm-based heuristic for non-unicost set covering problems. We propose several modifications to the basic genetic procedures including a new fitness-based crossover operator (fusion), a variable mutation rate and a heuristic feasibility operator tailored speci...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 1996-10, Vol.94 (2), p.392-404
Hauptverfasser:	Beasley, J.E, Chu, P.C
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Combinatorial optimisation Genetic algorithms Heuristic Mathematical analysis Operations research Set covering Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!