SciELO - Scientific Electronic Library Online

 
vol.23 número1Avaliação da interiorização dos cursos da Universidade Federal Fluminense com o uso conjugado dos métodos UTA e MACBETHThe graph bisection minimization problem índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

  • No hay articulos similaresSimilares en SciELO

Compartir


Investigação Operacional

versión impresa ISSN 0874-5161

Resumen

SCHUTZ, G.  y  PIRES, F. M.. A genetic based algorithm for the quadratic 0-1 problem. Inv. Op. [online]. 2003, vol.23, n.1, pp.71-84. ISSN 0874-5161.

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.

Palabras clave : Quadratic 0-1 programming; Genetic Algorithms; Hybrid Algorithms.

        · texto en Inglés     · Inglés ( pdf )