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.
genetic algorithm nonlinear programming MATLAB optimization toolbox
Laizhong Song Xianbo Zhang Wenying Yang
College of Science, China Three Gorges University, Yichang Hubei, 443002
国际会议
第二届中国对策论及其应用国际学术会议(The Second International Conference on Game Theory and Applications)
青岛
英文
169-173
2007-09-17（万方平台首次上网日期，不代表论文的发表时间）