Sequential Competitive Facility Location Problem in a Discrete Planar Space
نویسندگان
چکیده مقاله:
In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candidate locations. In this paper, it is assumed that the demand is inelastic. Considering the huff model, customers share their demand among all facilities, probabilistically. The leader’s objective function is the maximization of its market share after the follower’s new facilities entry. The leader and follower problems are solved via an exact solution method. Keywords: Competitive Location, Leader-Follower, Huff-Type, Market Share.
منابع مشابه
Optimal Capacities in Discrete Facility Location Design Problem
Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be ...
متن کاملSolution of Discrete Competitive Facility Location Problem for Firm Expansion
A new heuristic algorithm for solution of bi-objective discrete competitive facility location problems is developed and experimentally investigated by solving different instances of a facility location problem for firm expansion. The proposed algorithm is based on ranking of candidate locations for the new facilities, where rank values are dynamically adjusted with respect to behaviour of the a...
متن کاملoptimal capacities in discrete facility location design problem
network location models comprise one of the main categories of location models. these models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. in a network location problem, nodes represent demand points and candidate locations to locate the facilities. if the links network is unchangeably determined, the problem will be ...
متن کاملBranch-and-bound algorithm for a competitive facility location problem
We study a mathematical model generalizing the well-known facility location problem. In this model we consider two competing sides successively placing their facilities and aiming to ‘‘capture’’ consumers, in order to make maximal profit. We state the problem as a bilevel integer programming problem, regarding optimal noncooperative solutions as optimal solutions. We propose a branch-andbound a...
متن کاملApproximate Algorithms for the Competitive Facility Location Problem
We consider the competitive facility location problem in which two competing sides (the Leader and the Follower) open in succession their facilities, and each consumer chooses one of the open facilities basing on its own preferences. The problem amounts to choosing the Leader’s facility locations so that to obtain maximal profit taking into account the subsequent facility location by the Follow...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 1 شماره None
صفحات 0- 0
تاریخ انتشار 2011-11
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی برای این مقاله ارائه نشده است
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023