Abstract
Genetic algorithm (GA) is an approximate solution method supposed that a network exists. In this research, focusing on integer programming problems, we improve the performance of GA incorporating complex networks. Furthermore, we show the efficiency of the proposed GA method by comparing it with an existing method through the application of them into the numerical examples.