A modified branch and cut algorithm for Bi-level Competitive Location Problem in the Closed Chain
عنوان مقاله: A modified branch and cut algorithm for Bi-level Competitive Location Problem in the Closed Chain
شناسه ملی مقاله: ICIORS11_109
منتشر شده در یازدهمین کنفرانس بین المللی انجمن ایرانی تحقیق در عملیات در سال 1397
شناسه ملی مقاله: ICIORS11_109
منتشر شده در یازدهمین کنفرانس بین المللی انجمن ایرانی تحقیق در عملیات در سال 1397
مشخصات نویسندگان مقاله:
Arsalan Rahmani - Department of mathematics, University of kurdistan
Meysam Hosseini - Department of mathematics, Bijar compus, University of kurdistan
خلاصه مقاله:
Arsalan Rahmani - Department of mathematics, University of kurdistan
Meysam Hosseini - Department of mathematics, Bijar compus, University of kurdistan
In this paper, firstly a class of competitive facility location problems in an integrated forward and reverse logistics network is presented, in which two competing companies successively opened their facilities. Then, customer preferences for choosing an open facilities are applied based on some rules. The problem is formulated as a bi-level competitive maximum capture location problem. Also, we present a method of solution using a modified optimization algorithm based on the branch and cut method. We use a preference function to determine the choice of branching and specialized cuts in a branch and cut tree.
کلمات کلیدی: Bi-level competitive location problem, forward/ reverse logistic, closed supply chain, branch and cut
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/814659/