A Hybrid Particle Swarm Optimization Algorithm for Predicting the Chaotic Time Series

Production scheduling optimization in foundry using hybrid Particle Swarm Optimization algorithm

In this paper, we present a Hybrid Particle Swarm Optimization (HPSO) algorithm that combines the Particle Swarm Optimization (PSO) algorithm with the Genetic Algorithm (GA) method. The algorithm is used for investigating the plastic deformation behavior of titanium alloy (Ti-6Al-4V) in a multi-hole extrusion process. The simulation used rigid-plastic finite element (FE) DEFORMTM-3D software to obtain the minimum mandrel bias angle and exit tube bending angle. Results of the simulation indicate that these two angles were significantly less than 0.3 degrees, suggesting that metaheuristic algorithms based on HPSO and FE analysis could be used for general multi-hole extrusion processes.KeywordsMulti-hole extrusionParticle Swarm OptimizationFinite elementGenetic Algorithm

A good exploration ability can ensure that the method jumps out of local optimum in multimodal problems and a good exploitation can ensure an algorithm converge faster to global optimum values. So, this paper proposes a new hybrid sperm swarm optimization and genetic algorithm to obtain global optimal solutions termed HSSOGA which is developed based on the concept of balancing the exploration and exploitation capability by merging Sperm Swarm Optimization (SSO), which has a fast convergence rate, and a Genetic Algorithm (GA) that can explore a search domain efficiently. To ensure that the proposed method delivers good performance, it is evaluated with 11 standard test function problems consisting of 5 unimodal and 6 multimodal functions. The proposed HSSOGA set is compared with conventional GA and SSO methods, as well as with several hybrid methods such as Hybrid Firefly and Particle Swarm Optimization (HFPSO), hybrid Simulated Annealing and Genetic Algorithm (SAGA), Hybrid Particle Swarm Optimization and Genetic Algorithm (HFPSO), hybrid Particle Swarm Optimization and Grey Wolf Optimization (PSOGWO), and closely related Hybrid Sperm Swarm Optimization and Gravitational Search Algorithm (HSSOGSA). The results are evaluated in terms of each method’s best fitness, mean, standard deviation, and convergence rates. The numerical experiment results show that HSSOGA has better convergence towards the true global optimum values as compared to the conventional and existing hybrid methods in most unimodal and multimodal test function problems.

A large project in a company is often divided to several subtasks, which would be assigned to different people with variant abilities to the same task. So whether the tasks are scheduled properly would determine the quality or the efficiency of team collaboration. A hybrid particle swarm optimization (PSO) algorithm is putted forward. Subtasks are disassembled from the project by using the task tree relations, and the tree structure is modeled into a task matrix. Moreover, task-time matrix is used to indicate the people abilities to complete the tasks. Then the hybrid algorithm was presented, in which simulated annealing method is added in particle swarm optimization to improve the capability of seeking the best allocating results. Finally, a simulation experiment is carried out by using the proposed algorithm, the comparing results show that the convergent velocity is fast and the optimizing ability is preferable.

Novel Artificial Human Optimization Field Algorithms - The Beginning

Network-on-chip (NoC) has been proposed as a solution for the global communication challenges of system-on-chip (SoC) design in the nanoscale technologies. In this paper, a methodology is presented to develop an efficient routing algorithm for network-on-chip platforms that are specialized for an application or a set of concurrent applications. The proposed routing methodology, based on the hybrid particle swarm optimization (PSO) Algorithm, is applied on the 2D-mesh NoC platform to balance the link load. Experimental results show that this routing algorithm can efficiently assign deterministic, deadlock-free, minimal routing paths for traffic traces in a short period of time, and significantly guarantee the bandwidth requirement. In addition, the Hybrid PSO is combined with the operations of GA Algorithm, so that the algorithm achieves better performance.

In this paper, we present a parallel machine scheduling with shared and multi-mode resources (PMS-SMR) problem which is widely encountered in manufacturing engineering. The integer programming for this problem is given and a hybrid particle swarm optimization (HPSO) algorithm is put forward with a problem-based solution representation and a balancing optimization (BO)-based local search. The HPSO algorithm can be applied to obtain the best permutation of the fitness function with least-makespan optimization criterion. Experimental results show that it is feasible and effective, especially in solving large-scale problems.

Hybrid particle swarm optimization algorithm for scheduling flexible assembly systems with blocking and deadlock constraints

Adaptive equalization mitigates the distortions caused by radio channels. The least mean square (LMS) and the recursive least squares (RLS) algorithms are used for such purpose. Recently, particle swarm optimization (PSO) algorithms such as PSO using a linear time decreasing inertia weight (PSO-W) and the PSO using constant constriction factor (PSO-CCF) were shown to be very effective in handling systems having nonlinear behavior. However, these algorithms can be trapped in local minima. This paper presents a new PSO-based algorithm called the hybrid PSO (HPSO) that is capable to handle such problems. The HPSO includes the randomization of particles to improve the search capacity of the swarm, which in turn reduces the probability of being trapped in some local minima. It also adapts the inertia weight assignment to the particles. Extensive simulation results are conducted to confirm the consistency in the performance of the HPSO algorithm in different scenarios. The proposed HPSO secures the minimum steady-state error as compared to LMS and other PSO-based algorithms in both nonlinear and linear channels. Finally, the proposed HPSO algorithm shows a great improvements in Bit Error Rate and convergence rate.

Early detection and prediction of fatal heart diseases can be useful for medical diagnosis and rehabilitation. In this study, a hybridized Particle Swarm Optimization (PSO) and Radial Basis Function Neural network (RBFN) model has been proposed to improve cardiac arrhythmia prediction accuracy. The performance of RBFN is very sensitive to parameter such as spread. In RBFN training process, the spread is optimized using PSO. In the proposed method a set of linear and non-linear features are extracted from the RR interval time series datasets, which are derived from the MIT-BIH arrhythmia database. Experiments are carried out on the heart rate (RR Interval) time series to predict the eight types of cardiac signals that contain normal and abnormal rhythms. The obtained results suggest that PSO-RBFN model may be an efficient tool to achieve enhancements in terms of prediction accuracy for diagnosis of cardiac disorders. The hybrid PSO-RBFN model yielded an overall prediction accuracy of 96.3%.

The particle swarm optimization (PSO) algorithm presents a new way for finding optimal solutions of complex optimization problems. In this paper a modified particle swarm optimization algorithm is presented. We modify the PSO algorithm in some aspects. Firstly, a contractive factor is introduced to the position update equation, and the particles are limited in search region. A new strategy for updating velocity is then adopted, in which the velocity is weakened linearly. Thirdly, using an idea of intersecting two modified PSO algorithms. Finally, adding an item of integral control in the modified algorithm can improve its global search ability. Based on these strategies, we proposed a new PSO algorithm named crossed PSO algorithm. Simulation results show that the crossed PSO is superior to the original PSO algorithm and can get overall promising performance over a wide range of problems.

A multi-compartment vehicle routing problem with time windows for urban distribution – A comparison study on particle swarm optimization algorithms

Purpose – The ultimate objective of the any e-Learning system is to meet the specific need of the online learners and provide them with various features to have efficacious learning experiences by understanding their complexities. Any e-Learning system could be much more improved by tracking students commitment and disengagement on that course, in turn, would allow system to have personalized involvements at appropriate times in order to re-engage learners. Motivations play a important role to get back the learners on the track could be done by analyzing of several attributes of the log files. This paper aims to analyze the multiple attributes which cause the learners to disengage from an online learning environment. Design/methodology/approach – For this improvisation, Web based learning system is researched using data mining techniques in education. There are various attributes characterized for the disengagement prediction using web log file analysis. Though, there have been several attempts to include motivating characteristics in e-Learning systems are adapted, presently influence on cognition is acknowledged mostly. Findings – Classification is one of the predictive data mining technique which makes prediction about values of data using known results found from different data sets. To find out the optimal solution for identifying disengaged learners in the online learning systems, Naive Bayesian (NB) classifier with Particle Swarm Optimization (PSO) algorithm is used which will classify the data set and then perform the independent analysis. Originality/value – The experimental results shows that the use of unrelated variables in the class attributes will reduce the accuracy and reliability of a any classification model. However, the hybrid PSO algorithm is clearly more apt to find minor subsets of attributes than the PSO with NB classifier. The NB classifier combined with hybrid PSO feature selection method proves to be the best feature selection capability without degrading the classification accuracy. It is further proved to be an effective method for mining large structural data in much less computation time.

Fault diagnosis for wireless sensor is very important to ensure signal acquisition precision. Radial basis function (RBF) neural network has strong classification ability. However, the selection of the connection weights, the hidden centers and the widths has an important influence on the classification performance of the RBF neural network in the learning process of RBF neural network. Thus, ant colony optimization is employ to gain the parameters of radial basis function neural network. Therefore, a novel method for fault diagnosis of wireless sensor based on RBF neural network and ant colony optimization is presented. The results of computational experiments show that ACO- RBF neural network has a great higher than RBF neural network.

Hybrid particle swarm optimization (PSO) is such a kind of algorithms, which combine other algorithms or technologies to enhance the basic PSO. This paper compares three representative hybrid PSOs: breeding PSO, immune PSO, and chaos PSO. These comparisons are carried out in following aspects: the goals for hybrid, basic hybrid modes, the key implementation steps, optimization performances and so on. Through these comparisons and analysis, three hybrid algorithms' construction, implementation and respective application scope are summarized, especially, the optimization performances of three hybrid PSOs have been researched carefully. The goal is to find features of the three HPSOs and provide some guidence to develop new kinds of HPSO.