A genetic algorithm for the set covering problem

@inproceedings{Beasley1996AGA,
  title={A genetic algorithm for the set covering problem},
  author={John E. Beasley and P. C. Chu},
  year={1996}
}
Abstract 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 specifically for the set covering problem. The performance of our algorithm was evaluated on a large set of randomly generated problems. Computational results showed that the genetic algorithm… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 304 CITATIONS

Application of Heuristic Genetic Algorithm for Optimal Layout of Flow Measurement Stations in Water Distribution Networks

VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

An electromagnetic meta-heuristic for the nurse scheduling problem

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A probability-based multi-path alternative fueling station location model

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A Framework for Designing of Electric Vehicle Charging Infrastructure Network

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A new approach for solving set covering problem using jumping particle swarm optimization method

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Top-k entity augmentation using consistent set covering

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Algorithms to Find the Girth and Cogirth of a Linear Matroid

VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1992
2019

CITATION STATISTICS

  • 47 Highly Influenced Citations

  • Averaged 15 Citations per year from 2017 through 2019

  • 31% Increase in citations per year in 2019 over 2018