کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
2076728 | 1079462 | 2008 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Cooperative combinatorial optimization: Evolutionary computation case study
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
مدلسازی و شبیه سازی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
This paper presents a formalization of the notion of cooperation and competition of multiple systems that work toward a common optimization goal of the population using evolutionary computation techniques. It is proved that evolutionary algorithms are more expressive than conventional recursive algorithms, such as Turing machines. Three classes of evolutionary computations are introduced and studied: bounded finite, unbounded finite, and infinite computations. Universal evolutionary algorithms are constructed. Such properties of evolutionary algorithms as completeness, optimality, and search decidability are examined. A natural extension of evolutionary Turing machine (ETM) model is proposed to properly reflect phenomena of cooperation and competition in the whole population.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Biosystems - Volume 91, Issue 1, January 2008, Pages 34-50
Journal: Biosystems - Volume 91, Issue 1, January 2008, Pages 34-50
نویسندگان
Mark Burgin, Eugene Eberbach,