摘要
The Filled Function Method is a class of effective algorithms for continuous global optimization. In this paper, a new filled function method is introduced and used to solve integer programming. Firstly, some basic definitions of discrete optimization are given. Then an algorithm and the implementation of this algorithm on several test problems are showed. The computational results show the algorithm is effective.
The Filled Function Method is a class of effective algorithms for continuous global optimization. In this paper, a new filled function method is introduced and used to solve integer programming. Firstly, some basic definitions of discrete optimization are given. Then an algorithm and the implementation of this algorithm on several test problems are showed. The computational results show the algorithm is effective.
基金
Foundation item： the National Science Foundation of China（7A14178）
the Science Fund of Shanghai University of Engineering Science for Young Scholars（2005Q23）
the Natural Science Foundation of Education Commission of Shanghai （No.05NZ07）.
