臺灣博碩士論文加值系統

當代社會中，城市化的加速和生活水準的提高，導致了汽車的普及和車輛持有量的不斷增加。然而，車輛的快速增長帶來了停車位供不應求的嚴重問題。為了應對這一問題，共享停車的概念因此產生。近幾年臺灣最大的共享停車平台業者與停車場業者配合，將場內閒置停車位整合進共享停車平台，供用戶預約，確保車位不被先行使用，並提供更多停車位選擇。與單一營業模式下的停車位分配問題相比，混合營業模式下的車位指派更為複雜。本研究旨在探討如何根據需求，將停車場內的停車格以月租、臨停和預約共享三種不同營業方式進行分配和指派，使停車場業者資源利用最大化，以改善城市內停車位不足和交通擁擠的情況。
本研究以公有停車場委外經營業者的立場，在同時營運三種停車場經營模式下，利用網路流動及數學規劃方法，以最大化營運收入為目標，構建停車位指派分配模式，期望提供決策者規劃停車位指派的有效參考。為評估模式之實用性，本研究以臺北大安區之相關資料為例進行範例測試，並測試不同參數之敏感度分析和方案分析，結果顯示本研究之模式在實務上能有效運作，可提供給停車場業者做為混合營業模式停車場車位分配之參考。

In contemporary society, the acceleration of urbanization and the improvement of living standards have led to the widespread use of cars and an increase in vehicle ownership. However, the rapid growth of vehicles has brought about serious issues of insufficient parking spaces. To address this problem, the concept of shared parking has emerged. In recent years, the largest shared parking platform operators in Taiwan have collaborated with parking lot operators to integrate idle parking spaces into shared parking platforms, allowing users to reserve spots. This ensures that parking spaces are not preoccupied and provides more parking options. Compared to the allocation issues under a single business model, the allocation of parking spaces under a mixed business model is more complex. This study aims to explore how to allocate and assign parking spaces within parking lots based on demand, using three different business models: monthly rental, temporary parking, and shared reservations. The goal is to maximize the utilization of parking resources by parking lot operators, thereby improving the shortage of parking spaces and traffic congestion in cities.
From the perspective of public parking lots operated by outsourced operators, this study uses network flow and mathematical programming methods to construct a parking space allocation model with the objective of maximizing operating revenue. The study aims to provide decision-makers with effective references for planning parking space assignments. To evaluate the practicality of the model, this study uses data from the Da'an District in Taipei for case testing, and performs sensitivity analysis and scenario analysis with different parameters. The results show that the model proposed in this study can operate effectively in practice and can serve as a reference for parking lot operators in allocating parking spaces under a mixed business model.

摘　要 v
ABSTRACT vi
誌　謝 vii
目 錄 viii
圖目錄 xi
表目錄 xiii
第一章　緒論 1
1.1 研究背景與動機 1
1.2 研究目的與範圍 3
1.3 研究方法與流程 4
第二章　文獻回顧 6
2.1 共享停車產業發展 6
2.2 停車場車位分配 9
2.3 網路流動 11
2.4 文獻評析 14
第三章　模式建構 15
3.1 問題描述 15
3.2 模式架構 16
3.2.1 模式基本假設 16
3.2.2 網路流動 18
3.2.2.1停車位網路流動 18
3.2.2.2虛擬網路流動 22
3.2.3 符號說明 25
3.2.4 數學定式 27
3.3 模式驗證 29
3.4 小結 34
第四章　範例測試 35
4.1 資料輸入 35
4.1.1 停車需求相關資料 35
4.1.2 停車收費價格相關資料 38
4.2 模式發展 38
4.2.1 問題規模 38
4.2.2 電腦演算環境與設定 40
4.2.2.1電腦演算環境 40
4.2.2.2相關參數設定 40
4.2.3 模式輸入資料 40
4.2.4 模式輸出資料 41
4.3 測試結果與分析 41
4.4 敏感度分析 44
4.4.1 收費價格敏感度分析 44
4.4.1.1月租收費價格 44
4.4.1.2臨停收費價格 48
4.4.1.3預約共享收費價格 52
4.4.2 需求敏感度分析 56
4.4.2.1月租需求量 56
4.4.2.2臨停需求量 60
4.4.2.3預約共享需求量 64
4.4.3 連接節線敏感度分析 68
4.5 方案分析 72
4.6 管理意涵 76
第五章　結論與建議 78
5.1 結論 78
5.2 建議 80
5.3 貢獻 80
參考文獻 81

1.杜宇平、顏上堯(2002)，「空服員排班網路模式與求解演算法之研究」，運輸學刊，第14卷，第2期，頁15-29。
2.徐賢斌、王曉晴、陳紋惠、歐陽葶(2018)，「應用二階段式啟發式演算法於動態及連續性船席指派」，航運季刊，第27卷，第1期，頁87-111。
3.張馨元、吳樂、劉鼎(2022)，「考慮車位利用效率的停車位共用分配優化」，交通技術，第11卷，第4期，頁379-389。
4.答攀(2021)，「基於共享停車的停車請求決策與車位分配模型」，交通技術，第10卷，第6期，頁480-489。
5.楊曉芳、江林成(2021)，「基於系統總耗時最小的雙目標泊位分配模型」，上海理工大學學報，第43卷，第2期，頁179-185。
6.湯慶輝、王渭仲(2012)，「考量到離場航班銜接下桃園國際機場機門指派之研究」，運輸學刊，第24卷，第3期，頁305-330。
7.湯慶輝(2009)，「隨機性班機延誤下穩健最佳化機門指派之研究」，中國土木水利工程學刊，第21卷，第1期，頁67-71。
8.蔡其峰(2020)，「 以變數產生法求解預約制停車位共享系統車位指派問題」 ，碩士論文，交通大學運輸與物流管理學系研究所。
9.劉宗鑫(2018)，「共享停車位機制使用意圖之實徵研究」，碩士論文，交通大學運輸與物流管理學系研究所。
10.盧宗成、洪筠筑(2021)，「預約制共享停車位系統車位排程最佳化模式與演算法」，運輸學刊，第33卷，第4期，頁393-429。
11.陳俊穎、吳宛蓉(2019)，「地勤人員勤務指派模式之研究」，運輸計劃季刊，第48卷，第4期，頁303-322。
12.陳俊穎、許芳瑜、蕭筑云、徐學鴻(2021)，「最佳化航機指派網路模式之研究」，運輸學刊，第33卷，第3期，頁311-332。
13.顏上堯、杜宇平、朱橋榮(2003)，「機門數量最少化網路模式之研究」，運輸學刊，第15卷，第2期，頁149-164。
14.顏上堯、張紫鈺、陳怡君(2015)，「防災避難疏散排程規劃之研究」，運輸學刊，第27卷，第4期，頁565-588。
15.顏上堯、范琇綾、陳怡君(2016)，「橋樑定期檢測作業排程最佳化模式之研究」，運輸計劃季刊，第45卷，第1期，頁63-80。
16.顏上堯、黃紀涵、陳怡君(2018)，「營建廢棄物清運車輛排程暨處理廠選址最佳化之研究」，運輸計劃季刊，第47卷，第4期，頁297-318。
17.顏上堯、盧宗成、洪逸樺(2020)，「機場出境行李卸載轉盤指派最佳化模式與演算法」，運輸計劃季刊，第49卷，第1期，頁97-116。
18.顏上堯、林妤玲、陳怡君(2020)，「最佳化報廢機車回收場區位途程模式之研究」，中國土木水利工程學刊，第32卷，第2期，頁135-146。
19.Benders, J. F. (1962). “Partitioning procedures for solving mixed-variables programming problems.” Numerische Mathematik, Vol. 4, No. 1, pp. 238-252.
20.Bruno Machado, B., Pimentel, C., and Sousa, A. (2023). “Integration planning of freight deliveries into passenger bus networks: Exact and heuristic algorithms.” Transportation Research Part A : Policy and Practice, Vol. 171, 103645.
21.Camerini, P. M., Fratta, L. and Maffioli, F. (2009). “On Improving Relaxation Methods by Modified Gradient Techniques.” Mathematical Programming Studies, Vol. 3, pp. 26-34.
22.Chen, C. Y. and Kornhauser, A. L. (1990). “Decomposition of Convex Mulitcommodity Network Flow Problem.” Dept. of Civil Engineering and Operations Research. Princeton, NJ, Princeton University.
23.Chih, K. C. K. (1986). “A Real Time Dynamic Optimal Freight Car Management Simulation Model of Multiple Railroad, Mulitcommodity Temporal Spatial Flow Problem.” Princeton, NJ, Princeton University. Ph.D.
24.Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M. M. and Soumis, F. (1997). “Daily Aircraft Routing and Scheduling.” Management Science, Vol. 43, No. 6, pp. 841-855.
25.Errousso, H., Ouadi, J.I., Alaoui, E.A.A., and Benhadou, S. (2022). “Dynamic parking space allocation at urban scale: Problem formulation and resolution.” Journal of King Saud University – Computer and Information Sciences, Vol. 34, pp. 9576–9590.
26.Fisher, M. L. (1981). “The Lagrangian Relaxation Method for Solving Integer Programming Problems.” Management Science, Vol. 27, No. 1, pp. 1-18.
27.Guo, W., Zhang, Y., Xu, M., Zhang, Z., and Li, L. (2016). “Parking Spaces Repurchase Strategy Design via Simulation Optimization.” Journal of Intelligent Transportation Systems, Vol. 20, No. 3, pp. 255-269.
28.Guo, J., Guan, H., Han, Y., and Li, W. (2024). “Evolutionary analysis of participation behavior of shared parking in traditional business district.” Transport Policy , Vol. 155, pp. 110-123.
29.Hu, J. and Jiang, Y. (2024). “Accelerating Benders decomposition approach for shared parking spaces allocation considering parking unpunctuality and no-shows.” Expert Systems with Applications, Vol. 240, 122346.
30.Kennington, J. L. and Shalby, M. (1977). “An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems.” Management Science, Vol.23, No. 9, pp. 994-1004.
31.Lamatsch, A., Desrochers, M., and Rousseau, J.M. (1992). “An Approach to Vehicle Scheduling with Depot Capacity Constraints. Computer-Aided Transit Scheduling.” Springer Berlin Heidelberg, Vol. 386, pp. 181-195.
32.Liang, J.K., Eccarius, T., and Lu, C.C. (2019). “Investigating factors that affect the intention to use shared parking: A case study of Taipei City.” Transportation Research Part A: Policy and Practice, Vol. 130, pp. 799–812.
33.Lin, C.P., Ni, C.F., Li, W.C., and Chang, Y.H. (2021). “Optimized Identification of the Groundwater Contaminant Source Using Simulated Annealing Algorithm.” Journal of Soil and Groundwater Remediation, Vol. 6, No. 2, pp. 81–100.
34.Mesquita, M. and Paixão, J. (1992). “Multiple Depot Vehicle Scheduling Problem: A New Heuristic Based on Quasi-Assignment Algorithms. ” Lecture Notes in Economics and Mathematical Systems, Vol. 386, pp.167-180.
35.Powell, W. B. and Koskosidis, I. A. (1992). “Shipment Routing Algorithms with Tree Constraints.” Transportation Science, Vol. 26, No. 3, pp. 230-245.
36.Sun, H.J., Fu, D.H., Lv, Y., and Heng, Y.M. (2020). “Parking Spaces Renting and Allocation Model for Shared Parking.” Journal of Transportation Systems Engineering and Information Technology, Vol. 20, No. 3, pp. 130-136.
37.Shan, Y. S. (1985). “A Dynamic Mulitcommodity Network Flow Model for Real Time Optimal Real Freight Car Management.” Princeton, NJ, Princeton University. Ph.D.
38.Shoup, D. C. (2006). “Cruising for Parking.” , Transport Policy, Vol. 13, No. 6, pp. 479-486.
39.Xu, S. X., Cheng, M., Kong, X. T., Yang, H., and Huang, G. Q. (2016). “Private Parking Slot Sharing.” Transportation Research Part B: Methodological , Vol . 93, pp. 596-617.
40.Xiao, H., and Xu, M. (2018). “How to restrain participants opt out in shared parking market? A fair recurrent double auction approach.” Transportation Research Part C: Emerging Technologies, Vol. 93 , pp. 36-61.
41.Xiao, H., Xu, M., and Yang, H. (2020). “Pricing Strategies for Shared Parking Management with Double Auction Approach: Differential Price vs. Uniform Price.” Transportation Research Part E: Logistics and Transportation Review, Vol. 136, No. 1, 101899.
42.Yan, Q., Tao Feng, T., and Timmermans, H. (2024). “Attitudes, personality traits and private parking space owners’ willingness to engage in shared parking schemes: a hybrid prospect theoretic model.” Transportmetrica A: Transport Science, Vol. 20, No. 2, 102776.
43.Yan, S., Lu, C. C., Hsieh, J.H., and Lin, H.C. (2019). “A Dynamic and Flexible Berth Allocation Model with Stochastic Vessel Arrival Times.” Networks and Spatial Economics, Vol. 19, No. 3, pp. 903-927.
44.Yan, S. and Chen, H. L. (2022). “A scheduling model and a solution algorithm for inter-city bus carriers.” Transportation Research Part A: Policy and Practice Vol. 36, No. 9, pp. 805-825.
45.Yan, S. and Young, H. F. (1996). “A decision support framework for multi-fleet routing and multi-stop flight scheduling.” Transportation Research Part A: Policy and Practice, Vol. 30, No. 5, pp. 379-398.
46.Yan, S. and Chen, H. L. (2002). “A scheduling model and a solution algorithm for inter-city bus carriers.” Transportation Research Part A: Policy and Practice, Vol. 36, No. 9, pp. 805-825.
47.Yan, S., Chi, C. J. and Tang, C. H. (2006). “Inter-city bus routing and timetable setting under stochastic demands.” Transportation Research Part A: Policy and Practice, Vol. 40, No. 7, pp. 572-586.
48.Yan, S., Wang, S.S., and Wu, M.W. (2012). “A model with a solution algorithm for the cash transportation vehicle routing and scheduling problem.” Computers & Industrial Engineering, Vol. 63, No. 2, pp. 464–473.
49.Yan, S., Lu,C. C., and Chen, Y. T. (2023). “Optimal Reassignment of Flights to Airports Baggage Unloading Carousels in Response to Temporary Malfunctions." International Journal of Industrial Engineering, Vol. 30, No. 2, pp. 387-401.