On modification of population-based search algorithms for convergence in stochastic combinatorial optimization
DOI10.1080/02331934.2014.883511zbMATH Open1337.90053OpenAlexW2010702499MaRDI QIDQ2808309FDOQ2808309
Authors: Hyeong Soo Chang 
Publication date: 23 May 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.883511
Recommendations
- On the convergence of a population-based global optimization algorithm
- Stochastic Algorithms: Foundations and Applications
- Accelerating the convergence of random search methods for discrete stochastic optimization
- Variable-sample methods for stochastic optimization
- scientific article; zbMATH DE number 1857676
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Stochastic programming (90C15) Stochastic learning and adaptive control (93E35)
Cites Work
- Asymptotically efficient adaptive allocation rules
- Finite-time analysis of the multiarmed bandit problem
- The sample average approximation method for stochastic discrete optimization
- Efficient algorithms for online decision problems
- Simulated annealing for noisy cost functions
- Convergence results for single-step on-policy reinforcement-learning algorithms
- Ordinal optimisation and simulation
- Evolutionary Policy Iteration Under a Sampling Regime for Stochastic Combinatorial Optimization
- Recent trends in metaheuristics for stochastic combinatorial optimization
Cited In (2)
This page was built for publication: On modification of population-based search algorithms for convergence in stochastic combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808309)
