On Solving Process of a Combinatorial Optimization Problem

摘要

The combinatorial optimization problem is a nonlinear blending programming problem, which has a part of integral values, and the other values having connection with them. According to this property, this paper presents a method to solve the problem. The method applies genetic algorithm to the integral values, and natural search with given step length to the other values or using the optimization toolbox in MATLAB. The method not only reduces the difficulty of the problem and improves the precision of the result, but also conquers the bug of depending on genetic algorithm devilishly. At last, an example is presented to indicate the validity of the method.