Solving Split Delivery Location Routing Problem Using Simulated Annealing Algorithm
Author(s):
Message:
Abstract:
The most challenging problems in Supply Chain Management are Facility Location Problem (FLP) and Vehicle Routing Problem (VRP) which considering these two in separate, results in larger costs and planning time. Therefore, Location Routing Problem (LRP) will be addressed by considering VRP and FLP in SCM simultaneously. Company managers always face this problem whether serving each costumer’s demands by one vehicle ends in higher benefits or delivering their demands by more than one vehicle. Answering this issue needs comparing the obtained costs of LRP to the obtained costs of Split Delivery Location Routing Problem (SDLRP). This article presents a mixed-integer linear programming model of SDLRP. The mathematical model of this problem has never been seen in any article. Since it’s a NP-hard problem, the proposed model is run by cplex10.1 software for the small size instances, and for the large size instances, two algorithms, tabu search and simulated annealing are presented. After generating the new experimental instances, the numerical results of problem solving using cplex10.1 software and the suggested algorithms are analyzed. The results show the efficiency of the two algorithms, Tabu search and simulated annealing, and superiority of SA algorithm over TS algorithm, meaning that for most instances, the SA algorithm finds better solutions in a shorter period of time for large size instances. The results also show that considering the assumption of split delivery of customers’ demand leads to final cost reduction, especially when the demand variance is relatively small and the mean demand is greater than half the vehicle capacity but less than three quarters of the vehicle capacity.
Language:
Persian
Published:
Journal of Transportation Research, Volume:14 Issue: 2, 2017
Page:
307
magiran.com/p1743165  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!