A Mathematical Model Based on Capacitated Vehicle Routing Problem with Time Lapses for Garbage Collection

Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Producing various types of waste and related environmental problems, has faced urban management with many problems in the areas like: collection, transportation and waste disposal. Applying a good way to reduce the costs of collecting waste seems necessary, because collection and transportation of the waste needs allocation of a significant part of garbage management budget. In the present study, a mathematical model is presented for waste collection by which we can reduce the costs of collecting the waste by minimizing the distance for the trucks. The model is flexible enough to manage collecting the waste of a node in different separate times. Then, some small-scale issues were solved using CPLEX software and meta-heuristic algorithm and the results were compared. The data for the case study were collected and the meta-heuristic algorithm was used to determine the vehicle schedule. Finally, a mathematical model was used to decide about the number of vehicles required
Language:
Persian
Published:
Journal of Industrial Management, Volume:9 Issue: 24, 2017
Pages:
147 to 166
magiran.com/p1766881  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!