A discrete filled function method is developed in this paper to solve discrete global optimization problems over "strictly pathwise connected domains." Theoretical properties of the proposed discretefilled ...
详细信息
A discrete filled function method is developed in this paper to solve discrete global optimization problems over "strictly pathwise connected domains." Theoretical properties of the proposed discretefilledfunction are investigated and a solution algorithm is proposed. Numerical experiments reported in this paper on several test problems with up to 200 variables have demonstrated the applicability and efficiency of the proposed method.
In this paper, a new discrete filled function method is proposed for finding a global minimizer of integer programming problems. Only one parameter is included in the proposed filledfunction and it does not need to b...
详细信息
In this paper, a new discrete filled function method is proposed for finding a global minimizer of integer programming problems. Only one parameter is included in the proposed filledfunction and it does not need to be adjusted further when it is taken as large as possible;moreover, the current local minimizer obtained by minimizing the proposed filledfunction will be one of the local minimizers of the original problem and it is better than the minimizers found previously. Thus it is not necessary to use a local search method to the original function. As a result, the computation cost of the proposed discrete filled function method is relatively low. Numerical results demonstrate the effectiveness of the proposed method. (C) 2012 Elsevier Inc. All rights reserved.
In this paper, we consider a class of non-standard time optimal control problems involving a dynamical system consisting of multiple subsystems evolving over different time horizons. Different subsystems are required ...
详细信息
In this paper, we consider a class of non-standard time optimal control problems involving a dynamical system consisting of multiple subsystems evolving over different time horizons. Different subsystems are required to reach their respective target sets at different termination times. The goal is to minimize the maximum of these termination times. By introducing a discrete variable to represent the system termination ordering, were formulate this problem as a discrete optimization problem. A discrete filled function method is developed to solve this discrete optimization problem. For illustration, a numerical example is solved. (C) 2008 Elsevier Ltd. All rights reserved.
暂无评论