PARAMETER-FREE FILLED FUNCTION METHOD FOR NONLINEAR INTEGER PROGRAM

Filled function method is a typical deterministic approach for solving nonlinear integer programming problems. The core technique of this approach is to construct a filled function that can constantly jump out of the current local minimizer and find another better local minimizer. To overcome the difficulty in selecting the parameters of the filled function, a new parameter-free filled function is constructed, and a new global optimization algorithm is designed by combining the discrete steepest descent method. Numerical results illustrate that the algorithm is not only effective and feasible, but also has better global optimization ability. Finally, the applicability of the algorithm is verified by solving an actual single-machine scheduling problem.