A new method to solve dynamic nonlinear constrained optimization problems （DNCOP） is proposed. First, the time （environment） variable period of DNCOP is divided into several equal subperiods. In each subperiod, th...A new method to solve dynamic nonlinear constrained optimization problems （DNCOP） is proposed. First, the time （environment） variable period of DNCOP is divided into several equal subperiods. In each subperiod, the DNCOP is approximated by a static nonlinear constrained optimization problem （SNCOP）. Second, for each SNCOP, inspired by the idea of multiobjective optimization, it is transformed into a static bi-objective optimization problem. As a result, the original DNCOP is approximately transformed into several static bi-objective optimization problems. Third, a new multiobjective evolutionary algorithm is proposed based on a new selection operator and an improved nonuniformity mutation operator. The simulation results indicate that the proposed algorithm is effective for DNCOP.展开更多
Evolutionary algorithms(EAs)were shown to be effective for complex constrained optimization problems.However,inflexible exploration in general EAs would lead to losing the global optimum nearby the ill-convergence reg...Evolutionary algorithms(EAs)were shown to be effective for complex constrained optimization problems.However,inflexible exploration in general EAs would lead to losing the global optimum nearby the ill-convergence regions.In this paper,we propose an iterative dynamic diversity evolutionary algorithm(IDDEA)with contractive subregions guiding exploitation through local extrema to the global optimum in suitable steps.In IDDEA,a novel optimum estimation strategy with multi-agents evolving diversely is suggested to e?ciently compute dominance trend and establish a subregion.In addition,a subregion converging iteration is designed to redistrict a smaller subregion in current subregion for next iteration,which is based on a special dominance estimation scheme.Meanwhile,an infimum penalty function is embedded into IDDEA to judge agents and penalize adaptively the unfeasible agents with the lowest fitness of feasible agents.Furthermore,several engineering design optimization problems taken from the specialized literature are successfully solved by the present algorithm with high reliable solutions.展开更多
Remarks on a benchmark nonlinear constrained optimization problem are made. Due to a citation error, two absolutely different results for the benchmark problem are obtained by independent researchers. Parallel simulat...Remarks on a benchmark nonlinear constrained optimization problem are made. Due to a citation error, two absolutely different results for the benchmark problem are obtained by independent researchers. Parallel simulated annealing using simplex method is employed in our study to solve the benchmark nonlinear constrained problem with mistaken formula and the best-known solution is obtained, whose optimality is testified by the Kuhn Tucker conditions.展开更多
Constrained optimization problems are very important as they are encountered in many science and engineering applications.As a novel evolutionary computation technique,cuckoo search(CS) algorithm has attracted much at...Constrained optimization problems are very important as they are encountered in many science and engineering applications.As a novel evolutionary computation technique,cuckoo search(CS) algorithm has attracted much attention and wide applications,owing to its easy implementation and quick convergence.A hybrid cuckoo pattern search algorithm(HCPS) with feasibility-based rule is proposed for solving constrained numerical and engineering design optimization problems.This algorithm can combine the stochastic exploration of the cuckoo search algorithm and the exploitation capability of the pattern search method.Simulation and comparisons based on several well-known benchmark test functions and structural design optimization problems demonstrate the effectiveness,efficiency and robustness of the proposed HCPS algorithm.展开更多
A novel hybrid algorithm named ABC-BBO, which integrates artificial bee colony(ABC) algorithm with biogeography-based optimization(BBO) algorithm, is proposed to solve constrained mechanical design problems. ABC-BBO c...A novel hybrid algorithm named ABC-BBO, which integrates artificial bee colony(ABC) algorithm with biogeography-based optimization(BBO) algorithm, is proposed to solve constrained mechanical design problems. ABC-BBO combined the exploration of ABC algorithm with the exploitation of BBO algorithm effectively, and hence it can generate the promising candidate individuals. The proposed hybrid algorithm speeds up the convergence and improves the algorithm's performance. Several benchmark test functions and mechanical design problems are applied to verifying the effects of these improvements and it is demonstrated that the performance of this proposed ABC-BBO is superior to or at least highly competitive with other population-based optimization approaches.展开更多
An efficient algorithm is proposed for computing the solution to the constrained finite time optimal control （CFTOC） problem for discrete-time piecewise affine （PWA） systems with a quadratic performance index. The...An efficient algorithm is proposed for computing the solution to the constrained finite time optimal control （CFTOC） problem for discrete-time piecewise affine （PWA） systems with a quadratic performance index. The maximal positively invariant terminal set, which is feasible and invariant with respect to a feedback control law, is computed as terminal target set and an associated Lyapunov function is chosen as terminal cost. The combination of these two components guarantees constraint satisfaction and closed-loop stability for all time. The proposed algorithm combines a dynamic programming strategy with a multi-parametric quadratic programming solver and basic polyhedral manipulation. A numerical example shows that a larger stabilizable set of states can be obtained by the proposed algorithm than precious work.展开更多
基金supported by the National Natural Science Foundation of China (60374063)the Natural Science Basic Research Plan Project in Shaanxi Province (2006A12)+1 种基金the Science and Technology Research Project of the Educational Department in Shaanxi Province (07JK180)the Emphasis Research Plan Project of Baoji University of Arts and Science (ZK0840)
文摘A new method to solve dynamic nonlinear constrained optimization problems （DNCOP） is proposed. First, the time （environment） variable period of DNCOP is divided into several equal subperiods. In each subperiod, the DNCOP is approximated by a static nonlinear constrained optimization problem （SNCOP）. Second, for each SNCOP, inspired by the idea of multiobjective optimization, it is transformed into a static bi-objective optimization problem. As a result, the original DNCOP is approximately transformed into several static bi-objective optimization problems. Third, a new multiobjective evolutionary algorithm is proposed based on a new selection operator and an improved nonuniformity mutation operator. The simulation results indicate that the proposed algorithm is effective for DNCOP.
基金Supported by National Natural Science Foundation of China(61074020)
文摘Evolutionary algorithms(EAs)were shown to be effective for complex constrained optimization problems.However,inflexible exploration in general EAs would lead to losing the global optimum nearby the ill-convergence regions.In this paper,we propose an iterative dynamic diversity evolutionary algorithm(IDDEA)with contractive subregions guiding exploitation through local extrema to the global optimum in suitable steps.In IDDEA,a novel optimum estimation strategy with multi-agents evolving diversely is suggested to e?ciently compute dominance trend and establish a subregion.In addition,a subregion converging iteration is designed to redistrict a smaller subregion in current subregion for next iteration,which is based on a special dominance estimation scheme.Meanwhile,an infimum penalty function is embedded into IDDEA to judge agents and penalize adaptively the unfeasible agents with the lowest fitness of feasible agents.Furthermore,several engineering design optimization problems taken from the specialized literature are successfully solved by the present algorithm with high reliable solutions.
文摘Remarks on a benchmark nonlinear constrained optimization problem are made. Due to a citation error, two absolutely different results for the benchmark problem are obtained by independent researchers. Parallel simulated annealing using simplex method is employed in our study to solve the benchmark nonlinear constrained problem with mistaken formula and the best-known solution is obtained, whose optimality is testified by the Kuhn Tucker conditions.
基金Projects([2013]2082,[2009]2061)supported by the Science Technology Foundation of Guizhou Province,ChinaProject([2013]140)supported by the Excellent Science Technology Innovation Talents in Universities of Guizhou Province,ChinaProject(2008040)supported by the Natural Science Research in Education Department of Guizhou Province,China
文摘Constrained optimization problems are very important as they are encountered in many science and engineering applications.As a novel evolutionary computation technique,cuckoo search(CS) algorithm has attracted much attention and wide applications,owing to its easy implementation and quick convergence.A hybrid cuckoo pattern search algorithm(HCPS) with feasibility-based rule is proposed for solving constrained numerical and engineering design optimization problems.This algorithm can combine the stochastic exploration of the cuckoo search algorithm and the exploitation capability of the pattern search method.Simulation and comparisons based on several well-known benchmark test functions and structural design optimization problems demonstrate the effectiveness,efficiency and robustness of the proposed HCPS algorithm.
基金Projects(61463009,11264005,11361014)supported by the National Natural Science Foundation of ChinaProject([2013]2082)supported by the Science Technology Foundation of Guizhou Province,China
文摘A novel hybrid algorithm named ABC-BBO, which integrates artificial bee colony(ABC) algorithm with biogeography-based optimization(BBO) algorithm, is proposed to solve constrained mechanical design problems. ABC-BBO combined the exploration of ABC algorithm with the exploitation of BBO algorithm effectively, and hence it can generate the promising candidate individuals. The proposed hybrid algorithm speeds up the convergence and improves the algorithm's performance. Several benchmark test functions and mechanical design problems are applied to verifying the effects of these improvements and it is demonstrated that the performance of this proposed ABC-BBO is superior to or at least highly competitive with other population-based optimization approaches.
基金supported by the National Natural Science Foundation of China (60702033)Natural Science Foundation of Zhe-jiang Province (Y107440)
文摘An efficient algorithm is proposed for computing the solution to the constrained finite time optimal control （CFTOC） problem for discrete-time piecewise affine （PWA） systems with a quadratic performance index. The maximal positively invariant terminal set, which is feasible and invariant with respect to a feedback control law, is computed as terminal target set and an associated Lyapunov function is chosen as terminal cost. The combination of these two components guarantees constraint satisfaction and closed-loop stability for all time. The proposed algorithm combines a dynamic programming strategy with a multi-parametric quadratic programming solver and basic polyhedral manipulation. A numerical example shows that a larger stabilizable set of states can be obtained by the proposed algorithm than precious work.
