Determining the location and capacity of competitive facilities
Ronald G. McGarvey and
Tom M. Cavalier
International Journal of Mathematics in Operational Research, 2010, vol. 2, issue 6, 694-723
Abstract:
This paper examines a competitive facility location problem in which the objective is to increase market capture subject to an expansion budget. This is accomplished by determining both the locations for a set of new facilities and the capacities of new and existing facilities. A gravity-based elastic-demand utility model is presented, in which the capacity of a facility serves as its measure of attractiveness. An examination of problem characteristics suggests that the model be divided into two subproblems. The first subproblem identifies locations for new facilities, and is solved using a penalty function formulation with fixed-point iteration. The second subproblem determines facility capacities and it is solved using a Successive Linear Programming algorithm. The interfacing of the two subproblem procedures into an iterative algorithm for solution of the overall problem is discussed. Computational testing shows the iterative algorithm to be superior to a general-purpose non-linear solver.
Keywords: facilities location; competitive facilities; elastic demand; nonlinear programming; successive linear programming; facilities capacity; utility models. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.inderscience.com/link.php?id=35495 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:2:y:2010:i:6:p:694-723
Access Statistics for this article
More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().