Chang, Hyeong SooThis work was done while he was a visiting associate professor at ECE and ISR, University of Maryland, College Park.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.en-USEvolutionary computationconvergenceTechnical Report