期刊文献+

考虑市场扩张和吞并的新设施竞争选址模型 被引量:12

The Competitive Location Problem with Market Expansion and Cannibalization
原文传递
导出
摘要 连锁型企业新设施的选址在市场扩张中占有至关重要的地位。提出了连锁型企业新设施进入产生两个结果:带来市场需求的扩张和对企业内部已存设施的市场侵蚀,建立了使连锁企业市场份额最大和企业内已存设施市场吞并最小的新设施选址的双目标模型,并给出了求解模型的遗传算法和具体的案例。结果表明该模型和算法可以用于连锁型企业新设施选址决策中,并能够有效的得到问题的近似解。 The location of new facilities of the chain-company is vital for market expansion. The entrace of new facilities will bring two results: the expansion of market demand and the cannibalization of market share of the chain-company's existing facilities. This paper found a biobjective model of new facilities location which makes the chain-company maximize the market share and minimize the cannibalization of its existing facilities. The genetic algorithm to solve this model is developed and computational experiment is described. It is showed that this model and algorithm can apply to the location decision of the chain-company's new facilities, and can efficiently obtain an approximate solution.
出处 《工业工程与管理》 北大核心 2009年第2期43-47,共5页 Industrial Engineering and Management
基金 国家自然科学基金(70601011) 国家自然科学基金(70871044) 教育部新世纪优秀人才支持计划项目(NCET-06-0653)
关键词 选址 竞争 吞并 扩张 location competition cannibalization expansion
  • 相关文献

参考文献12

  • 1Plastria F. Static competitive facility location: An overview of optimisation[J]. European Journal of Operational Research, 2001,129(3) : 461-470.
  • 2HUFF. Defining and estimating a trading area[J]. Journal of Marketing, 1964,28:34-38.
  • 3Naknishi M,Cooperl G. Parameter estimates for multiplicative competitive interaction models least square approach [J ]. Journal of Marketing Research, 1974,11 : 201-311.
  • 4Peeters P H,Plastria F. Discretization results for the huff and pareto-huff competitive location models on networks [ J ]. Sociedad de Estadistica e Investigacidn Operativa TOP, 1998,6 (2) : 247-260.
  • 5Berman O, Krass D. Flow Intercepting spatial interaction model: a new approach to optimal location of competitive facilities[J]. Location Science, 1998,6 ( 1 ) : 41-65.
  • 6Maria D. On price competition in location-price models with spatially separated markets [J]. Sociedad de Estadlstica e Investigacidn Operativa Top, 2004,12 (2) : 351-374.
  • 7杨珺,张敏,刘婵媛.具有地区零售饱和度限制的竞争型零售网点选址模型[J].工业工程与管理,2006,11(1):32-36. 被引量:8
  • 8Berman O, Krass D. Locating mutiple competitive facilities: fpatial interaction models with variable expenditures [J]. Annals Of Operation Research 2002,111 : 197-225.
  • 9Aboolian R. Competitive facility location model with concave demand[J]. European Journal of Operational Research, 2007, 181:598-619.
  • 10Aboolian R. Competitive facility location model and design problem[J]. European Journal of Operational Research, 2007, 182:40-62.

二级参考文献17

  • 1Hotelling H, Stability in Competition[J]. Economic Journal,1929, 39:41-57.
  • 2ReVelle C. The Maximum Capture or:“Sphere of Influence”Location Problem: Hotelling Revisited on a Network[J]. Journal of Regional Science, 1986,26 (2).
  • 3Serra D, Marianov V, ReVelle C. The Hierarchical Maximum Capture Problem[J]. European Journal of Operational Research, 1992,62 (3): 34- 56.
  • 4Reilly W J. The Law of Retail Gravitation[M]. New York:Knickerbocker Press, 1929.
  • 5Eiseh H A , Laporte G. The Maximum Capture Problem in a Weighted Network[J]. Journal of Regional Science, 1989,29(3):433-439.
  • 6Revelle C,Elzinga D. An Algorithm for Facility Location in a Districted Region[J]. Environment and Planning, 1989, B16:41- 50.
  • 7Berman O,Einav D, Handler G. The Zone-constrained Location Problem on a Network[J]. European Journal of Operational Research, 1991, 53(1) : 14-24.
  • 8Huff D L. Defining and Estimating a Trading Area[J]. Journal of Marketing, 1964,28 : 34- 38.
  • 9Huff D L. A Programmed Solution for Approximating an Optimum Retail 1Location [J]. Land Economies, 1966, 42:293-303.
  • 10Nakanishi M,Cooper L G. Parameter Estimates for Multiplicative Competitive Interaction Models Least Square Approach[J]. Journal of Marketing Research, 1974,11:201 -311.

共引文献13

同被引文献81

引证文献12

二级引证文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部