Reservoir Operation Optimization using Stochastic Adaptive Refinement of Ant Algorithms

Message:
Abstract:
The Algorithm of the Ant Colony Optimisation (ACO) is basically developed and used for discrete optimization problems. However many real engineering problems such as reservoir operation problems are of a continuous nature and using ant based algorithms on such problems requires discretisation of the decision variables. An adaptive refinement mechanism is suggested in this paper to improve the performance of ant algorithms in solving continuous optimization problems. This is an iterative method starting with a uniform discretisation of the search space. A Gaussian distribution is used for discretisation of the decision variables in the subsequent iterations. The average and standard deviation of the Gaussian distribution is computed in each iteration using the optimal solution obtained in the previous iterations. The proposed mechanism was used to solve some benchmark function optimization problems and a reservoir operation problem. The results indicated the efficiency and effectiveness of the proposed method to improve the performance of the ant algorithms for continuous optimization problems.
Language:
Persian
Published:
Iran Water Resources Research, Volume:6 Issue: 1, 2010
Page:
1
magiran.com/p897425  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!