Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An enhanced POSTA based on Nelder-Mead simplex search and quadratic interpolation (2405.00122v1)

Published 30 Apr 2024 in math.OC and cs.NE

Abstract: State transition algorithm (STA) is a metaheuristic method for global optimization. Recently, a modified STA named parameter optimal state transition algorithm (POSTA) is proposed. In POSTA, the performance of expansion operator, rotation operator and axesion operator is optimized through a parameter selection mechanism. But due to the insufficient utilization of historical information, POSTA still suffers from slow convergence speed and low solution accuracy on specific problems. To make better use of the historical information, Nelder-Mead (NM) simplex search and quadratic interpolation (QI) are integrated into POSTA. The enhanced POSTA is tested against 14 benchmark functions with 20-D, 30-D and 50-D space. An experimental comparison with several competitive metaheuristic methods demonstrates the effectiveness of the proposed method.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (35)
  1. State transition algorithm. Journal of Industrial & Management Optimization, 8(4):1039, 2012.
  2. The principle of state transition algorithm and its applications. Acta Automatica Sinica, 46(11):2260–2274, 2020.
  3. Dynamic optimization for copper removal process with continuous production constraints. IEEE Transactions on Industrial Informatics, 16(12):7255–7263, 2019.
  4. Hierarchical parameter optimization based support vector regression for power load forecasting. Sustainable Cities and Society, 71:102937, 2021.
  5. A fast constrained state transition algorithm. Neurocomputing, 455:202–214, 2021.
  6. A statistical study on parameter selection of operators in continuous state transition algorithm. IEEE Transactions on Cybernetics, 49(10):3722–3730, 2018.
  7. A simplex method for function minimization. The Computer Journal, 7(4):308–313, 1965.
  8. Maximum likelihood estimation for the parameters of skew normal distribution using genetic algorithm. Swarm and Evolutionary Computation, 38:127–138, 2018.
  9. Hyper-heuristics to customise metaheuristics for continuous optimisation. Swarm and Evolutionary Computation, page 100935, 2021.
  10. Ensemble strategies for population-based optimization algorithms–a survey. Swarm and evolutionary computation, 44:695–711, 2019.
  11. Self-organizing migrating algorithm using covariance matrix adaptation evolution strategy for dynamic constrained optimization. Swarm and Evolutionary Computation, page 100936, 2021.
  12. Improved sine cosine algorithm combined with optimal neighborhood and quadratic interpolation strategy. Engineering Applications of Artificial Intelligence, 94:103779, 2020.
  13. Quadratic interpolation based teaching-learning-based optimization for chemical dynamic system optimization. Knowledge-Based Systems, 145:250–263, 2018.
  14. A whale optimization algorithm based on quadratic interpolation for high-dimensional global optimization problems. Applied Soft Computing, 85:105744, 2019.
  15. Kernel intuitionistic fuzzy c-means and state transition algorithm for clustering problem. Soft Computing, 24(20):15507–15518, 2020.
  16. A novel hybrid model based on bernstein polynomial with mixture of gaussians for wind power forecasting. Applied Energy, 286:116545, 2021.
  17. Using hybrid normalization technique and state transition algorithm to vikor method for influence maximization problem. Neurocomputing, 410:41–50, 2020.
  18. Hybrid intelligence assisted sample average approximation method for chance constrained dynamic optimization. IEEE Transactions on Industrial Informatics, 17(9):6409–6418, 2021.
  19. Implementing the nelder-mead simplex algorithm with adaptive parameters. Computational Optimization and Applications, 51(1):259–277, 2012.
  20. Improved alopex-based evolutionary algorithm (aea) by quadratic interpolation and its application to kinetic parameter estimations. Applied Soft Computing, 51:23–38, 2017.
  21. Structural inverse analysis by hybrid simplex artificial bee colony algorithms. Computers & Structures, 87(13-14):861–870, 2009.
  22. Ali Riza Yildiz. A novel hybrid whale–nelder–mead algorithm for optimization of design and manufacturing problems. The International Journal of Advanced Manufacturing Technology, 105(12):5091–5104, 2019.
  23. Parameter estimation of proton exchange membrane fuel cells using eagle strategy based on jaya algorithm and nelder-mead simplex method. Energy, 173:457–467, 2019.
  24. A benchmark of kriging-based infill criteria for noisy optimization. Structural and Multidisciplinary Optimization, 48(3):607–626, 2013.
  25. Two-stage eagle strategy with differential evolution. International Journal of Bio-Inspired Computation, 4(1):1–5, 2012.
  26. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. Journal of Global Optimization, 39(3):459–471, 2007.
  27. Spam filtering using a logistic regression model trained by an artificial bee colony algorithm. Applied Soft Computing, 91:106229, 2020.
  28. Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Transactions on Evolutionary Computation, 13(2):398–417, 2008.
  29. Self-adaptive differential evolution applied to combustion engine calibration. Soft Computing, 25(1):109–135, 2021.
  30. Grey wolf optimizer. Advances in Engineering Software, 69:46–61, 2014.
  31. A novel hybrid grey wolf optimizer with min-conflict algorithm for power scheduling problem in a smart home. Swarm and Evolutionary Computation, 60:100793, 2021.
  32. Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Transactions on Evolutionary Computation, 10(3):281–295, 2006.
  33. Population size in particle swarm optimization. Swarm and Evolutionary Computation, 58:100718, 2020.
  34. An adaptive particle swarm optimizer with decoupled exploration and exploitation for large scale optimization. Swarm and Evolutionary Computation, 60:100789, 2021.
  35. Adaptive multi-swarm in dynamic environments. Swarm and Evolutionary Computation, 63:100870, 2021.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets