A BAT ALGORITHM FOR MULTI-PERIOD MULTI-PRODUCT INVENTORY ROUTING PROBLEM WITH BACKHAULS AND SPLIT DELIVERY
Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

Transportation planning and inventory management are among the key problems at the various levels of a supply chain. The integration of transportation and inventory decisions is known as the inventory routing problem (IRP) in the literature. Building upon the reviewed literature, this paper expands an operational combination of the classical routing-inventory problem in the form of a two-level supply chain that includes a multi-period, multi-product inventory-routing coupled with various kinds of fleets with different available capacities called Fleet Size and Mix Vehicle Routing Problem (FSMVRP). In this model, stock out is not allowed. Additionally, two practical and significant features of routing are taken into consideration including: 1- ``backhauls'' in which the Distributor (Vendor) is supposed to provide services for two groups of the customers (linehaul and backhaul costumers), assuming that each one of the vehicles is first unloaded to satisfy the demands of the linehaul customers, and it is later loaded by collecting the loads from the backhaul customers; 2- ``Split delivery'' strategy according to which there is a possibility to provide the services to each customer by at least one vehicle. Due to the varying demands of the customers, it is quite possible for the demands of some customers to be more than the available capacity of one vehicle. Particularly, in the case of urban transportation, several vehicle transitions occur at a demand point. Thus, the split services can help minimize the number of the vehicles used, which in turn will increase environmental sustainability. Therefore, first, a new mathematical model, i.e., a mixed-integer programming (MIP) formulation, is presented for the problem. This problem is a non-deterministic polynomial-time hard (NP-hard). Then, according to the literature on routing-inventory problems, a bat optimization algorithm, whose performance is evaluated by an efficient genetic algorithm, is developed for the first time. At the end, the numerical results obtained by this algorithm are analyzed using the randomized test problems.

Language:
Persian
Published:
Industrial Engineering & Management Sharif, Volume:35 Issue: 2, 2020
Pages:
111 to 125
magiran.com/p2126587  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 990,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
دسترسی سراسری کاربران دانشگاه پیام نور!
اعضای هیئت علمی و دانشجویان دانشگاه پیام نور در سراسر کشور، در صورت ثبت نام با ایمیل دانشگاهی، تا پایان فروردین ماه 1403 به مقالات سایت دسترسی خواهند داشت!
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!