Deterministic global optimization algorithm based on affine algorithm

被引：0
|
作者：
机构：
[1] Key Laboratory of Electronic Equipment Structure Design of the Ministry of Education, Xidian University, Xi'an 710071, Shaanxi
来源：
Xie, Y.-Q. (xd_aqiang@tom.com) | 1600年 / South China University of Technology卷 / 40期
关键词：
Affine algorithm; Deterministic algorithm; Global optimization; Interval algorithm;
D O I：
10.3969/j.issn.1000-565X.2012.05.007
中图分类号：
学科分类号：
摘要：
In order to overcome the problem for the greatly-taken time, high space complexity and slow convergence of the traditional interval algorithm in solving the global optimization, an affine algorithm introducing the traditional affine algorithm and the local optimization algorithm is proposed. In this new algorithm, the upper bound of the global optimal solution is obtained by the local optimization algorithm and the affine arithmetic for the objective function in each subinterval, and the carding or discarding of the corresponding interval is determined according to the comparison between the lower bound of the affine arithmetic in each subinterval and the upper bound of the global optimal solution. Moreover, the subinterval containing the optimal value is obtained by deleting the subinterval without the optimal value. Numerical simulation results show that, as compared with the traditional interval optimization algorithm, the proposed algorithm possesses higher convergence speed and occupies less system resource.
引用
收藏
页码：35 / 40
页数：5
相关论文
共 17 条
  • [1] Zheng S., Hou D.-B., Zhou Z.-K., Ant colony algorithm with dynamic transition probability, Control and Decision, 23, 2, pp. 225-228, (2008)
  • [2] Yang X.-R., Liang J.-H., Chen L., Et al., Multi-neighborhood improved particle swarm optimization algorithm, Systems Engineering and Electronics, 32, 11, pp. 2453-2458, (2010)
  • [3] Zhao W.-H., Wang Y.-P., Wang W., Global optimization evolutionary algorithm with high searching speed, Computer Engineering, 34, 8, pp. 208-212, (2008)
  • [4] Wu H.-Z., Zhang K.-C., Global optimization algorithm based on Lagrangian dual, Journal of Xi'an Jiaotong University, 42, 8, pp. 1031-1034, (2008)
  • [5] Hong Z., Solving fractional problems management based on a deterministic algorithm, 2009 IITA International Conference on Control, Automation and Systems Engineering, pp. 163-166, (2009)
  • [6] Lim Y., Stadtherr Mark A., Deterministic global optimization for dynamic systems using interval analysi, 2006 12th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, pp. 323-331, (2007)
  • [7] Zhang X., Liu S., Interval algorithm for global numerical optimization, Engineering Optimization, 40, 9, pp. 849-868, (2008)
  • [8] Sun M., Johnson A.W., Interval branch and bound with local sampling for constrained global optimization, Journal of Global Optimization, 33, 1, pp. 62-82, (2005)
  • [9] Mazhoud I., Hadj-Hamou K., Bigeon J., Et al., Interval-based global optimization in engineering using model reformulation and constraint propagation, Engineering Applications of Artificial Intelligence, 25, 2, pp. 404-417, (2012)
  • [10] de Figueiredo L.H., Stolfi J., Affine arithmetic: Concepts and applications, Numerical Algorithms, 37, 1-4, pp. 147-158, (2004)
12