A mathematical model for scheduling of transportation, routing, and cross-docking in the reverse logistics network of the green supply chain

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

Cross-docking refers to the practices of unloading materials from inbound vehicles and then loading them directly into outbound ones. Removing or minimizing warehousing costs, space requirements, as well as inventory utilization, cross-docking simplifies supply chains and makes them deliver goods to markets in a faster and more efficient manner. Accordingly, a mixed-integer linear programming ($MILP $) model is developed in the present study to schedule transportation routing and cross-docking in a reverse logistics network ($RLN$). Furthermore, different traffic modes are also considered to reduce fuel consumption, which reduces emissions and pollution. The proposed model is a multi-product, multi-stage, and non-deterministic polynomial-time that is an NP-hard problem. We use the non-dominated sorting genetic algorithm II ($NSGA-II$) to solve the model. A numerical example has been solved to illustrate the efficiency of the method.

Language:
English
Published:
International Journal Of Nonlinear Analysis And Applications, Volume:12 Issue: 2, Summer-Autumn 2021
Pages:
1909 to 1927
magiran.com/p2330067  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!