Publicação
A genetic based algorithm for the quadratic 0-1 problem
| Resumo: | In this work we present an algorithm to the unrestricted binary quadratic program. This approach combines genetic operators with greedy and heuristic procedures. We started from a genetic based algorithm and replaced the random mutation by a greedy procedure based on each variable contribution to the objective function. We also introduced in the genetic population an individual obtained by a heuristic that finds a local star minimum point. Computational experience with a set of test-problems, known from literature, is reported and analysed. Our results are quite promising. |
|---|---|
| Autores principais: | Schütz,G. |
| Outros Autores: | Pires,F. M. |
| Assunto: | Quadratic 0-1 programming Genetic Algorithms Hybrid Algorithms |
| Ano: | 2003 |
| País: | Portugal |
| Tipo de documento: | artigo |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Fundação para a Ciência e Tecnologia |
| Idioma: | inglês |
| Origem: | SciELO Portugal |
| Resumo: | In this work we present an algorithm to the unrestricted binary quadratic program. This approach combines genetic operators with greedy and heuristic procedures. We started from a genetic based algorithm and replaced the random mutation by a greedy procedure based on each variable contribution to the objective function. We also introduced in the genetic population an individual obtained by a heuristic that finds a local star minimum point. Computational experience with a set of test-problems, known from literature, is reported and analysed. Our results are quite promising. |
|---|