A genetic algorithm with decomposition procedures for block-angular nonlinear integer programming problems

In this paper, we focus on block-angular nonlinear integer programming problems which are often seen as a mathematical model of large-scale discrete systems optimization. In order to make use of the special structure of the above problem, we propose an effective solution method based on a genetic algorithm with decomposition procedures. By applying many numerical examples, we show the efficiency of the proposed method.