On Convergence of Evolutionary Computation for Stochastic Combinatorial Optimization
Chang, Hyeong Soo
MetadataShow full item record
Extending Rudolph's works on the convergence analysis of evolutionary computation (EC) for deterministic combinatorial optimization problems (COPs), this brief paper establishes a probability one convergence of some variants of explicit-averaging EC to an optimal solution and the optimal value for solving stochastic COPs.
This work was done while he was a visiting associate professor at ECE and ISR, University of Maryland, College Park.