In this paper, we propose a biased random key genetic algo- rithm for finding approximate solutions for bound-constrained continuous global optimization problems subject to linear constraints. Experimental results ill...
详细信息
ISBN:
(纸本)9781450319645
In this paper, we propose a biased random key genetic algo- rithm for finding approximate solutions for bound-constrained continuous global optimization problems subject to linear constraints. Experimental results illustrate its effectiveness on the g01 and g14 problems from CEC2006 benchmark [5].
暂无评论