Journal of Computers, Vol 4, No 3 (2009), 179-183, Mar 2009
doi:10.4304/jcp.4.3.179-183
A New T-F Function Approach for Discrete Global Optimization
Abstract
The T-F function method is an approach to find the global minimum of a multidimensional function. This paper gives a new definition of T-F function for discrete global optimization. A T-F function satisfying this definition is proposed. Furthermore, we discuss the properties of the proposed T-F function and design a new discrete T-F function algorithm. Numerical results on several test problems indicate that the proposed algorithm is reliable and efficient.
Keywords
Discrete global optimization; Filled function; Tunnel function; T-F function
References
Full Text: PDF


