SciELO - Scientific Electronic Library Online

 
vol.23 issue1Evaluation of a Brazilian University Strategy Aided by the Joint Utilization of UTA and MACBETHThe graph bisection minimization problem author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Investigação Operacional

Print version ISSN 0874-5161

Abstract

SCHUTZ, G.  and  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.

Keywords : Quadratic 0-1 programming; Genetic Algorithms; Hybrid Algorithms.

        · text in English     · English ( pdf )