کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
475346 | 699291 | 2009 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Extended ant colony optimization for non-convex mixed integer nonlinear programming
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Extended ant colony optimization for non-convex mixed integer nonlinear programming Extended ant colony optimization for non-convex mixed integer nonlinear programming](/preview/png/475346.png)
چکیده انگلیسی
Two novel extensions for the well known ant colony optimization (ACO) framework are introduced here, which allow the solution of mixed integer nonlinear programs (MINLPs). Furthermore, a hybrid implementation (ACOmi) based on this extended ACO framework, specially developed for complex non-convex MINLPs, is presented together with numerical results.These extensions on the ACO framework have been developed to serve the needs of practitioners who face highly non-convex and computationally costly MINLPs. The performance of this new method is evaluated considering several non-convex MINLP benchmark problems and one real-world application. The results obtained by our implementation substantiate the success of this new approach.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 36, Issue 7, July 2009, Pages 2217–2229
Journal: Computers & Operations Research - Volume 36, Issue 7, July 2009, Pages 2217–2229
نویسندگان
Martin Schlüter, Jose A. Egea, Julio R. Banga,