跳到主要內容

臺灣博碩士論文加值系統

(34.204.198.73) 您好!臺灣時間:2024/07/19 14:10
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:黃麗娟
研究生(外文):Li-Chuan Huang
論文名稱:最佳化競爭設施區位與設計策略之研究
論文名稱(外文):Optimal Strategies for Simultaneously Determining the Location and Design of Competitive Facilities
指導教授:張宗勝張宗勝引用關係
指導教授(外文):Tsung-Sheng Chang
學位類別:碩士
校院名稱:國立東華大學
系所名稱:運籌管理研究所
學門:商業及管理學門
學類:行銷與流通學類
論文種類:學術論文
論文出版年:2012
畢業學年度:100
論文頁數:137
中文關鍵詞:競爭設施區位與設計問題混合整數非線性雙階規劃問題禁忌搜尋法變動鄰域搜尋法多起始點搜尋法
外文關鍵詞:Competitive facility location and design modelsMixed integer nonlinear bilevel programmingTabu SearchVariable neighborhood searchMultistart Method
相關次數:
  • 被引用被引用:0
  • 點閱點閱:353
  • 評分評分:
  • 下載下載:37
  • 收藏至我的研究室書目清單書目收藏:0
對零售商來說,設置新設施是進入市場的第一步,也是擴大營業版圖的基礎。隨著消費型態轉變與競爭環境的白熱化,本零售商的新設施區位與設計策略會改變自己與競爭對手兩者間的競爭關係,而影響雙方的競爭策略及市場利潤,同時顧客也可能因為新設施存在不同的設施設計而改變採買的地點,所以設置新設施一直是一項操作困難的投資計畫,而該計畫必須長期投入高額資金的特性,則使其還存在著一定的財務風險。
本研究旨在建構一個同時考慮競爭對手反應與設置新設施之市場擴張(Market expansion)、需求競食(Demand cannibalization)與設施聚集效果(Mutually beneficial effect)等重要市場效果的混合整數雙階非線性規劃模型(Mixed-integer nonlinear bilevel programming model),以協助零售商研擬最適合公司目標的新設施區位與設計策略,並以禁忌搜尋法(TS)為基礎,發展出多起始點變動鄰域禁忌搜尋法(MSTS - VNS),該方法同時結合了禁忌搜尋法(TS)與變動鄰域搜尋法 (VNS)的優點,並採用多起始點(Multistart method)的搜尋策略來跳脫局部最佳解(local optimum)。
為驗證多起始點變動鄰域禁忌搜尋法的求解績效,本研究以台北地區及台灣地區零售服務業的消費者為對象,透過相關參數與統計資料設計出多種分析情境之實證案例進行測試,由測試結果可知本研究方法在求解品質與計算時間上均有不錯的表現。最後並依據測試結果提出相關結論與建議。
This research seeks to help a retailer develop its optimal strategies for simultaneously determining its facility location and design in a competitive environment. Two main features differentiate the problem from others in the literature. One is that the model takes into account the strategies of the retailer’s competitors by way of bi-level programming. The other is that the model simultaneously and explicitly captures the three most important aspects of real-world retailing: market expansion, demand cannibalization and mutually beneficial effect. The proposed problem is NP-hand. Therefore, this research uses Tabu Search combined with Variable Neighborhood Search (VNS) and the Multistart method to solve large-scale problems. Apart from reporting the computational results obtained as a set of empirical instances which locate retail facilities in Taipei and Taiwan, we also compute the benefits a retailer derives from anticipating the competitor’s reaction and the associated mutually beneficial effects.
摘要............................................................................................................................... ii
Abstract ........................................................................................................................ iii
目錄............................................................................................................................... iv
表目錄........................................................................................................................... vi
圖目錄.......................................................................................................................... vii
第一章緒論.................................................................................................................. 1
第二章文獻回顧.......................................................................................................... 5
2.1 競爭區位問題(Competitive location problem) ............................................... 5
2.1.1 發展沿革.............................................................................................. 5
2.1.2 問題定義.............................................................................................. 6
2.1.3 問題分類.............................................................................................. 7
2.2 文獻分析........................................................................................................ 11
2.2.1 追隨者問題........................................................................................ 11
2.2.2 領導者問題........................................................................................ 13
2.3 雙階規劃模型(Bilevel programming model)................................................ 17
第三章問題描述與數學模型.................................................................................... 21
3.1 問題描述........................................................................................................ 21
3.2 數學模型........................................................................................................ 28
3.3 分段線性化數學模型.................................................................................... 39
第四章演算法............................................................................................................ 47
4.1 設施分群方法................................................................................................ 48
4.2 分段線性化方法............................................................................................ 52
4.3 多起始點變動鄰域禁忌搜尋法(MSTS-VNS) ............................................. 55
第五章實驗案例與績效分析.................................................................................... 69
5.1 實證案例....................................................................................................... 69
5.2 績效分析....................................................................................................... 71
第六章結論與建議.................................................................................................... 79
參考文獻...................................................................................................................... 81
中文參考文獻...................................................................................................... 81
英文參考文獻...................................................................................................... 81
附錄.............................................................................................................................. 86
附錄一、設施邊際效益...................................................................................... 86
附錄二、台北市實證分析題組(考慮同業聚集效果) ....................................... 88
附錄三、台北市實證分析之測試結果與CPU 執行時間圖 ............................ 89
附錄四、台北市實證分析之設施分布圖.......................................................... 98
附錄五、敏感度分析之設施分布圖................................................................ 116
附錄六、考慮與未考慮競爭對手反應之分析結果........................................ 122
附錄七、未考慮競爭對手反應之設施分布圖................................................ 124
附錄八、未考慮同業聚集效果之設施分布圖................................................ 133
附錄九、台灣實證分析之設施分布圖-競爭對手獨占市場 .......................... 135
中文參考文獻
1. 羅平(1997). 零售商圈定義與房地產投資之關係(95-96 頁). 房地產市場與行情月刊.
2. 楊雲明(2002). 個體經濟學. 台北:智勝文化事業有限公司.
3. 薛益忠(2006). 競爭設施選址與理論辦法. 台北:三民書局.
4. 楊豐梅與盧曉珊(2010). 競爭設施選址與理論辦法. 北京:科學出版社.
5. 楊豐梅,華國偉,黎建強(2006). 一個競爭選址問題的新模型與其求解算法, 系統工程理論與實務 7, 18-24.

英文參考文獻

1. Aboolian, R., Berman, O., Krsss, D., 2007a. Competitive facility location problem with concave demand. European Journal of Operations Research 181, 598–619.
2. Aboolian, R., Berman, O., Krsss, D., 2007b. Competitive facility location and design problem. European Journal of Operational Research 182, 40–62.
3. Bard, J.F., 1999. Practical bilevel optimization:Algorithm and applications. IIE Transactions 31, 921–923.
4. Bard, J.F., Moore, J.T., 1990. A branch and bound algorithm for the bilevel programming problem. Society for Industrial and Applied Mathematics Journal on Scientific and Computing 11, 281–292.
5. Bard, J.F., Moore, J.T., 1992. An algorithm for the discrete bilevel programming problem. Naval Research Logistics 39, 419–435.
6. Berman, O., Krsss, D., 2002. Locating multiple competitive facilities: Spatial interaction models with variable expenditures. Annals of Operations Research 111, 197–225.
7. Berman, O., Krass, D., Wang, J., 2006. Locating service facilities to reduce lost demand. IIE Transactions 38, 933–946.
8. Berry, B.J.L., 1963. Commercial structure and commercial blight. Research Paper No. 85. Department of Geography, University of Chicago.
9. Bialas, W.F., Karwan, M.H., 1984. Two-level linear programming. Management Science 30, 1004–1020.
10. Brown, S., 1989. Retail location theory: The legacy of harold hotelling. Journal of Retailing 65, 450–470.
11. Datta, S., Sudhir, K., 2011. The agglomeration-differentiation tradeoff in spatial location choice. Working paper.
12. Drezner, T., 1994. Locating a single new facility among existing unequally attractive facilities. Journal of Regional Science 34, 237–252.
13. Drezner, T., Drezner, Z., 1996. Competitive facilities: Market share and location with random utility. Journal of Regional Science 36, 1-15.
14. Drezner, T., Drezner, Z., 2004. Finding the optimal solution to the Huff based competitive location model. Computational Management Science 1, 193–208.
15. Drezner, T., Drezner, Z., 2008. Lost demand in a competitive environment. Journal of Operation Research Society 59, 362 –371.
16. Drezner, T., Drezner, Z., 2012. Modelling lost demand in competitive facility location. Journal of the Operational Research Society 63, 201–206.
17. Drezner, T., Drezner, Z., Kalczynski, P., 2010. A cover-based competitive location model. Journal of Operation Research Society 62, 100–113.
18. Drezner, Z., 1996. Facility location: A survey of applications and methods. Springer, New York. (pp. 285–300, Chapter. Competitive facility location in the plane).
19. Edmunds, T.A., Bard, J.F., 1992. An algorithm for the mixed-integer noninear bilevel programming problem. Annals of Operations Research 34, 149–162.
20. Enright, M., 1996. Regional clusters and economic development: A research agenda. In: Staber, U., Schaefer, N., Sharma, B. (Eds.), Business Networks:Prospects for Regional Development. Berlin: Walter de Gruyter, 190–213.
21. Fernández, J., Pelegrı´n, B., Plastria, F., Tóth, B., 2007a. Planar location and design of a new facility with inner and outer competition: An interval lexicographical-like solution procedure. Networks and Spatial Economics 7, 19–44.
22. Fernández, J., Pelegrı´n, B., Plastria, F., Tóth, B., 2007b. Solving a Huff-like competitive location and design model for profit maximization in the plane. European Journal of Operational Research 179, 1274–1287.
23. Fischer, K., 2002. Sequential discrete p-facility models for competitive location planning. Annals of Operations Research 111, 253–270.
24. Fox, E.J., Postrel, S., McLaughlin, A., 2007. The impact of retail location on retailer revenues: An Empirical investigation. Unpublished manuscript, Edwin L. Cox School of Business, Southern Methodist University, Dallas, TX.
25. Gao, Z.Y., Wu, J.J., Sun, H.J., 2005. Solution algorithm for the bi-level discrete network design problem. Transportation Research Part B: Methodological 39, 479–495.
26. Ghosh, A., McLafferty, S., 1984. A model of consumer propensity for multipurpose shopping. Geographical Analysis 16, 244–249.
27. Glover, F., 1989. Tabu Search - Part I. ORSA Journal on Computing 1, 190-206.
28. Glover, F., Kochenberger, G.A. (Eds.), 2003. Handbook of Metaheuristics, Kluwer Academic Publishers.
29. Haase, K., 2009. Discrete location planning. Working paper, The University of Sydney.
30. Hakimi, S.L., 1983. On locating new facilities in a competitive environment. European Journal of Operational Research 12, 29–35.
31. Hansen, P., Mladenović, N., 1997. Variable neighborhood search for the p-median. Location Science 5, 207–226.
32. Hansen, P., Mladenović, N., 2001. Variable neighborhood search: Principles and applications. European Journal of Operational Research 130, 449–467.
33. Hansen, P., Mladenović, N., Pérez, J.A.M., 2008. Variable neighbourhood search:Methods and applications. 40R: A Quarterly Journal of Operations Research 6, 319–360.
34. Hotelling, H., 1929. Stability in competition. Economic Journal 39, 41–57.
35. Jaeggi, D.M., Parks, G.T., Kipouros, T., Clarkson, P.J., 2008. The development of a multi-objective Tabu Search algorithm for continuous optimisation problems. European Journal of Operational Research 185, 1192–1212.
36. Jensen, P.A., Bard, J.F., 2003. Operations Research: Models and methods. John Wiley and Sons.
37. Jeroslow, R.G., 1985. The polynomial hierarchy and a simple model for competitive analysis. Mathematical Programming 32, 146–164.
38. Karimifar, M.J., Sikarudi, M.K., Moradi, E., Bidkhori, M., 2009. Competitive location problem. In: Farahani, R.Z., Hekmatfar, M. (Eds.), Facility Location:Concept, Models, Algorithms and Case Studies. Springer, Berlin, 271–294.
39. Küçükaydin, H., Aras, N., Altınel, I.K., 2011. Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution. European Journal of Operational Research 208, 206–220.
40. Küçükaydin, H., Necati, A., Altınel, Đ.K., 2012. A leader–follower game in competitive facility location. Computers and Operations Research 39, 437–448.
41. Lapierre, S.D., Ruiz, A.B., Soriano, P., 2004. Designing Distribution Networks:Formulations and Solution Heuristic. Transportation Science 38, 174–187.
42. Li, H.L., Yu, C.S., 1999. A global optimization method for nonconvex separable programming problems. European Journal of Operational Research 117, 275–292.
43. Melechovský, J., Prins, C., Calvo, R.W., 2005. A metaheuristic to solve a location-routing problem with non-linear costs. Journal of Heuristics 11, 375–391.
44. Miller, C.E., Reardon, J., McCorkle, D.E., 1999. The effects of competition on retail structure: An examination of intratype, intertype, and intercategory competition. Journal of Marketing 63, 107-120.
45. Moore, J.T., Bard, J.F., 1990. The mixed integer linear bilevel programming problem. Operation research 38, 911-921.
46. Nakanishi, M., Cooper, L.G., 1974. Parameter estimation for a multiplicative competitive interaction model: Least squares approach. Journal of Market Research 11, 303–311.
47. Oppewal, H., Holyoake, B., 2004. Bundling and Retail Agglomeration Effects on Shopping Behavior. Journal of Retailing and Consumer Services 11, 61-74.
48. Owen, S.H., Daskin, M.S., 1998. Strategic facility location: A review. European Journal of Operational Research 111, 423–447.
49. Plastria, F., 1997. Profit maximising single competitive facility location in the plane. Studies in Locational Analysis 11, 115–126.
50. Plastria, F., 2001. Static competitive facility location: An overview of optimisation approaches. European Journal of Operational Research 129, 461–470.
51. Plastria, F., Carrizosa, E., 2004. Optimal location and design of a competitive facility. Mathematical Programming 100, 247–265.
52. Porter M. E., 1990. The competitive advantage of nations, Free Press, New York.
53. Porter M. E., 2000. Location, competition and economic development: Local clusters in a global economy. Economic Development Quarterly 14, 15-31.
54. ReVelle, C.S., Eiselt, H.A., 2005. Location analysis: A synthesis and survey. European Journal of Operational Research 165, 1–19.
55. Saidani, N., Chu, F., Chen, H., 2012. Competitive facility location and design with reactions of competitors already in the market. European Journal of Operational Research 219, 9–17.
56. Serra, D., ReVelle, C., 1995. Competitive location in discrete space. In: Drezner, Z., (Eds.), Facility Location. Springer-Verlag, 337–356 (Chapter 15).
57. Steiner, W.J., 2010. A Stackelberg–Nash model for new product design. OR Spectrum 32, 21–48.
58. Sun, H.J., Gao, Z.Y., Wu, J.J., 2008. A bi-level programming model and solution algorithm for the location of logistics distribution centers. Applied Mathematical Modelling 32, 610–616.
59. Sáiz, M.E., Hendrix, E.M.T., Fernández, J., Pelegrín, B., 2009. On a Branch-and-bound approach for a Huff-like Stackelberg location problem. OR Spectrum 31, 679–705.
60. Tóth, B., Fernández, J., Pelegrín, B., Plastria, F., 2009. Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models. Computers and Operations Research 36, 1393–1405.
61. Tobin, R.L., Friesz, T.L., 1986. Spatial competition facility location models:Definition, formulation and solution approach. Annals of Operations Research 6, 47–74.
62. Wen, U.P., Hsu, S.T., 1991. Linear bi-level programming problems - a review. Journal of the Operational Research Society 42, 125-133.
63. Wen, U.P., Huang, A.D., 1996. A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem. European Journal of Operational Research 88, 563-571.
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top