p.121
p.126
p.133
p.139
p.143
p.147
p.151
p.156
p.160
Practicably Optimal Point and its Solution in Deterministic System
Abstract:
In some cases, it’s not enough to consider only the objective function of the global optimal point, but also the character of this point and its nearby area. To this end, the concept of practicably optimal point is introduced in this paper. Further, a novel intelligence method named simulated particle swarm optimization (NSPSO) algorithm is proposed to obtain the practicably optimal points according to different requirements. The optimization results reveal that the NSPSO algorithm has strong convergence and stability, and appears to be an efficient alternative for obtaining the practicably optimal points according to different requirements.
Info:
Periodical:
Pages:
143-146
Citation:
Online since:
July 2012
Authors:
Price:
Сopyright:
© 2012 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: