Multistage distribution system expansion planning considering distributed generation using hybrid evolutionary algorithms

In this paper, the Authors present the designing of power system stabilizer (PSS) and static var compensator (SVC) based on chaos, particle swarm optimization (PSO) and shuffled frog leaping (SFL) Algorithms has been presented to improve the power system stability. Single machine infinite bus (SMIB) system with SVC located at the terminal of generator has been considered to evaluate the proposed SVC and PSS controllers. The coefficients of PSS and SVC controller have been optimized by Chaos, PSO and SFL algorithms. Fi-nally the system with proposed controllers is simulated for the special disturbance in input power of genera-tor, and then the dynamic responses of generator have been presented. The simulation results show that the system composed with recommended controller has outstanding operation in fast damping of oscillations of power system and describes an application of Chaos, PSO and SFL algorithms to the problem of designing a Lead-Lag controller used in PSS and SVC in power system.

A novel image watermark scheme based on the shuffled frog leaping (SFL) algorithm is proposed in the paper. The watermark is embedded to the discrete multi wavelet transform (DMT) coefficients larger than some threshold values, and watermark extraction is efficiently performed with SFL algorithm. Experimental results show both the robustness under attacks and the improvement in watermarked image quality with the proposed SFL algorithm.

Novel Artificial Human Optimization Field Algorithms - The Beginning

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

Production scheduling optimization in foundry using hybrid Particle Swarm Optimization algorithm

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.

Biclustering of DNA microarray data that can mine significant patterns to help in understanding gene regulation and interactions. This is a classical multi-objective optimization problem (MOP). Recently, many researchers have developed stochastic search methods that mimic the efficient behavior of species such as ants, bees, birds and frogs, as a means to seek faster and more robust solutions to complex optimization problems. The particle swarm optimization(PSO) is a heuristics-based optimization approach simulating the movements of a bird flock finding food. The shuffled frog leaping algorithm (SFLA) is a population-based cooperative search metaphor combining the benefits of the local search of PSO and the global shuffled of information of the complex evolution technique. This paper introduces SFL algorithm to solve biclustering of microarray data, and proposes a novel multi-objective shuffled frog leaping biclustering(MOSFLB) algorithm to mine coherent patterns from microarray data. Experimental results on two real datasets show that our approach can effectively find significant biclusters of high quality.

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.

Particle Swarm Optimization (PSO) technique has proved its ability to deal with very complicated optimization and search problems. Several variants of the original algorithm have been proposed. This paper proposes a novel hybrid PSO – evolutionary algorithm for solving the well known geometrical place problems. Finding the geometrical place could be sometimes a hard task. In almost all situations the geometrical place consists more than one single point. The performance of the newly proposed PSO algorithm is compared with evolutionary algorithms. The main advantage of the PSO technique is its speed of convergence. Also, we propose a hybrid algorithm, combining PSO and evolutionary algorithms. The hybrid combination is able to detect the geometrical place very fast for which the evolutionary algorithms required more time and the conventional PSO approach even failed to find the real geometrical place.

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.

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, the optimal dynamic scheduling of electric vehicles (EVs) in a parking lot (PL) is proposed to minimize the charging cost. In static scheduling, the PL operator can make the optimal scheduling if the demand, arrival, and departure time of EVs are known well in advance. If not, a static charging scheme is not feasible. Therefore, dynamic charging is preferred. A dynamic scheduling scheme means the EVs may come and go at any time, i.e., EVs’ arrival is dynamic in nature. The EVs may come to the PL with prior appointments or not. Therefore, a PL operator requires a mechanism to charge the EVs that arrive with or without reservation, and the demand for EVs is unknown to the PL operator. In general, the PL uses the first-in-first serve (FIFS) method for charging the EVs. The well-known optimization techniques such as particle swarm optimization and shuffled frog leaping algorithms are used for the EVs’ dynamic scheduling scheme to minimize the grid’s charging cost. Moreover, a microgrid is also considered to reduce the charging cost further. The results obtained show the effectiveness of the proposed solution methods.

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.

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.