An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization
From MaRDI portal
Publication:5960695
DOI10.1016/S0965-9978(00)00070-3zbMath0985.68572OpenAlexW1979796923WikidataQ126803005 ScholiaQ126803005MaRDI QIDQ5960695
No author found.
Publication date: 20 May 2002
Published in: Advances in Engineering Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0965-9978(00)00070-3
Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (16)
Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution ⋮ Differential Evolution Via Exploiting Opposite Populations ⋮ A two-stage algorithm for identification of nonlinear dynamic systems ⋮ Availability allocation and multi-objective optimization for parallel--series systems ⋮ Distribution-based adaptive bounding genetic algorithm for continuous optimisation problems ⋮ A sequential designing-modeling technique when the input factors are not equally important ⋮ Some Guidelines for Genetic Algorithm Implementation in MINLP Batch Plant Design Problems ⋮ DNA optimization threshold autoregressive prediction model and its application in ice condition time series ⋮ Uniform design over general input domains with applications to target region estimation in computer experiments ⋮ Mathematical and metaheuristic applications in design optimization of steel frame structures: an extensive review ⋮ Improving genetic algorithms' performance by local search for continuous function optimization ⋮ A staged continuous tabu search algorithm for the global optimization and its applications to the design of fiber Bragg gratings ⋮ Quasi-random initial population for genetic algorithms ⋮ Parent-centric differential evolution algorithm for global optimization problems ⋮ A novel population initialization method for accelerating evolutionary algorithms ⋮ A comparative study of some real-coded genetic algorithms for unconstrained global optimization
This page was built for publication: An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization
