Multi-objective Optimization Strategies based on Decomposition for the Design of Water Distribution Systems

Author(s):
Abstract:
The use of Pareto dominance for evaluating the solutions has been the mainstream in evolutionary multi objective optimization for the last two decades. An alternative is multi objective evolutionary algorithm based on decomposition (MOEA/D) which uses scalarizing the objective functions. In this paper, decomposition strategies are developed for water distribution network (WDN) design problems by integrating the concepts of genetic algorithm (GA) within the MOEA/D framework. The proposed algorithms are then compared with the two well-known non-dominance based MOEAs: NSGA2, and SPEA2. This comparison is made by plotting the Pareto fronts and evaluating the hyper-volume and two-set coverage metrics across two large scale WDN design problems. Experimental results show that MOEA/D outperform the Pareto dominance methods in terms of both non-domination and diversity criteria. It suggests that decomposition based multi objective evolutionary algorithms are very promising in dealing with real-world water engineering optimization problems.
Language:
Persian
Published:
Journal of Hydraulics, Volume:10 Issue: 3, 2015
Pages:
27 to 40
magiran.com/p1539751  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!