On Convergence of Evolutionary Computation for Stochastic Combinatorial Optimization

Simple item page
dc.contributor.authorChang, Hyeong Soo
dc.date.accessioned2009-10-19T13:15:26Z
dc.date.available2009-10-19T13:15:26Z
dc.date.issued2009-09
dc.descriptionThis work was done while he was a visiting associate professor at ECE and ISR, University of Maryland, College Park.en
dc.description.abstractExtending 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
dc.description.sponsorshipSteve I. Marcus and Michael Fu.en
dc.format.extent333490 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/9687
dc.language.isoen_USen
dc.relation.isAvailableAtInstitute for Systems Researchen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us
dc.relation.ispartofseriesTR_2009-16en
dc.subjectEvolutionary computationen
dc.subjectconvergenceen
dc.titleOn Convergence of Evolutionary Computation for Stochastic Combinatorial Optimizationen
dc.typeTechnical Reporten

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
sleep_edited.pdf
Size:
325.67 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports