都市路邊停車收費管理員巡場作業模式之研究─以台北市為例

Abstract

影響管理員巡場作業時間之因素，經分析以步行速率、開單時間及過馬路 所需時間為主，本研究即考慮此三項因素，運用ｍ－TSP及Sweep Method 等方法，構建各管理員之最適巡場路線模式、路網組成及所需使用人力數 ，並探討在不同之巡場間隔時間要求下，其巡場路線、路網組成、使用人 力數之差異，及與台北市停車管理處目前編組情形加以比較，以驗證本模 式之可行性。經由研究分析可知，要求之巡場間隔時間之長短對收費管理 員巡場路線長度及路網組成之影響極大，及在求解路網組成中，可發現起 始路段不同，對路網之組成將有影響，故於模式運作過程中，應測試比較 各種可能性。 The major elements that influence the required time for the patrol operation on street parking are walking speed, ticketing delay and the waiting time to cross the roads along the patrol route. In the study, we consider about these elements, use the concept of ｍ－TSP and Sweep Method, to obtain the employee's optimal patrol schedule model, route combinations, and the man power that needed. In addition, we discuss those in case of the different constrains of patrol time interval, the difference among the patrol schedule (includes operational routings, route combinations and the employees needed). So we can compare it with the empirical example of Taipei City Parking Administration Division, so as we can verify the feasibility of the model. In this study, we could find that the different patrol time interval would make the different routings, and in the operating procedure of the model, we could find out that the different direction of the original link might got the different route, so in the operating procedure, we suggest to check each different direction and to find more different routes.