Search

In order to improve the performance of traditional particle swarm optimization, this paper introduces the principle of Levy flight and cross-border reset mechanism. In the proposed particle swarm optimization, the dynamic variation of parameters meets the power-law distribution and the pattern of particles transition conforms to the Lévy flight in the process of algorithm optimization. It means the particles make long distance movements in the search space with a small probability and make short distance movements with a large probability. Therefore, the particles can jump out of local optimum more easily and coordinate the global search and local search of particle swarm optimization. This paper also designs the cross-border reset mechanism to make particles regain optimization ability when stranding on the border of search space after a long distance movement. The simulation results demonstrate the proposed algorithms are easier to jump out of local optimum and have higher accuracy when compared with the existing similar algorithms based on benchmark test functions and handwriting character recognition system. [ABSTRACT FROM AUTHOR]

In this paper, an adaptive synthesis using the particle swarm optimization (PSO) for implementations of resonator-coupled filters is proposed. The coupling matrix of in-band filtering response is achieved and optimized by the PSO-based synthesis. Meanwhile, the stopband coupling matrix of the filter is predicted based on the combination of extra resonant nodes representing stopband spurious and parasitic effect of input/output ports. In addition, an enhanced accurate prediction of filter performance is calculated by the proposed approach, considering the practical fabrication tolerance on filter design. To verify principles mentioned earlier, various resonator-coupled filters are implemented. The calculation, EM-simulation, and measurement of filters show good agreements in both passband and stopband. [ABSTRACT FROM AUTHOR]

Injection molding process parameters such as injection temperature, mold temperature, and injection time have direct influence on the quality and cost of products. However, the optimization of these parameters is a complex and difficult task. In this paper, a novel surrogate-based evolutionary algorithm for process parameters optimization is proposed. Considering that most injection molded parts have a sheet like geometry, a fast strip analysis model is adopted as a surrogate model to approximate the time-consuming computer simulation software for predicating the filling characteristics of injection molding, in which the original part is represented by a rectangular strip, and a finite difference method is adopted to solve one dimensional flow in the strip. Having established the surrogate model, a particle swarm optimization algorithm is employed to find out the optimum process parameters over a space of all feasible process parameters. Case studies show that the proposed optimization algorithm can optimize the process parameters effectively. [ABSTRACT FROM AUTHOR]

Adaptive infinite impulse response (IIR) filters have shown their worth in a wide range of practical applications. Because the error surface of IIR filters is multimodal in most cases, global optimization techniques are required for avoiding local minima. In this paper, we employ a global optimization algorithm, Quantum-behaved particle swarm optimization (QPSO) that was proposed by us previously, and itsmutated version in the design of digital IIR filter. The mechanism inQPSO is based on the quantum behaviour of particles in a potential well and particle swarm optimization (PSO) algorithm. QPSO is characterized by fast convergence, good search ability, and easy implementation. The mutated QPSO (MuQPSO) is proposed in this paper by using a random vector in QPSO to increase the randomness and to enhance the global search ability. Experimental results on three examples show that QPSO andMuQPSO are superior to genetic algorithm (GA), differential evolution (DE) algorithm, and PSO algorithm in quality, convergence speed, and robustness. [ABSTRACT FROM AUTHOR]

This paper proposes a variable-dimension optimization approach to address the high dimensionality issues in solving the unit commitment problem. This method introduces the concept of adaptive search space dimension. The proposed approach is implemented in particle swarm optimization algorithm. The optimization process starts with an arbitrary problem dimension, adapts with respect to the swarm progress and finally selects the optimal dimensional space. The efficiency of this method is tested on a ten-unit test system. The results are compared with binary programming and fixed duty cycle approaches. The simulation results show that the proposed method results in considerable reduction of problem dimension, faster convergence and improved quality of the final solution. [ABSTRACT FROM AUTHOR]

To improve computational precision for parameter optimization of the van Genuchten model in simulating moisture movement in environment protection, an improved gray-encoded evolution algorithm based on chaos cluster is proposed, in which an initial population is generated by chaotic mapping, and the searching range is automatically renewed with the excellent individuals by chaos cluster operation. Its efficiency is verified experimentally. The results indicate that the absolute error by the improved gray-encoded evolution algorithm based on chaos cluster decreases by 7.52% and 40.40%, respectively, and the relative error decreases by 12.65% and 49.95%, respectively, compared to those by the standard binary-encoded evolution algorithm, and the particle swarm optimization algorithm. Improved gray-encoded evolution algorithm based on chaos cluster has higher precision and it is good for the global optimization in the practical parameter optimization in environment system. [ABSTRACT FROM AUTHOR]

Batch task scheduling in cloud manufacturing has dynamic, real-time characteristic and the presence of big data concurrency and exchange requirements, while traditional workshop tasks scheduling models and algorithms can't fit. In order to effectively save the time and reduce the cost of workshop production, an optimization model is put forward at first. And then improved cooperative particle swarm optimization algorithm with fast convergence and strong ability to avoid local optimization is used to solve the tasks scheduling problems. At last simulation experiment analysis results prove its effectiveness. [ABSTRACT FROM AUTHOR]

Abstract: The conventional filtered-x least mean square (FxLMS) algorithm commonly employed for active noise control (ANC) is sensitive to disturbances acquired by the error microphone and yields poor performance in such scenario. To circumvent this problem, in this paper, a Wilcoxon FxLMS (WFxLMS) algorithm is proposed and used in the design of an efficient ANC which is robust to outliers in the secondary path and immune to burst noise acquired by the error microphone. It is demonstrated through simulation study that under such situation the proposed algorithm outperforms the traditional FxLMS algorithm. A particle swarm optimization (PSO) algorithm based robust ANC system, which does not require the modeling of the secondary path is also derived in the paper. Improved performance of the robust evolutionary ANC system over L2 norm based evolutionary ANC system is also shown. [Copyright &y& Elsevier]

Abstract: This paper aims at probing into the topic of power units’ operation and dispatch based on Carbon Dioxide (CO2) trading scheme. The trading cost of CO2 emission is embedded into the traditional economic dispatch model, which will be solved by the New Particle Swarm Optimization (NPSO). By considering the CO2 trading scheme, the influences of the various strategies for unit’s dispatch are simulated and analyzed in this paper. The proposed method, NPSO is developed in such a way that PSO with Constriction Factor (PSO-CF) algorithm is applied as a based level search. NPSO introduces two operators, “Random Particles” and “Fine-Tuning” into the PSO-CF algorithm to improve the drawback of searching global optimum and make the search method more efficient at the end of search. The efficiency and ability of NPSO is demonstrated by the six generating units. Simulation results indicated that reasonable solutions provide a practical and flexible framework for power sectors. They can be also used for generating alternatives and thus help decision makers to obtain the goals of minimal operation cost under their desired emission’s policies. [Copyright &y& Elsevier]

Abstract: The wide applicability of correlation analysis inspired the development of this paper. In this paper, a new correlated modified particle swarm optimization (COM-PSO) is developed. The Correlation Adjustment algorithm is proposed to recover the correlation between the considered variables of all particles at each of iterations. It is shown that the best solution, the mean and standard deviation of the solutions over the multiple runs as well as the convergence speed were improved when the correlation between the variables was increased. However, for some rotated benchmark function, the contrary results are obtained. Moreover, the best solution, the mean and standard deviation of the solutions are improved when the number of correlated variables of the benchmark functions is increased. The results of simulations and convergence performance are compared with the original PSO. The improvement of results, the convergence speed, and the ability to simulate the correlated phenomena by the proposed COM-PSO are discussed by the experimental results. [Copyright &y& Elsevier]

Abstract: In this paper, a new approach to the optimal control with constraints is proposed to achieve a desired end product quality for nonlinear processes based on new kernel extreme learning machine (KELM). The contributions of the paper are as follows: (1) In existing ILC algorithm, the model was built only between manipulated input variables U and output variables Y without considering the state variables. However, the states variables X state are important in the industrial processes, which are usually constrained. In this paper, the variables are divided into state variables X state , manipulated input variables U and output Y in the process of modeling. Then ΔU can be obtained by batch-to-batch iterative learning control separately. Kernel algorithm is added to ELM. (2) Constraints of state variables X state and the input variables U are considered in the current version. PSO is used to solve the optimization problem. (3) Kernel trick is introduced to improve accuracy of ELM modeling. New KELM algorithm is proposed in the current version. The input trajectory for the next batch is accommodated by searching for the optimal value through the error feedback at a minimum cost. The particle swarm optimization algorithm is used to search for the optimal value based on the iterative learning control (ILC). The proposed approach has been shown to be effective and feasible by applying bulk polymerization of the styrene batch process and fused magnesium furnace. [Copyright &y& Elsevier]

Abstract: In this paper, Java programming with applets for internet-based control education of two mechanical systems are presented. First, a new multi-objective optimization method is applied to obtain the Pareto frontiers of some non-commensurable objective functions in the design of linear state feedback controllers for an inverted pendulum and a ball–beam system. Second, the simulations of the problems were developed with Java applets and its results are given. The obtained results and analyses demonstrate that this multi-objective method presented in this paper operates very well in terms of convergence speed, global optimality, solution accuracy, and algorithm reliability. [Copyright &y& Elsevier]

This paper proposes a new technique to design an optimal robust PI-controller for electro-hydraulic servo system to achieve both the robustness and performance. Comparative study between the conventional robust control and the proposed technique is included in the paper. Particle Swarm Optimization (PSO) is adopted to simplify the solving of structured robust control problem to realize the practical robust controller. Simulation results show that the proposed controller has simpler structure than that of the conventional robust loop shaping controller, and the stability margin obtained indicates the robustness of the proposed controller. Simulation and experimental results verify the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a model-based fault prognosis method is developed for hybrid systems with multiple incipient faults. The concept of augmented global analytical redundancy relations is proposed for the identification of degradation of components, such as sensors and actuators, which cannot be described by physical parameters. In addition, multiple incipient faults are considered in a complex hybrid system, and these faults can develop during a mode when the faults are not detectable. The unknown degradation characteristic of each incipient fault is identified with the closest matching one of some prescribed dynamic models. The resultant degradation model will serve as a base for prognosis. In the process of fault detection and isolation, the degradation models and faults are identified using a multiple-adaptive-hybrid-particle-swarm-optimization algorithm. The proposed methodology and algorithm are verified with simulation as well as experiments. [ABSTRACT FROM PUBLISHER]

This paper presents a new algorithm, PCLPSO, based on particle swarm optimization, which uses comprehensive learning particle swarm optimizer. Our algorithm executes C parallel CLPSO algorithms. We adopted as a criterion of completion a maximum value of evaluations of the objective function. During the execution of the CLPSO algorithms, when a certain evaluation value of the functions is reached, the best k are selected, and different initialization criteria are applied to continue the execution of the CLPSO algorithms: restarting the worst ones for the best solution or restores the worst ones to a random solution. For this restart, we use the Boltzmann criterion in a similar way as Simulating Annealing (SA) does. In this work, the experimental results obtained for the search of the minimum of 16 multimodal test functions such as Rosenbrock, Griewank, Rastrigin, Brannin, Schwefel, and others. Our algorithm proved to be more efficient than the traditional CLPSO in its experimental results, and the nonparametric Wilcoxon test confirmed this. [ABSTRACT FROM AUTHOR]

In order to alleviate the great harm caused by traditional fossil energy to the natural environment, photovoltaic power generation has become a good choice for human available resources. In this article, the photovoltaic array is used as the object of research, and the maximum power point tracking (MPPT) control algorithm of the photovoltaic array is used as the main research line. The photovoltaic array simulation model was simulated using the MATLAB/SIMULINK software to simulate the output characteristics. The following results were obtained. When the illumination intensity is fixed, the particle swarm optimization (POS) algorithm reaches the end condition after 0.015 s, stops the iteration, the photovoltaic array reaches the maximum power point, and the maximum power value found is 10.704 W, which is less than 1 W from the theoretical power value 10 W, with an error of 0.64%; this shows that the MPPT management approach based on the optimization algorithm has a positive effect. In the event of an immediate change in light, the particle optimization algorithm is re-optimized, with an optimization time of only 0.004 s, that is, it reaches the maximum power point and runs stably. This requires approximately 97% less time than the shock observation method and about 75% less time than the method required to increase the variable transmission, and the power curve is an almost smooth straight line. This shows that the PSO algorithm is able to quickly and accurately control the maximum power point in the event of a sudden change in lighting. The method optimized in this article is superior to the method of observing shocks in the case of stable lighting and sudden changes in light intensity also array and relatively high performance as well as high practical value. [ABSTRACT FROM AUTHOR]

Abstract: In this paper a new meta-heuristic search method, called Cat Swarm Optimization (CSO) algorithm is applied to determine the best optimal impulse response coefficients of FIR low pass, high pass, band pass and band stop filters, trying to meet the respective ideal frequency response characteristics. CSO is generated by observing the behaviour of cats and composed of two sub-models. In CSO, one can decide how many cats are used in the iteration. Every cat has its′ own position composed of M dimensions, velocities for each dimension, a fitness value which represents the accommodation of the cat to the fitness function, and a flag to identify whether the cat is in seeking mode or tracing mode. The final solution would be the best position of one of the cats. CSO keeps the best solution until it reaches the end of the iteration. The results of the proposed CSO based approach have been compared to those of other well-known optimization methods such as Real Coded Genetic Algorithm (RGA), standard Particle Swarm Optimization (PSO) and Differential Evolution (DE). The CSO based results confirm the superiority of the proposed CSO for solving FIR filter design problems. The performances of the CSO based designed FIR filters have proven to be superior as compared to those obtained by RGA, conventional PSO and DE. The simulation results also demonstrate that the CSO is the best optimizer among other relevant techniques, not only in the convergence speed but also in the optimal performances of the designed filters. [Copyright &y& Elsevier]

Abstract: In order to control the pitch angle of blades in wind turbines, commonly the proportional and integral (PI) controller due to its simplicity and industrial usability is employed. The neural networks and evolutionary algorithms are tools that provide a suitable ground to determine the optimal PI gains. In this paper, a radial basis function (RBF) neural network based PI controller is proposed for collective pitch control (CPC) of a 5-MW wind turbine. In order to provide an optimal dataset to train the RBF neural network, particle swarm optimization (PSO) evolutionary algorithm is used. The proposed method does not need the complexities, nonlinearities and uncertainties of the system under control. The simulation results show that the proposed controller has satisfactory performance. [Copyright &y& Elsevier]

Abstract: There is a growing need to address the potential problems caused by the emergence of Plug-in Hybrid Electric Vehicles (PHEVs) and Plug-in Electric Vehicles (PEVs) within the next 10years. In the near future, a large number of PHEVs/PEVs in our society will add a large-scale energy load to our power grids, as well as add substantial energy resources that can be utilized. The large penetration of these vehicles into the marketplace poses a potential threat to the existing power grid. The existing parking infrastructure is not ready for the large penetration of plug-in vehicles and the high demand of electricity. Nowadays, the advanced computational intelligence methods can be applied to solve large-scale optimization problems in a Smart Grid environment. In this paper, authors propose and implement a suite of computational intelligence-based algorithms (e.g., Estimation of Distribution Algorithm, Particle Swarm Optimization) for optimally managing a large number of PHEVs/PEVs charging at a municipal parking station. Authors characterize the performance of the proposed methods using a Matlab simulation, and compare it with other optimization techniques. [Copyright &y& Elsevier]

Abstract: In this paper, comparative performance analysis of various binary coded PSO algorithms on optimal PI and PID controller design for multiple inputs multiple outputs (MIMO) process is stated. Four algorithms such as modified particle swarm optimization (MPSO), discrete binary PSO (DBPSO), modified discrete binary PSO (MBPSO) and probability based binary PSO (PBPSO) are independently realized using MATLAB. The MIMO process of binary distillation column plant, described by Wood and Berry, with and without a decoupler having two inputs and two outputs is considered. Simulations are carried out to minimize two objective functions, that is, time integral of absolute error (ITAE) and integral of absolute error (IAE) with single stopping criterion for each algorithm called maximum number of fitness evaluations. The simulation experiments are repeated 20 times with each algorithm in each case. The performance measures for comparison of various algorithms such as mean fitness, variance of fitness, and best fitness are computed. The transient performance indicators and computation time are also recorded. The inferences are made based on analysis of statistical data obtained from 20 trials of each algorithm and after having comparison with some recently reported results about same MIMO controller design employing real coded genetic algorithm (RGA) with SBX and multi-crossover approaches, covariance matrix adaptation evolution strategy (CMAES), differential evolution (DE), modified continuous PSO (MPSO) and biggest log modulus tuning (BLT). On the basis of simulation results PBPSO is identified as a comparatively better method in terms of its simplicity, consistency, search and computational efficiency. [Copyright &y& Elsevier]

Abstract: This paper proposes a new multiobjective evolutionary algorithm (MOEA) by extending the existing cat swarm optimization (CSO). It finds the nondominated solutions along the search process using the concept of Pareto dominance and uses an external archive for storing them. The performance of our proposed approach is demonstrated using standard test functions. A quantitative assessment of the proposed approach and the sensitivity test of different parameters is carried out using several performance metrics. The simulation results reveal that the proposed approach can be a better candidate for solving multiobjective problems (MOPs). [Copyright &y& Elsevier]

Abstract: In this paper, a new approach is proposed to solve the economic load dispatch (ELD) problem. Power generation, spinning reserve and emission costs are simultaneously considered in the objective function of the proposed ELD problem. In this condition, if the valve-point effects of thermal units are considered in the proposed emission, reserve and economic load dispatch (ERELD) problem, a non-smooth and non-convex cost function will be obtained. Frequency deviation, minimum frequency limits and other practical constraints are also considered in this problem. For this purpose, ramp rate limit, transmission line losses, maximum emission limit for specific power plants or total power system, prohibited operating zones and frequency constraints are considered in the optimization problem. A hybrid method that combines the bacterial foraging (BF) algorithm with the Nelder–Mead (NM) method (called BF–NM algorithm) is used to solve the problem. In this study, the performance of the proposed BF–NM algorithm is compared with the performance of other classic (non-linear programming) and intelligent algorithms such as particle swarm optimization (PSO) as well as genetic algorithm (GA), differential evolution (DE) and BF algorithms. The simulation results show the advantages of the proposed method for reducing the total cost of the system. [Copyright &y& Elsevier]

Abstract: A computation model of fractional-order differentiators based on functional network and the learning Algorithm of functional network using particle swarm optimization was proposed. it provided a new method to compete the numerical calculation of fractional-order differentiators in other fields. the simulation results demonstrate that the method presented in the paper is more efficient and feasible. [Copyright &y& Elsevier]

Abstract: In order to apply cockroach swarm optimization (CSO) algorithm to more function optimization and improve its accuracy, this paper improve CSO by modifying chase-swarming behavior of cockroach, and apply the modified CSO to optimize several Benchmark Problems. The results of simulation experiments illustrate that modified CSO has stronger convergence performance and highly-accuracy optimization results compared with Particle Swarm Optimization (PSO) and Chaotic Particle Swarm Optimization (CPSO). [Copyright &y& Elsevier]

Abstract: This paper presents a new multi-objective optimization algorithm in which multi-swarm cooperative strategy is incorporated into particle swarm optimization algorithm, called multi-swarm cooperative multi-objective particle swarm optimizer (MC-MOPSO). This algorithm consists of multiple slave swarms and one master swarm. Each slave swarm is designed to optimize one objective function of the multi-objective problem in order to find out all the non-dominated optima of this objective function. In order to produce a well distributed Pareto front, the master swarm is developed to cover gaps among non-dominated optima by using a local MOPSO algorithm. Moreover, in order to strengthen the capability locating multiple optima of the PSO, several improved techniques such as the Pareto dominance-based species technique and the escape strategy of mature species are introduced. The simulation results indicate that our algorithm is highly competitive to solving the multi-objective optimization problems. [Copyright &y& Elsevier]

In this paper, an improvement of the particle swarm optimization (PSO) algorithm is proposed. The aim of this algorithm is to iteratively resolve the cost problem of the Multivariable Generalized Predictive Control (MGPC) method under multiple constraints previously reduced. An ill-conditioned chemical process modelled by an uncertain Multi-Input & Multi-Output (MIMO) plant is controlled in order to verify the validity and the effectiveness of the proposed algorithm. The performances obtained are compared with those given by the MGPC method using the standard PSO algorithm. The simulation results shows that the proposed algorithm outperforms standard PSO algorithm in terms of performance and robustness. [ABSTRACT FROM AUTHOR]

Abstract: This paper develops a simulation optimization algorithm based on Taylor Kriging and evolutionary algorithm (SOAKEA) for simulation models with high computational expenses. In SOAKEA, an evolutionary algorithm is used to search for optimal solutions of a simulation model, and Taylor Kriging temporarily serves as a surrogate fitness function of this evolutionary algorithm to evaluate solutions. Taylor Kriging is an enhanced version of Kriging where Taylor expansion is used to approximate the drift function of Kriging, and it improves the interpolation accuracy of Kriging. The structures and properties of SOAKEA are analyzed. A combination correction strategy is created, and it effectively reduces the computational expense of SOAKEA. The empirical comparison of SOAKEA with some other well-known metaheuristics is conducted, and the proposed SOAKEA uses particle swam optimization, a population-based evolutionary algorithm, to solve four simulation problems based on multimodal benchmark functions. The results indicate that SOAKEA has significant advantages in optimizing simulation models with high computational expenses. [Copyright &y& Elsevier]

Abstract: Particle swarm optimization (PSO) was proposed as an optimization technique for static environments; however, many real problems are dynamic, meaning that the environment and the characteristics of the global optimum can change in time. In this paper, we adapt recent techniques, which successfully address several major problems of PSO and exhibit a significant performance over multi-modal and non-stationary environments. In order to address the pre-mature convergence problem and improve the rate of PSO’s convergence to the global optimum, Fractional Global Best Formation (FGBF) technique is used. FGBF basically collects all the best dimensional components and fractionally creates an artificial Global Best particle (aGB) that has the potential to be a better “guide” than the PSO’s native gbest particle. To establish follow-up of local optima, we then introduce a novel multi-swarm algorithm, which enables each swarm to converge to a different optimum and use FGBF technique distinctively. Finally for the multi-dimensional dynamic environments where the optimum dimension also changes in time, we utilize a recent PSO technique, the multi-dimensional (MD) PSO, which re-forms the native structure of the swarm particles in such a way that they can make inter-dimensional passes with a dedicated dimensional PSO process. Therefore, in a multi-dimensional search space where the optimum dimension is unknown, swarm particles can seek for both positional and dimensional optima. This eventually pushes the frontier of the optimization problems in dynamic environments towards a global search in a multi-dimensional space, where there exists a multi-modal problem possibly in each dimension. We investigated both standalone and mutual applications of the proposed methods over the moving peaks benchmark (MPB), which originally simulates a dynamic environment in a unique (fixed) dimension. MPB is appropriately extended to accomplish the simulation of a multi-dimensional dynamic system, which contains dynamic environments active in several dimensions. An extensive set of experiments show that in traditional MPB application domain, FGBF technique applied with multi-swarms exhibits an impressive speed gain and tracks the global peak with the minimum error so far achieved with respect to the other competitive PSO-based methods. When applied over the extended MPB, MD PSO with FGBF can find optimum dimension and provide the (near-) optimal solution in this dimension. [Copyright &y& Elsevier]

Abstract: As a powerful optimization algorithm, particle swarm optimization (PSO) has been widely applied to power system researches. However, most existing applications of PSO can only be implemented offline. The difficulties of online implementation mainly come from the unavoidable lengthy simulation time to evaluate a candidate solution. Recently, PSO was implemented online that can identify parameters in a motor control systems. In this paper, the real-time PSO (RT-PSO) based identification technique is applied to cancel current harmonics in power systems. By transforming the identification problem to optimization problem, RT-PSO can simultaneously identify four parameters associated with fundamental current from measurement. In this way, there is no need to identify the fundamental frequency separately or construct fundamental signal from identified harmonic information. The identification algorithm can be applied to three-phases independently, even for unbalanced system or single-phase system. The identified fundamental signal is then used as the reference for current harmonics cancellation. The RT-PSO based harmonic cancellation is realized with an active filter and used to compensate harmonic current created by a nonlinear load. Simulation results demonstrate that the RT-PSO algorithm can provide accurate identification of the fundamental current which in turn will result in good harmonic cancellation performance. As a capable online optimization technique, RT-PSO can be extensively applied to many optimization and control problems. [ABSTRACT FROM AUTHOR]

Abstract: QoS multicast routing in networks is a very important research issue in networks and distributed systems. It is also a challenging and hard problem for high-performance networks of the next generation. Due to its NP-completeness, many heuristic methods have been employed to solve the problem. This paper proposes the modified quantum-behaved particle swarm optimization (QPSO) method for QoS multicast routing. In the proposed method, QoS multicast routing is converted into an integer programming problem with QoS constraints and is solved by the QPSO algorithm combined with loop deletion operation. The QPSO-based routing method, along with the routing algorithms based on particle swarm optimization (PSO) and genetic algorithm (GA), is tested on randomly generated network topologies for the purpose of performance evaluation. The simulation results show the efficiency of the proposed method on QoS the routing problem and its superiority to the methods based on PSO and GA. [ABSTRACT FROM AUTHOR]

Abstract: Bilinear models can approximate a large class of nonlinear systems adequately and usually with considerable parsimony in the number of coefficients required. This paper presents the application of Particle Swarm Optimization (PSO) algorithm to solve both offline and online parameter estimation problem for bilinear systems. First, an Adaptive Particle Swarm Optimization (APSO) is proposed to increase the convergence speed and accuracy of the basic particle swarm optimization to save tremendous computation time. An illustrative example for the modeling of bilinear systems is provided to confirm the validity, as compared with the Genetic Algorithm (GA), Linearly Decreasing Inertia Weight PSO (LDW-PSO), Nonlinear Inertia Weight PSO (NDW-PSO) and Dynamic Inertia Weight PSO (DIW-PSO) in terms of parameter accuracy and convergence speed. Second, APSO is also improved to detect and determine varying parameters. In this case, a sentry particle is introduced to detect any changes in system parameters. Simulation results confirm that the proposed algorithm is a good promising particle swarm optimization algorithm for online parameter estimation. [ABSTRACT FROM AUTHOR]

Abstract: Control chart patterns are important statistical process control tools for determining whether a process is run in its intended mode or in the presence of unnatural patterns. Accurate recognition of control chart patterns is essential for efficient system monitoring to maintain high-quality products. This paper introduces a novel hybrid intelligent system that includes three main modules: a feature extraction module, a classifier module, and an optimization module. In the feature extraction module, a proper set combining the shape features and statistical features is proposed as the efficient characteristic of the patterns. In the classifier module, a multi-class support vector machine (SVM)-based classifier is proposed. For the optimization module, a particle swarm optimization algorithm is proposed to improve the generalization performance of the recognizer. In this module, it the SVM classifier design is optimized by searching for the best value of the parameters that tune its discriminant function (kernel parameter selection) and upstream by looking for the best subset of features that feed the classifier. Simulation results show that the proposed algorithm has very high recognition accuracy. This high efficiency is achieved with only little features, which have been selected using particle swarm optimizer. [ABSTRACT FROM AUTHOR]

Abstract: In recent years, different metaheuristic methods have been used to solve clustering problems. This paper addresses the problem of manufacturing cell formation using a modified particle swarm optimization (PSO) algorithm. The main modification that this work made to the original PSO algorithm consists in not using the vector of velocities that the standard PSO algorithm does. The proposed algorithm uses the concept of proportional likelihood with modifications, a technique that is used in data mining applications. Some simulation results are presented and compared with results from literature. The criterion used to group the machines into cells is based on the minimization of intercell movements. The computational results show that the PSO algorithm is able to find the optimal solutions in almost all instances, and its use in machine grouping problems is feasible. [Copyright &y& Elsevier]

Abstract: The effective optimization of machining process parameters affects dramatically the cost and production time of machined components as well as the quality of the final products. This paper presents optimization aspects of a multi-pass milling operation. The objective considered is minimization of production time (i.e. maximization of production rate) subjected to various constraints of arbor strength, arbor deflection, and cutting power. Various cutting strategies are considered to determine the optimal process parameters like the number of passes, depth of cut for each pass, cutting speed, and feed. The upper and lower bounds of the process parameters are also considered in the study. The optimization is carried out using three non-traditional optimization algorithms namely, artificial bee colony (ABC), particle swarm optimization (PSO), and simulated annealing (SA). An application example is presented and solved to illustrate the effectiveness of the presented algorithms. The results of the presented algorithms are compared with the previously published results obtained by using other optimization techniques. [Copyright &y& Elsevier]

To improve the flow performance of tandem cascades on design and off design incidence angle and increase the stable operation range, an optimization system for tandem cascades was developed based on an adaptive particle swarm optimization (APSO-PDC). Firstly, APSO-PDC was proposed based on adaptive selection of particle roles and population diversity control. The adaptive selection of particle roles which combines the evolutionary state and dynamic particle state estimation (DPSE) method will sort the particles into three roles to help different particles execute different search tasks during optimization process. The population diversity control, which combines comprehensive learning strategy of the comprehensive learning particle swarm optimizer (CLPSO) with evolutionary state, pretty strengthens the exploration ability and avoids falling into the local optima. The performance of APSO-PDC is evaluated by 11 unimodal and multimodal functions. Compared with the other six PSOs, the results indicate APSO-PDC has better performance in terms of algorithm accuracy and algorithm reliability. In addition, APSO-PDC is validated by optimizing two large-turning tandem cascades, including low-dimension (5 optimization variables) and high-dimension problems (34 optimization variables). Compared with the other six PSOs, the optimization results demonstrate APSO-PDC has the fastest convergence speed and simultaneously controls well the population diversity. [ABSTRACT FROM AUTHOR]

The chaos oscillation particle swarm optimization (COPSO) algorithm is prone to binge trapped in the local optima when dealing with certain complex models in ground-penetrating radar (GPR) data inversion, because it inherently suffers from premature convergence, high computational costs, and extremely slow convergence times, especially in the middle and later periods of iterative inversion. Considering that the bilateral connections between different particle positions can improve both the algorithmic searching efficiency and the convergence performance, we first develop a fast single-trace-based approach to construct an initial model for 2-D PSO inversion and then propose a TV-regularization-based improved PSO (TVIPSO) algorithm that employs total variation (TV) regularization as a constraint technique to adaptively update the positions of particles. B by adding the new velocity variations and optimal step size matrices, the search range of the random particles in the solution space can be significantly reduced, meaning blindness in the search process can be avoided. By introducing constraint-oriented regularization to allow the optimization search to move out of the inaccurate region, the premature convergence and blurring problems can be mitigated to further guarantee the inversion accuracy and efficiency. We report on three inversion experiments involving multilayered, fluctuated terrain models and a typical complicated inner-interface model to demonstrate the performance of the proposed algorithm. The results of the fluctuated terrain model show that compared with the COPSO algorithm, the fitness error (MAE) of the TVIPSO algorithm is reduced from 2.3715 to 1.0921, while for the complicated inner-interface model the fitness error (MARE) of the TVIPSO algorithm is reduced from 1.9539 to 1.5674. [ABSTRACT FROM AUTHOR]