A novel population initialization method for accelerating evolutionary algorithms

DOI10.1016/j.camwa.2006.07.013zbMath1152.90672WikidataQ115461281 ScholiaQ115461281MaRDI QIDQ2519634

Magdy M. A. Salama, Hamid R. Tizhoosh, Shahryar Rahnamayan

Publication date: 27 January 2009

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.07.013

zbMATH Keywords

global optimization; evolutionary algorithms; opposition-based learning; differential evolution (DE); random initialization

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Opposition-Based Computing, Improving the Exploration Ability of Ant-Based Algorithms, Differential Evolution Via Exploiting Opposite Populations, Evolving Opposition-Based Pareto Solutions: Multiobjective Optimization Using Competitive Coevolution, An opposition-based chaotic GA/PSO hybrid algorithm and its application in circle detection, Quantum behaved particle swarm optimization with neighborhood search for numerical optimization, An evolutionary strategy based on partial imitation for solving optimization problems, A hybrid genetic approach for solving an integrated multi-objective operating room planning and scheduling problem, Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space, Shrimp feed formulation via evolutionary algorithm with power heuristics for handling constraints, MAKHA -- a new hybrid swarm intelligence global optimization algorithm, Extended prey-predator algorithm with a group hunting scenario, A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization, Enhancing the performance of differential evolution using orthogonal design method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differential evolution. A practical approach to global optimization. With CD-ROM.
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• A trigonometric mutation operation to differential evolution
• Simple explanation of the no-free-lunch theorem and its implications
• Quasi-random initial population for genetic algorithms
• Advances in computational intelligence. Theory and practice
• Implementation and tests of low-discrepancy sequences
• An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization