A new evolutionary search strategy for global optimization of high-dimensional problems

Global optimization of high-dimensional problems in practical applications remains a major challenge to the research community of evolutionary computation. The weakness of randomization-based evolutionary algorithms in searching high-dimensional spaces is demonstrated in this paper. A new strategy, SP-UCI is developed to treat complexity caused by high dimensionalities. This strategy features a slope-based searching kernel and a scheme of maintaining the particle population's capability of searching over the full search space. Examinations of this strategy on a suite of sophisticated composition benchmark functions demonstrate that SP-UCI surpasses two popular algorithms, particle swarm optimizer (PSO) and differential evolution (DE), on high-dimensional problems. Experimental results also corroborate the argument that, in high-dimensional optimization, only problems with well-formative fitness landscapes are solvable, and slope-based schemes are preferable to randomization-based ones. © 2011 Elsevier Inc. All rights reserved

Least Squares Fitting of Chacón-Gielis Curves by the Particle Swarm Method of Optimization

Ricardo Chacón generalized Johan Gielis's superformula by introducing elliptic functions in place of trigonometric functions. In this paper an attempt has been made to fit the Chacón-Gielis curves (modified by various functions) to simulated data by the least squares principle. Estimation has been done by the Particle Swarm (PS) methods of global optimization. The Repulsive Particle Swarm optimization algorithm has been used. It has been found that although the curve-fitting exercise may be satisfactory, a lack of uniqueness of Chacón-Gielis parameters to data (from which they are estimated) poses an insurmountable difficulty to interpretation of findings.Least squares multimodal nonlinear curve-fitting; Ricardo Chacón; Jacobian Elliptic functions; Weierstrass ; Gielis super-formula; supershapes; Particle Swarm method; Repulsive Particle Swarm method of Global optimization; nonlinear programming; multiple sub-optima; global; local optima; fit; empirical; estimation; cellular automata; fractals

Multiswarm PSO with supersized swarms - Initial performance study

In this paper it is discussed and briefly experimentally investigated the performance of multi-swarm PSO with super-sized swarms. The selection of proper population size is crucial for successful PSO using. This work follows previous promising research. © 2016 Author(s)

Some Experiments on Fitting of Gielis Curves by Simulated Annealing and Particle Swarm Methods of Global Optimization

In this paper an attempt has been made to fit the Gielis curves (modified by various functions) to simulated data. The estimation has been done by two methods - the Classical Simulated Annealing (CSA) and the Particle Swarm (PS) methods - of global optimization. The Repulsive Particle Swarm (RPS) optimization algorithm has been used. It has been found that both methods are quite successful in fitting the modified Gielis curves to the data. However, the lack of uniqueness of Gielis parameters to data (from which they are estimated) is corroborated. From a technical viewpoint, this exercise may be considered as an application of CSA and RPS to extremely nonlinear least-squares curve-fitting to data that may exhibit a large number of local optima.Gielis curves; superformula; nonlinear curve-fitting; Least squares; multi-modal; local optima; global optimization; simulated annealing; particle swarm; parameters estimation

Adaptive particle swarm optimization

An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perform a global search over the entire search space with faster convergence speed. The APSO consists of two main steps. First, by evaluating the population distribution and particle fitness, a real-time evolutionary state estimation procedure is performed to identify one of the following four defined evolutionary states, including exploration, exploitation, convergence, and jumping out in each generation. It enables the automatic control of inertia weight, acceleration coefficients, and other algorithmic parameters at run time to improve the search efficiency and convergence speed. Then, an elitist learning strategy is performed when the evolutionary state is classified as convergence state. The strategy will act on the globally best particle to jump out of the likely local optima. The APSO has comprehensively been evaluated on 12 unimodal and multimodal benchmark functions. The effects of parameter adaptation and elitist learning will be studied. Results show that APSO substantially enhances the performance of the PSO paradigm in terms of convergence speed, global optimality, solution accuracy, and algorithm reliability. As APSO introduces two new parameters to the PSO paradigm only, it does not introduce an additional design or implementation complexity