.png){kind=icon}
.png){kind=icon}
Return
Competitive facility location model with concave demand
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2005.10.075.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider a spatial interaction model for locating a set of new facilities that compete for customer demand with each other, as well as with some pre-existing facilities to capture the market expansion and the market cannibalization effects. Customer demand is assumed to be a concave non-decreasing function of the total utility derived by each customer from the service offered by the facilities. The problem is formulated as a non-linear Knapsack problem, for which we develop a novel solution approach based on constructing an efficient piecewise linear approximation scheme for the objective function. This allows us to develop exact and alpha-optimal solution approaches capable of dealing with relatively large-scale instances of the model. We also develop a fast Heuristic Algorithm for which a tight worst-case error bound is established. (c) 2006 Elsevier B.V. All rights reserved.
Keywords:
location
integer programming
competitive facility location models
non-linear knapsack problem
alpha-optimal solutions
greedy heuristics
worst-case bounds
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available