Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/20192
Title: The maximum capture per unit cost location problem
Authors: Hua, G
Cheng, TCE 
Wang, S
Keywords: Branch-and-bound
Competitive location
Maximum capture
Mixed integer fractional programming
Issue Date: 2011
Publisher: Elsevier
Source: International journal of production economics, 2011, v. 131, no. 2, p. 568-574 How to cite?
Journal: International journal of production economics 
Abstract: This paper considers the problem of siting p new facilities of an entering firm to a competitive market so as to maximize the market share captured from competitors per unit cost. We first formulate the problem as a mixed 0-1 fractional programming model, in which we incorporate the fixed cost and transportation cost. The model can deal with the case where some demand nodes have two or more possible closest servers. We then re-formulate the problem as a 01 mixed integer linear program. We use a one-opt heuristic algorithm based on the TeitzBart method to obtain feasible solutions and compare them with the optimal solutions obtained by a branch-and-bound algorithm. We conduct computational experiments to evaluate the two algorithms. The results show that both algorithms can solve the model efficiently and the model is integer-friendly. We discuss other computational results and provide managerial insights.
URI: http://hdl.handle.net/10397/20192
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2011.02.002
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

10
Last Week
0
Last month
0
Citations as of Nov 7, 2018

WEB OF SCIENCETM
Citations

7
Last Week
0
Last month
1
Citations as of Nov 14, 2018

Page view(s)

73
Last Week
0
Last month
Citations as of Nov 12, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.