Article ID: | iaor20115852 |
Volume: | 40 |
Issue: | 1 |
Start Page Number: | 9 |
End Page Number: | 20 |
Publication Date: | Jan 2012 |
Journal: | Omega |
Authors: | Fernndez Jos, Garca Inmaculada, Redondo Juana L, Arrondo Arnzazu G, Ortigosa Pilar M |
Keywords: | combinatorial optimization, design, programming: branch and bound, demand |
In most competitive location models available in the literature, it is assumed that the demand is fixed independently of market conditions. However, demand may vary depending on prices, distances to the facilities, etc., especially when the goods are not essential. Taking variable demand into consideration increases the complexity of the problem and, therefore, the computational effort needed to solve it, but it may make the model more realistic. In this paper, a new planar competitive location