Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Management / 管理學院
  3. Information Management / 資訊管理學系
  4. A Service Facility Location Model with Endogenous Consumer Demands
 
  • Details

A Service Facility Location Model with Endogenous Consumer Demands

Date Issued
2016
Date
2016
Author(s)
Liao, Wei-Hung
DOI
10.6342/NTU201601596
URI
http://ntur.lib.ntu.edu.tw//handle/246246/275736
Abstract
For those facilities that serve end consumers directly, it is natural that consumer demands are affected by the number and locations of facilities. Vehicle sharing system provide a good illustration, as more users join the system when there are more rental sites. Interestingly, opening a facility not only affects customer demands directly but also changes how other facilities affect consumer demands. For example, for a typical bike sharing system, users often travel from the subway stations to their offices, schools, and home. When there are rental sites at both sides, an additional network effect emerges. In this study, we investigate the problem of a profit maximizing retailer in selecting a set of facilities to build from a given set of locations. We assume that the retailer needs to consider two major types of effects: (1) the stand-alone benefit of a single facility and (2) the network benefit between two facilities. The sum of these two benefits will then be input into a nondecreasing concave function to capture the diminishing marginal benefit property. By considering the overall benefit and total cost of building facilities, the retailer decides where to build facilities to maximize her profit. The problem is then formulated as a nonseparable nonlinear integer program. We first prove that the problem is weakly NP-hard. As one of the most common method to approach NP-hard problems is to develop heuristic algorithms, we propose two algorithms. The first one, which is based on relaxing the integer constraints, is called the approximation-relaxation-sorting algorithm (ARSA). The second one, which is called the naive greedy algorithm (NGA), is a straightforward greedy algorithm. We show that ARSA has different worst-case performance guarantees for some special cases of our general problem. We then study the average performance of the two algorithms in various scenarios through numerical experiments.
Subjects
Facility location
network effect
endogenous consumer demands
approximation algorithm
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-105-R03725035-1.pdf

Size

23.32 KB

Format

Adobe PDF

Checksum

(MD5):7eb4ba7452124e4bceb49cd4a0397a06

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science