Skip navigation

DSpace JSPUI

DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets

Learn More
DSpace logo
English
中文
  • Browse
    • Communities
      & Collections
    • Publication Year
    • Author
    • Title
    • Subject
  • Search TDR
  • Rights Q&A
    • My Page
    • Receive email
      updates
    • Edit Profile
  1. NTU Theses and Dissertations Repository
  2. 工學院
  3. 工業工程學研究所
Please use this identifier to cite or link to this item: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/68918
Title: 在需求與供應不確定下自行車共享系統多站點間之供需媒合
Matching uncertain supply with uncertain demand of multiple bike sharing stations
Authors: Miao-Shan Yu
于妙善
Advisor: 周雍強
Keyword: 自行車共享系統,需求不確定,供給不確定,供需媒合,
bike-sharing system,uncertain demand,uncertain supply,matching,
Publication Year : 2017
Degree: 碩士
Abstract: 在公共自行車共享系統的營運期間,自行車的流動是動態的且分布不均勻的,為了避免使用者無車可借或無位可還,營運者必須在各租借站間以運補車來回調度自行車以達到供需平衡,重新平衡站點間的自行車數量對於維護服務質量至關重要,但是需要付出昂貴的成本。
自行車調度有兩種方式:靜態調度和動態調度。週期性的調度即是靜態的問題,動態調度能夠針對現場的實際情況,依環境的部分信息不斷更新調度策略,而動態調度的平衡問題具有需求不確定和供給不確定的特性。
本研究欲在共享經濟的概念下,針對動態調度改善自行車的調度問題,考量在短時間區段內,當需求不確定且供給不確定時,調度數量為何,研究中依照站點的現有車輛數,將站點區分為供應站點、常態站點和需求站點,在資源利用和客戶服務的兩個目標基礎上,分析不確定性需求與不確定性需求的站點配對問題,並求解非線性整數規劃,求得需求站點和供給站點的最適調度數量和配對,引入深度學習的概念,將站點資料輸入深度學習的模型,重複多組數值範例並從中找出調度數量與現有車輛、站點淨流量等站點資料之間的特徵且快速求解,預測最適調度數量,根據求得的調度數量提出建議。
During the operation of public bicycle sharing systems, the movement of bicycles is dynamic and uneven across bike stations and in different times of the day. In order to avoid stock-out and blocking, the operator must reallocate bikes back and forth between stations. To balance supply and demand, rebalancing the bikes between parking kiosks is critical to maintaining service quality, but it is costly.
Bike rebalancing has two modes: periodical and dynamic. Periodical rebalancing is typically modelled as a static problem of vehicle routing. Dynamic rebalancing has the characteristics of both uncertain demand and uncertain supply.
In this thesis, bike stations are categorized as surplus, normal and deficient stations based on their bike quantities and two thresholds. We present an analysis of the problem of matching uncertain supply with uncertain demand under the two objectives of resource utilization and customer service. We solve a non-linear integer programming model to obtain the optimal dispatch quantity and transfer between pair of station of supply and demand. Finally, we apply deep learning duplicate the optimal solution in a few numerical case.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/68918
DOI: 10.6342/NTU201703442
Fulltext Rights: 有償授權
Appears in Collections:工業工程學研究所

Files in This Item:
File SizeFormat 
ntu-106-1.pdf
  Restricted Access
1.79 MBAdobe PDF
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved