مکان‌یابی رقابتی ترتیبی با در نظر گرفتن قابلیت اطمینان و گرانشی

نوع مقاله : پژوهشی

نویسندگان

گروه مهندسی صنایع، دانشکده فنی و مهندسی، دانشگاه الزهرا، تهران، ایران

چکیده

این مقاله به بررسی و حل مسئله مکان‌یابی رقابتی با در نظر گرفتن قابلیت اطمینان پرداخته است. قابلیت اطمینان به‌صورت احتمال خارج شدن هر تسهیل از سرویس‌دهی به مشتریان در نظر گرفته‌شده است. دو شرکت به ترتیب مکان بهینه تسهیلات خود را تعیین می‌کنند. مسئله به‌صورت بازی استاکلبرگ مدل شده که رهبر و پیرو به ترتیب مکان‏های خود جهت ایجاد تهسیل را انتخاب می‏کنند. هدف هریک از رقبا حداکثر کردن سود است. پارامترهای جمعیتی به عنوان فاکتورهای مؤثر در انتخاب مکان و رفتار مشتریان در انتخاب هر یک از تسهیلات متأثر از پارامتر کیفی و فاصله در نظر گرفته‌شده است. جهت حل مسئله با توجه به Np-hard بودن آن برای حل مسائل بزرگ و متوسط از الگوریتم فرا ابتکاری NSGAII و برای مسائل کوچک از روش جستجوی کامل فضای جواب استفاده ‌شده است. در پایان مسائل عددی به‌صورت تصادفی تولیدشده جواب‌های بهینه پارتو به‌دست‌آمده برای هرکدام از مسائل مشخص‌شده‌اند.

کلیدواژه‌ها


عنوان مقاله [English]

Sequential Competitive Location with Considering Reliability and Gravity

نویسندگان [English]

  • Maryam Esmaeili
  • Najmeh Bahrampour
Department of Industrial Engineering, Faculty of Engineering, Alzahra University, Tehran, Iran
چکیده [English]

This paper investigates a competitive location problem with reliability. The reliability is the probability of out of service facilities for customers who cannot be served because of natural causes or human reasons. In this case, for each customer, there are several levels of allocations. If a facility fails to serve a customer, the customer will be served by the facility at the next allocation level. The two firms determine their optimal location, respectively. The problem is modeled based on a Stackelberg game, in which the leader's and follower's facility locations are determined respectively. The follower chooses the location of his choice according to the leader choice. The object of each competitor is maximizing the profit. Demographic parameters are considered as effective factors in choosing the location for leaders and followers, which means that the candidate location with more positive demographic factors is a better choice for facility establishment. The behavior of customers in choosing any of the facilities is affected by the quality and distance parameters which are considered in the model. According to gravity huff model, when the distance between costumers and candidate location is shorter and the quality factor is higher, the candidate location is a better choice for establishment. To solve the small part of the problem, the full space searching method is used, in which all possible points in space of answer are investigated. The answers are compared and Pareto optimal solutions are obtained which are shown in figures. As the problem is NP-hard, NSGA-II meta-heuristics algorithm is used to solve the medium and large size of the problem. Representation of answer and crossover and mutation operator for algorithms also specified for the problem. Ultimately, the numerical problems are randomly generated and Pareto optimal solutions are identified for each problem which is shown in figures. The answers obtained from both methods for small size problem are also compared.

کلیدواژه‌ها [English]

  • : Competitive Location Problem
  • Stackelberg game
  • Reliability
  • NSGAII Algorithm