Abstract
This paper presents a new model for a class of competitive location problems, which is to maximize capture. The model characterizes the assembling effect by introducing the growth rate of demands and the discount on distances, which result from the assembling of competitive facilities. At the same time, the branch-and-bound algorithm and greedy algorithm are developed to solve the model, and a numerical example is given to illustrate and test the algorithms. Finally, the effects of the growth rate of demands and the discount on distances on location are analyzed.
| Translated title of the contribution | New model for competitive location and its algorithms |
|---|---|
| Original language | Chinese (Simplified) |
| Pages (from-to) | 18-24 |
| Journal | 系统工程理论与实践 |
| Volume | 26 |
| Issue number | 7 |
| Publication status | Published - Jul 2006 |
Research Keywords
- 竞争选址
- 最大市场份额
- 聚集效应
- 分支定界算法
- 贪婪算法
- Competitive location
- Maximum capture
- Assembling effect
- Branch and bound method
- Greedy algorithm
Fingerprint
Dive into the research topics of 'New model for competitive location and its algorithms'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver