University of Maryland DRUM  
University of Maryland Digital Repository at the University of Maryland

DRUM >
Institute for Systems Research >
Institute for Systems Research Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1903/9687

Title: On Convergence of Evolutionary Computation for Stochastic Combinatorial Optimization
Authors: Chang, Hyeong Soo
Type: Technical Report
Keywords: Evolutionary computation
convergence
Issue Date: Sep-2009
Series/Report no.: TR_2009-16
Abstract: 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.
Description: This work was done while he was a visiting associate professor at ECE and ISR, University of Maryland, College Park.
URI: http://hdl.handle.net/1903/9687
Appears in Collections:Institute for Systems Research Technical Reports

Files in This Item:

File Description SizeFormatNo. of Downloads
sleep_edited.pdf325.67 kBAdobe PDF2View/Open

All items in DRUM are protected by copyright, with all rights reserved.

 

DRUM is brought to you by the University of Maryland Libraries
University of Maryland, College Park, MD 20742-7011 (301)314-1328.
Please send us your comments. -
All Contents