Distribution-based adaptive bounding genetic algorithm for continuous optimisation problems

DOI10.1016/J.AMC.2006.07.022zbMATH Open1117.65091OpenAlexW2023510399MaRDI QIDQ872365FDOQ872365

Kang Li, Steve Thompson, Jian-Xun Peng, Peter A. Wieringa

Publication date: 27 March 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.07.022

zbMATH Keywords

convergencenumerical examplesrobustnessgenetic algorithmsill-posed problemscomparison of methodsadaptive boundingcontinuous optimisation problemsparameter space size adjustmentsuccessive zooming genetic algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Stochastic programming (90C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Genetic algorithms. Concepts and designs
• 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

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 that?)
• Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time

Uses Software

• GAToolBox

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)