A Dual-Objective Nonlinear Model for Network Design with NSGA Algorithm
Article Type:
Research/Original Article (بدون رتبه معتبر)

This study concerns the development of a nonlinear programming model capable of solving an adapted version of a single-objective nonlinear problem. The original problem was adapted via the inclusion of an additional constraint and term in the objective function. The resultant aim is twofold: to optimize a three-level supply chain so as to decrease objective costs (such as shortage periods) while simultaneously increasing customer service levels. Demand is random and the inventory control system continuous. Lost sales due to urgent demand are assumed. After evaluating the formulated mathematical model, a metaheuristic algorithm is developed capable of determining the number of open distribution centers and allocating retailers to these centers. Experiments to evaluate the proposed method's performance are conducted on small to medium-sized problems. Results are compared against those of e-constraint and None Dominated Sorting Genetic Algoritms (NSGA2) (whose parameters are adjusted using the Taguchi method). Final results indicate the superiority of the proposed metaheuristic in comparison to other, competing approaches.

Journal of Advances in Computer Research, Volume:10 Issue: 3, Summer 2019
97 to 114
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 990,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

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