895 search results - page 1 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper describes a Genetic Algorithms approach to a manpower-scheduling problem arising at a major UK hospital. Although Genetic Algorithms have been successfully used for sim...
IICAI
2003
13 years 8 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
COR
2006
13 years 7 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...