Competitive Production Routing Problem: Modeling, Solving and Valid Inequalities

Author(s):
Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Transportation is an important factor in the economic, production and service systems and it has allocated a significant portion of the gross domestic product (GDP) of any country. Production routing problem is development of the traveling salesman and vehicle routing problems in which scheduling and production planning are considered too. Generally, in the above problems it is assumed that there is a monopoly and the impact of competitors has not been considered. In this paper, for creating competitive condition, it is assumed that the earliest and latest time of competitor arrival is known. After modeling problem as mixed intger programming, valid inequalities are proposed, and their effects on the model have been investigated by the CPLEX software. These inequalities are provided for production routing problem with homogeneous and heterogeneous vehicles, separately. To evaluate the performance of the proposed valid inequalities, the results of them have been compared
Language:
Persian
Published:
Journal of Modern Research in Decision Making, Volume:3 Issue: 2, 2018
Pages:
55 to 79
magiran.com/p1879001  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!