Distribution-based adaptive bounding genetic algorithm for continuous optimisation problems
From MaRDI portal
Publication:872365
Recommendations
- Genetic algorithms for continuous optimization problems - a concept of parameter-space size adjustment
- Matching inductive search bias and problem structure in continuous Estimation-of-Distribution Algorithms
- Adaptive genetic strategy with continuous mutation
- The dynamics of a changing range genetic algorithm
- THE PERFORMANCE OF GENETIC ALGORITHM WITH ADJUSTMENT OF A SEARCH SPACE
Cites Work
- scientific article; zbMATH DE number 1573291 (Why is no real title available?)
- scientific article; zbMATH DE number 2154249 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- A hybrid genetic algorithm for estimating the optimal time scale of linear systems approximations using Laguerre models
- An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization
- Genetic algorithms. Concepts and designs
Cited In (3)
- Inversion of groundwater contamination source based on a two-stage adaptive surrogate model-assisted trust region genetic algorithm framework
- Title not available (Why is no real title available?)
- Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time
Uses Software
This page was built for publication: Distribution-based adaptive bounding genetic algorithm for continuous optimisation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q872365)