Abstract
In this paper, we investigate and develop a new filled function method for solving integer programming problems with constraints. By adopting the appropriate equivalent transformation method, these problems are transformed into a class of box-constrained integer programming problems. Then, an effective nonparametric filled function is constructed, and a new global optimization algorithm is designed using the discrete steepest descent method. Numerical experiments illustrate that this algorithm has effectiveness, feasibility, and better global optimization ability.
Funder
National Natural Science Foundation of China
Construction Project of first-class subjects in Ningxia higher Education
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献