Multiobjective Waste Load Allocation Using Multicolony Ant Algorithm

Message:
Abstract:
In this research, the capability of a multicolony Ant Colony Optimization algorithm is applied to multiobjective waste load allocation problem. In order to derive nondominated solutions, three different models are used. Two of them are biobjective and the remaining one is a three-objective model. In the first model, minimization of cost and DO violation along the stream flow is considered as multi objective optimization problem, while for the second case, minimization of the cost and equity is investigated. For the third optimization problem, minimization of cost along with equity and DO violation are considered. For the all case studies, the Pareto front is derived which enhances the decision maker to choose one which more suitable for him/her according to the priorities. The case study is the Wilmate river in Oregon State of US. The following research shows the capability of NAACO in multiobjective optimization of waste load allocation problem. According to the discrete pattern of decision variables in the ACO algorithm, it can be easily map to practical waste load allocation problems.
Language:
Persian
Published:
Iran Water Resources Research, Volume:6 Issue: 2, 2010
Page:
1
https://magiran.com/p897399  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!