Evolutionary algorithm for multi-objective multi-index transportation problem under fuzziness

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

An Improved Genetic Algorithm (I-GA) for solving multi-objective Fuzzy Multi–Index Multi-objective Transportation Problem (FM-MOTP) is presented. Firstly, we introduce a new structure for the individual to be able to represent all possible feasible solutions. In addition, in order to keep the feasibility of the chromosome, a criterion of the feasibility was designed. Based on this criterion, the crossover and mutation were modified and implemented to generate feasible chromosomes. Secondly, an external archive of Pareto optimal solutions is used, which best conform a Pareto front. For avoiding an overwhelming number of solutions, the algorithm has a finite-sized archive of non-dominated solutions, which is updated iteratively at the presence of new solutions. Finally, the computational studies using two numerical problems, taken from the literature, demonstrate the effectiveness of the proposed algorithm to solve FM-MOTP Problem under fuzziness.

Language:
English
Published:
Journal of Applied Research on Industrial Engineering, Volume:7 Issue: 1, Winter 2020
Pages:
36 to 56
https://magiran.com/p2117303  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!