競爭型路徑需求商店設置位決策模式之構建及分析

摘要

本研究修正過去硏究對需求皆發生在節點上之假設，探討當需求發生於路徑上且商店間存在競爭情形時，如何決定商店位址以爭取更多之顧客及利潤。針對此問題，我們除了提出一數學模式外，基於提升演算效率之考量，繼而發展一啓發式解法，並應用至一便利商店設置之實例中。又鑑於路網結構可能對解題效率造成影響，研究中並進行一些必要之敏感度分析，以探索網路結構變化對於問題之目標函數値及求解效率之影響程度。

Abstract

Instead of making a special-purpose trip to obtain service, many customers nowadays purchase service as part of routine preplanned trips. The decision objective for service providers is to find the optimal locations for such service facilities to maximize the number of customers “captured”. This sort of problem is usually called “flow-capturing location allocation problem” (FCLAP). However, studies of this issue in the past seem to ignore the fact that the facilities compete with other regardless of whether they are of the same or a different chain. The competitive FCLAP is, thus, addressed in this study. Both a mathematical model and a greedy-based heuristic are developed. The greedy heuristic algorithm presented solves the example network adopted from the literature with competitive results obtained, especially with the CPU times consumed being much less than those for the optimal approach. Apart from the small and contrived test problem, this heuristic has also been applied to an authentic network in Yuan lin, Chang-Hwa, Taiwan.

關鍵字:

• 流量攔取
• 商店/設施設置問題
• 競爭型設施

Key Words:

• facility location
• flow-capturing
• competitive facility