A modified discrete filled function algorithm for solving nonlinear discrete optimization problems
MetadataShow full item record
The complete Proceedings may be available via the url in the Related Links field
The discrete filled function method is a global optimization tool for searching for the best solution amongst multiple local optima. This method has proven useful for solving large-scale discrete optimization problems. In this paper, we consider a standard discrete filled function algorithm in the literature and then propose a modification to increase its efficiency.
Showing items related by title, author, creator and subject.
Woon, Siew Fang (2009)Optimal control problems arise in many applications, such as in economics, finance, process engineering, and robotics. Some optimal control problems involve a control which takes values from a discrete set. These problems ...
Tseng, Chien H. (1999)The design of envelope-constrained (EC) filters is considered for the time-domain synthesis of filters for signal processing problems. The objective is to achieve minimal noise enhancement where the shape of the filter ...
Zhou, Jingyang; Love, Peter; Teo, Kok Lay; Luo, H. (2017)© 2016 Informa UK Limited, trading as Taylor & Francis GroupA quadratic assignment problem (QAP), which is a combinatorial optimisation problem, is developed to model the problem of locating facilities with material flows ...