Optimization technique based on learning automata

DOI10.1007/BF00939452MaRDI QIDQ1263535zbMATH OpenFDO

Authors K. Appert

Publication date 1990

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00939452

zbMATH Keywords

chemical engineeringlarge-scale constrainedlearning systemsnonconvex programmingoptimizationprocess designprocess synthesissimulations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Learning and adaptive systems in artificial intelligence (68T05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Applications of mathematical programming (90C90)

Review text

See the preview in Zbl 0666.90088.

Cited in

(10)

• Synthesis of the \(\beta\)-distribution as an aid to stochastic global optimization
• Learning from positive and negative examples: dichotomies and parameterized algorithms
• Integrated crossover rules in real coded genetic algorithms
• A differential free point generation scheme in the differential evolution algorithm
• A learning automata based algorithm for optimization of continuous complex functions
• Reinforcement learning control using interconnected learning automata
• Probabilistic adaptations of point generation schemes in some global optimization algorithms
• Learning from positive and negative examples: new proof for binary alphabets
• Transshipment service through crossdocks with both soft and hard time windows
• Some variants of the controlled random search algorithm for global optimization

This page was built for publication: Optimization technique based on learning automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1263535)