The Multi-depot Vehicle Routing Problem of Heterogeneous Fleet of Vehicles with Time Windows for Perishable Commodities
Author(s):
Abstract:
This paper discusses the multi-depot vehicle routing problem of heterogeneous fleet of vehicles with time windows for perishable commodities. The objective of the problem is to minimize the total time required for servicing all customers that is equivalent to the total cost. Commodities are delivered to the customers with defined time windows by a fleet of heterogeneous vehicles, which have limited capacities. The mentioned problem is a more general version of vehicle routing problem (VRP), hence it belongs to NP-complete complexity class and we present a Max-Min ant colony algorithm to solve the model approximately in practical dimensions. Finally, the experimental results have shown that the presented algorithm has appropriate performance in comparison with well-known instances in a reasonable time.
Keywords:
Language:
Persian
Published:
Iranian Journal of Supply Chain Management, Volume:16 Issue: 44, 2014
Page:
14
magiran.com/p1287105
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!