Towards Merging Binary Integer Programming Techniques with Genetic Algorithms

Algorithm 1

The pseudocode of the QGA.

(1) PROCEDURE QGA()

(2) Do tree search and find a lower bound.

(3) IF (Tree search has found a solution)

(4)    Print the solution as an optimal solution.

(5) ELSE

(6)   Do Heuristic Search and find an upper bound.

(7)   Construct the objective function of a binary integer program.

(8)   Construct the constraints of the binary integer program.

(9)   Assemble the binary integer program.

(10)   In the integer program, replace all integerality constraints with the corresponding penalty.

(11)   Modify the objective function for preventing even distribution of variables in the range 0-1.

(12)   Solve the quadratic program (linear program with quadratic objective function).

(13)   Convert the solution obtained to the priorities directing the genetic algorithm.

(14)   Print the obtained solution by the genetic algorithm.

(15) ENDIF

(16) ENDPROCEDURE