A branch and cut algorithm for the Undirected Profitable Location Rural Postman Problem

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

This paper is concerned with presenting an exact algorithm for the Undirected Profitable Location Rural Postman Problem. This problem combines the profitable rural postman and facility location problems and also has some interesting real-life applications. Fixed costs are associated with end points of each profitable edge and the objective is to choose a subset of profitable edges such that the difference between the profit collected and the cost of opening facilities and traveling cost is maximized. A dominance relation is used to present an integer programming formulation for the problem and a branch and cut algorithm is developed for solving the problem and extensive numerical results on real-world benchmark instances are given to evaluate the quality of presented algorithms.

Language:
English
Published:
Iranian Journal Of Operations Research, Volume:12 Issue: 1, Winter and Spring 2021
Pages:
173 to 183
magiran.com/p2427956  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!