کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1706500 | 1012463 | 2010 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Ant colony approach to constrained redundancy optimization in binary systems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مکانیک محاسباتی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Ant colony approach to constrained redundancy optimization in binary systems Ant colony approach to constrained redundancy optimization in binary systems](/preview/png/1706500.png)
چکیده انگلیسی
This paper presents an ant colony optimization algorithm to address the constrained redundancy allocation problem in order to maximize system reliability for complex binary systems. The constraints involved, though separable, are both linear and non-linear. We couple an adaptive penalty function with the basic ant colony approach to handle highly constrained problems and embed a local search technique to find still better locally optimal solutions. The proposed algorithm has been tested on a large number of problems, containing even up to 500 subsystems, with both fixed and randomly generated parameters. Experimental results demonstrate the advantage of the proposed algorithm to solve similar types of problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematical Modelling - Volume 34, Issue 4, April 2010, Pages 992–1003
Journal: Applied Mathematical Modelling - Volume 34, Issue 4, April 2010, Pages 992–1003
نویسندگان
Manju Agarwal, Vikas K. Sharma,