×

Hybrid particle swarm optimization and pattern search algorithm. (English) Zbl 1484.90140

Summary: Particle swarm optimization (PSO) is one of the most commonly used stochastic optimization algorithms for many researchers and scientists of the last two decades, and the pattern search (PS) method is one of the most important local optimization algorithms. In this paper, we test three methods of hybridizing PSO and PS to improve the global minima and robustness. All methods let PSO run first followed by PS. The first method lets PSO use a large number of particles for a limited number of iterations. The second method lets PSO run normally until tolerance is reached. The third method lets PSO run normally until the average particle distance from the global best location is within a threshold. Numerical results using non-differentiable test functions reveal that all three methods improve the global minima and robustness versus PSO. The third hybrid method was also applied to a basin network optimization problem and outperformed PSO with filter method and genetic algorithm with implicit filtering.

MSC:

90C59 Approximation methods and heuristics in mathematical programming
90C56 Derivative-free methods and methods using generalized derivatives

Software:

Matlab; PSwarm
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Almomani A (2012) Constraint handling for derivative-free optimization. PhD thesis, Clarkson University, Potsdam, NY
[2] Alsumait, JS; Sykulski, JK; Al-Othman, AK, A hybrid ga-ps-sqp method to solve power system valve-point economic dispatch problems, Appl Energy, 87, 5, 1773-1781 (2010) · doi:10.1016/j.apenergy.2009.10.007
[3] Ansari Ardeh M. Benchmarkfcns toolbox
[4] Beauregard, J.; Ritz, B.; W Jenkins, E.; R Kavanagh, K.; W Farthing, M., Optimization of a basin network using hybridized global search algorithms, J Irrig Drain Eng, 144, 8, 04018017 (2018) · doi:10.1061/(ASCE)IR.1943-4774.0001310
[5] Clerc M et al. (2007) Standard pso 2007. Particle Swarm Central Website
[6] Hooke, R.; A Jeeves, T., “direct search” solution of numerical and statistical problems, J ACM (JACM), 8, 2, 212-229 (1961) · Zbl 0111.12501 · doi:10.1145/321062.321069
[7] Ismael F. Vaz, A.; Vicente, LN, A particle swarm pattern search method for bound constrained global optimization, J Global Optim, 39, 2, 197-219 (2007) · Zbl 1180.90252 · doi:10.1007/s10898-007-9133-5
[8] Jamil M, Yang X-S (2013). A literature survey of benchmark functions for global optimization problems. arXiv preprint arXiv:1308.4008 · Zbl 1280.65053
[9] Kennedy J (2010) Particle swarm optimization. Encyclopedia of machine learning, pp 760-766
[10] Khadanga, RK; Satapathy, JK, A hybrid gravitational search and pattern search algorithm for tuning damping controller parameters for a unified power flow controller-a comparative approach, Int J Numer Modell Electron Netw Dev Fields, 31, 3, e231 (2018)
[11] Long, W.; Zhang, W.; Huang, Y.; Chen, Y., A hybrid cuckoo search algorithm with feasibility-based rule for constrained structural optimization, J Central South Univ, 21, 8, 3197-3204 (2014) · doi:10.1007/s11771-014-2291-y
[12] Matlab, MATLAB2017b, The MathWorks, Natick, MA, USA
[13] McCart, J.; Almomani, A., New criteria for comparing global stochastic derivative-free optimization algorithms, (IJACSA) Int J Adv Comput Sci Appl, 10, 7, 614-625 (2019)
[14] Meftahi M, Jazi SH (2012) A new hybrid algorithm of pattern search and abc for optimization. In: The 16th CSI international symposium on artificial intelligence and signal processing (AISP 2012), pp 403-406
[15] Mirjalili, SA; Mohd Hashim, SZ, Training feedforward neural networks using hybrid particle swarm optimization and gravitational search algorithm, Appl Math Comput, 218, 22, 11125-11137 (2012) · Zbl 1282.90248
[16] Ritz B (2017) A hybrid genetic algorithm with implicit filtering for mixed integer optimization problem. PhD thesis, Clarkson University, Potsdam, NY
[17] Wahid F, Ghazali R (2018) Hybrid of firefly algorithm and pattern search for solving optimization problems. Evolut Intell
[18] Weihang Z, Curry J (2009) Particle swarm with graphics hardware acceleration and local pattern search on bound constrained problems. In: 2009 IEEE swarm intelligence symposium, SIS 2009-proceedings, pp 1 - 8
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.