This paper presents bit masking oriented genetic algorithm (BMOGA) for context free grammar induction. It takes the advantages of crossover and mutation mask-fill operators together with a Boolean based procedure in two phases to guide the search process from ith generation to (i + 1)th generation. Crossover and mutation mask-fill operations are performed to generate the proportionate amount of...

Genetic algorithm is an evolutionary algorithm. It is particularly suitable for solving NP-complete optimization problems. In this paper, we propose a rapid genetic algorithm based on chaos mechanism. We introduce the chaos mechanism into the genetic algorithm. Using the ergodic property of the chaos movement, this method can remedy the defect of premature convergence in the genetic algorithm. ...

This paper presents a novel hybrid evolutionary algorithm that combines Particle Swarm Optimization (PSO) and Simulated Annealing (SA) algorithms. When a local optimal solution is reached with PSO, all particles gather around it, and escaping from this local optima becomes difficult . To avoid premature convergence of PSO, we present a new hybrid evolutionary algorithm, called PSOSA, based on t...

Local search algorithms are widely adopted in solving large-scale Distributed Constraint Optimization Problems (DCOPs). However, since each agent always makes its value decision based on the values of its neighbors in local search, those algorithms usually suffer from local premature convergence. More concretely, an agent cannot make a wise decision with poor values of its neighbors since its d...

In order to improve the problem of premature convergence and computational efficiency of traditional differential evolution algorithm in solving high-dimensional problems, an improved differential evolution (HMSDE) algorithm based on combing elite synergy strategy, multi-population strategy and dynamic adaptive strategy is proposed in this paper. In the proposed HMSDE algorithm, the population ...

Dynamic Design Optimization (DDO) of various engineering problems exhibit multiple optima in the feasible domain. Such problems can be posed as complex multimodal optimization problems. Application of traditional optimization techniques to such problems is computationally expensive with a high risk of getting trapped into a local optimum. Similarly, Genetic Algorithms (GA) suffer from premature...

The quantum particle swarm optimization (QPSO) algorithm exists some defects, such as premature convergence, poor search ability and easy falling into local optimal solutions. The adaptive adjustment strategy of inertia weight, chaotic search method and neighborhood mutation strategy are introduced into the QPSO algorithm in order to propose an improved quantum particle swarm optimization (AMCQ...

In order to improve the optimum speed, crease the diversity of the population and overcome the premature convergence problem in differential evolution(DE) algorithm for solving the complex optimization problems, the chaotic optimization algorithm with powerful local searching capacity and multistrategy are introduced into the DE algorithm in order to propose an improved adaptive differential ev...

Particle Swarm Optimization (PSO) is a very popular optimization technique, but it suffers from a major drawback of a possible premature convergence i.e. convergence to a local optimum and not to the global optimum. This paper attempts to improve on the reliability of PSO by addressing the drawback. This problem of premature convergence is more probable with the problems, which have the global ...