11.07.2015 Views

View - Universidad de Almería

View - Universidad de Almería

View - Universidad de Almería

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Proceedings of GO 2005, pp. 61 – 65.Locating Competitive Facilities via a VNS Algorithm ∗Emilio Carrizosa, 1 José Gordillo, 1 and Dolores R. Santos-Peñate 21 <strong>Universidad</strong> <strong>de</strong> Sevilla, Spain{ecarrizosa,jgordillo}@us.es2 <strong>Universidad</strong> <strong>de</strong> Las Palmas <strong>de</strong> Gran Canaria, Spaindrsantos@dmc.ulpgc.esAbstractKeywords:We consi<strong>de</strong>r the problem of locating in the time period [0, T ] q facilities in a market in which competingfirms already operate with p facilities. Locations and the entering times maximizing profitsare sought.Assuming that <strong>de</strong>mands and costs are time-<strong>de</strong>pen<strong>de</strong>nt, optimality conditions are obtained, anddifferent <strong>de</strong>mand patterns are analyzed. The problem is posed as a mixed integer nonlinear problem,heuristically solved via a VNS algorithm.Competitive location, Variable Neighborhood Search, Dynamic Demand, Covering Mo<strong>de</strong>ls, MaximalProfit.1. IntroductionThe problem of locating facilities in a competitive environment has been addressed, both at themo<strong>de</strong>lling and computational level, in a number of papers in the field of Operations Researchand Management Science, see e.g. [2, 3, 5–9, 12, 14] and the references therein.The simplest mo<strong>de</strong>ls accommodating competition are those related with covering: a firmis planning to locate a series of facilities to compete against a set of already operating facilities,in or<strong>de</strong>r to maximize its profit, usually equivalent to maximizing the market share.Different attraction rules may be (and have been) consi<strong>de</strong>red to mo<strong>de</strong>l consumer behavior,and thus to evaluate market share. For instance, with the binary attraction rule, one assumesthat consumers <strong>de</strong>mand is fully captured by the closest facility, or more generally by the mostattractive facility, where attractiveness is measured by a function <strong>de</strong>creasing in distance andprice, e.g. [1, 10, 11, 13].Serious attempts have been ma<strong>de</strong> to mo<strong>de</strong>l different metric spaces (a discrete set, a transportationnetwork or the plane), or different attraction rules (e.g. the above-mentioned binaryrule, as well as rules relying upon the assumption that consumer <strong>de</strong>mand is split into the differentfacilities, each capturing a fraction of the <strong>de</strong>mand, this <strong>de</strong>mand being <strong>de</strong>creasing in distance,. . . ). However, most mo<strong>de</strong>ls assume that consumer <strong>de</strong>mand remains constant throughthe full planning horizon, which may be a rather unrealistic assumption for new goods orhigh seasonality products. See e.g. [4, 15] for facility location mo<strong>de</strong>ls which do accommodatetime-<strong>de</strong>pen<strong>de</strong>nt <strong>de</strong>mand.In this talk we introduce a covering mo<strong>de</strong>l for locating facilities in a competitive environmentin which <strong>de</strong>mand is time-<strong>de</strong>pen<strong>de</strong>nt. This implies that, as e.g. in [4], not only the facility∗ Partially supported by projects BFM2002-04525, Ministerio <strong>de</strong> Ciencia y Tecnología, Spain, and FQM-329, Junta <strong>de</strong> Andalucía,Spain

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!