Combining Interval Branch and Bound and Stochastic Search

Algorithm 12

GA (idsearch, , , , ).

(1) Set up an initial population . It consists of and the other points from the box corresponding to idsearch.

(2) for   to   do

(3)   Use linear crossover, Algorithm 10, produces a set of individuals where .

(4)   Choose the best from and and put them in . For

   feasible, the less value is the better. For infeasible, the less violation,

   measured by , is the better.

(5)   Update and fit value of the box if it applies.

(6) end for