A genetic based algorithm for the quadratic 0-1 problem
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 th...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2003
|
| Assuntos: | |
| Texto completo: | http://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612003000100005 |
| País: | Portugal |
| Oai: | oai:scielo:S0874-51612003000100005 |
| 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. |
|---|