臺灣博碩士論文加值系統

本研究從共享停車系統平台業者之立場，求解共享停車系統之停車位排程問題，透過導入預約制共享停車位機制改善都市停車位之問題。而在實務情況中，由於眾多不確定因素的影響，例如：交通與天氣狀況等，停車位預約需求者可能無法準時到達指定之停車位，因此，本研究為貼近實際情況，利用離散機率分布呈現車位需求者在抵達時間上之不確定性。本研究以共享停車系統平台業者期望利潤最大化為目標，依據問題特性建立車位流動網路(parking-space flow network)來呈現車位的使用狀態，並以車位流動網路為基礎發展隨機最佳化數學模式，此問題為多貨物網路流量問題。本研究使用C/C++語言建構程式搭配商用整數規劃軟體求解，協助共享停車系統平台業者將車位指派給最適合之車位需求者。
本研究以台北市大安區之共享停車系統為依據產生測試例題並進行數值分析，同時，為測試本研究所發展之隨機最佳化排程模式的穩健性，本研究透過模擬評估之方式，針對三種模型進行分析評估，包含手動排程(Manual assignment, MA)、確定性模型(Deterministic model, DM)、以及本研究所發展之隨機性模型(Stochastic model, SM)，模擬面對實際抵達狀況時，不同模型所產生之預先車位排程的穩健性，同時，本研究亦針對不同需求水準進行敏感度分析。由研究結果可得，隨機性模型(SM)所求得的預先停車位排程結果最為穩健，且其平均滿足服務之車輛需求數最高。最後，透過研究結果提供共享停車系統平台業者在未來導入預約制停車位之建議，希望透過預約制度的引入，吸引更多民眾加入使用停車位共享系統平台機制，改善都市地區之停車問題。

This study proposes a parking-space-flow network modeling approach to deal with the optimal scheduling problem for shared parking system considering stochastic arrival times. In this approach, uncertain vehicle arrival times are represented by discrete probability distributions. The objective is to maximize the expected profit for the shared parking system operator. The proposed model is formulated as an integer multi-commodity network flow problem and solved by optimization solver. This research aims at providing a schedule for the shared parking system operator to assign advanced parking requests to parking spaces. Computational experiments are conducted using test instances generated from a real-world shared parking example.
To evaluate the performance of the parking space schedule obtained by solving the stochastic model, we adopt a simulation-based approach. We also compare our stochastic model with two different approaches, including the manual assignment (MA) and the deterministic model (DM). A number of scenario analyses are also conducted examine the model performance under different demand levels. The evaluation results show that the stochastic model is more robust compared to the MA and DM for generating the schedule for the shared parking system. The proposed stochastic model can be used as a decision support tool for assisting the shared parking system operator in assigning advanced parking requests to parking spaces and determining their schedules.

錄
摘要 i
Abstract ii
目錄 iv
圖目錄 vi
表目錄 viii
第一章 緒論 1
1.1 研究背景 1
1.2 研究目的 6
1.3 研究對象與範圍 6
1.4 研究方法與流程 7
第二章 文獻回顧 8
2.1 共享停車系統發展現況 8
2.2 停車位管理相關文獻 9
2.3 運輸與物流相關之排程問題 10
2.4 小結 11
第三章 共享停車系統車位排程問題 12
3.1 問題描述 12
3.2 車位流動網路圖(parking-space-flow network) 14
3.3 車位排程模式數學模型 22
3.4 小範例測試 23
3.4.1 小範例測試之結果驗證 26
第四章 實驗結果與分析 29
4.1 實驗設計 29
4.1.1 共享平台系統相關參數 29
4.1.2 模式輸入資料 30
4.2 測試例題實驗結果 32
4.3 模擬評估 33
4.3.1. 模擬評估之架構設計 34
4.3.2. 模擬評估之結果分析 38
4.4 敏感度分析 44
4.4.1 小型例題需求敏感度分析 44
4.4.2 中型例題需求敏感度分析 46
4.4.3 大型例題需求敏感度分析 48
4.4.4 單位時間懲罰成本之敏感度分析 50
4.4.5 對後續車輛之影響權重敏感度分析 52
4.4.6 對於車輛本身之影響權重敏感度分析 54
4.4.7 各供給規模於不同平均停車時間長度敏感度分析 56
第五章 結論與建議 59
5.1 結論 59
5.2 未來研究方向建議 60
參考文獻 61

參考文獻
Belk, R. (2014). You are what you can access : Sharing and collaborative consumption online. Journal of Business Research, 67(8), 1595–1600. https://doi.org/10.1016/j.jbusres.2013.10.001
Bertossi, A. A., Carraresi, P., &Gallo, G. (1987). On some matching problems arising in vehicle scheduling models. Networks, 17(3), 271–281. https://doi.org/10.1002/net.3230170303
Bunte, S., &Kliewer, N. (2009). An overview on vehicle scheduling models. Public Transport, 1(4), 299–317. https://doi.org/10.1007/s12469-010-0018-5
Geng, Y., &Cassandras, C. G. (2012). A New “Smart Parking” System Based on Resource Allocation and Reservations. Procedia - Social and Behavioral Sciences, 54(October 2012), 1278–1287. https://doi.org/10.1016/j.sbspro.2012.09.842
Haghani, A., &Banihashemi, M. (2006). Heuristic approaches for solving large-scale bus transit vehicle scheduling problem with route time constraints. Transportation Research Part A: Policy and Practice, 25(3), 127–130. https://doi.org/10.1093/teamat/hri030
Schlote, A., King, C., Crisostomi, E., &Shorten, R. (2014). Delay-tolerant stochastic algorithms for parking space assignment. IEEE Transactions on Intelligent Transportation Systems, 15(5), 1922–1935. https://doi.org/10.1109/TITS.2014.2304356
Shao, C., Yang, H., Zhang, Y., &Ke, J. (2016). A simple reservation and allocation model of shared parking lots. Transportation Research Part C: Emerging Technologies, 71, 303–312. https://doi.org/10.1016/j.trc.2016.08.010
Teodorović, D., &Lučić, P. (2006). Intelligent parking systems. European Journal of Operational Research, 175(3), 1666–1681. https://doi.org/10.1016/j.ejor.2005.02.033
Yan, S., Lu, C.-C., Hsieh, J.-H., &Lin, H.-C. (2019). A Dynamic and Flexible Berth Allocation Model with Stochastic Vessel Arrival Times. Networks and Spatial Economics. https://doi.org/10.1007/s11067-018-9434-x
Yan, S., Lu, C. C., Hsieh, J. H., &Lin, H. C. (2015). A network flow model for the dynamic and flexible berth allocation problem. Computers and Industrial Engineering, 81, 65–77. https://doi.org/10.1016/j.cie.2014.12.028
Yang, H., Liu, W., Wang, X., &Zhang, X. (2013). On the morning commute problem with bottleneck congestion and parking space constraints. Transportation Research Part B: Methodological, 58, 106–118. https://doi.org/10.1016/j.trb.2013.10.003
陳柏瑋. (2014). 停車位共享系統之穩健排程. 國立台灣科技大學.