By Topic

Input data dependency of a genetic algorithm to solve the set covering problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Iwamura, Kakuzo ; Department of Mathematics, Josai University, Japan ; Horiike, Makoto ; Sibahara, Tomoya

A genetic algorithm to solve the set covering problem proposed in the literature had some improvements which gave better solutions, i. e., better chromosomes in the first starting population, taking full account of domain specific knowledge with sound programming skill. We have further investigated the input data dependency of their genetic algorithm, i. e., the dependency on costs and density. We have found that for input problem data sets with densities greater than or equal to 3 %, our genetic algorithm is still practical both in computing time and approximation ratio.

Published in:

Tsinghua Science and Technology  (Volume:8 ,  Issue: 1 )