Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method

نویسندگان

  • Azar Niknam Faculty of Engineering and Technology, University of Alzahra, Tehran, Iran
  • Jafar Bagherinejad Faculty of Engineering and Technology, University of Alzahra, Tehran, Iran
چکیده مقاله:

In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services are taken into account. The competitor could react by opening new facilities, closing existing ones, and adjusting the quality levels of its existing facilities. The market share, captured by each facility, depends on its distance to customer and its quality that is calculated based on the probabilistic Huff’s model. Each firm aims to maximize its profit subject to constraints on quality levels and budget of setting up new facilities. This problem is formulated as a bi-level mixed integer non-linear model. The model is solved using a combination of Tabu Search with an exact method. The performance of the proposed algorithm is compared with an upper bound that is achieved by applying Karush–Kuhn–Tucker conditions. Computational results show that our algorithm finds near the upper bound solutions in a reasonable time.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Solving the uncapacitated facility location problem using tabu search

A tabu search heuristic procedure is developed to solve the uncapacitated facility location problem. Tabu search is used to guide the solution process when evolving from one solution to another. A move is defined to be the opening or closing of a facility. The net cost change resulting from a candidate move is used to measure the attractiveness of the move. After a move is made, the net cost ch...

متن کامل

A Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem

The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...

متن کامل

A Hybrid Genetic Algorithm for Solving Facility Location- Allocation Problem

Today’s logistic systems in companies depend on optimum solutions of Facility Location-Allocation (FLA) problems in order to minimize cost values the company is dealing with. Therefore, FLA plays an important role in nowadays business environment. In this paper, a Hybrid Genetic Algorithm (HGA) is proposed to solve FLA. The HGA is a combination of Genetic Algorithm and Tabu Search while NSGA II...

متن کامل

Solving the Economic Dispatch Problem with Tabu Search Algorithm

The application of Tabu Search Algorithm (TSA) technique to solve Economic Dispatch problem (ED) with non-smooth fuel cost function is reported in this paper. Results from MATLAB on Pentium Ill-500 MHz system for three case studies are presented. Effectiveness of method was compared with many conventional methods. Result shows that the proposed method can provide accurate solution with rapid co...

متن کامل

A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 14  شماره 1

صفحات  -

تاریخ انتشار 2018-03-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023