| 摘要: | 隨著都市化後，交通網路密集連結，各城市致力改善市民生活品質與交通問題，近年來，RFID普及與環保意識抬頭，讓公共自行車租賃系統變得十分熱門。公共自行車與以往不同，能快速借還自行車，且各車站皆不需要安排人力進行租借服務，可作為將公共交通和城市聯繫起來的交通樞紐，其公共性質多於商業性質，其地點也不同於以往設置在觀光景點之觀光自行車，而是完全融入城市生活圈，做為通勤、休閒、便利與大眾交通到不了的最後一哩路。近年來，公共自行車系統已成為都市民眾生活的一部分，不僅增加城市形象，更成為疏通交通的工具，雖然公共自行車站不需要人力協助租借服務，但仍然具有定期維修與車輛調度之需求，所以仍需要人力維持服務品質。
當城市仰賴公共自行車租賃系統，則需要持續維持高服務水準與服務品質，此時如何有效提升服務率變成十分重要的問題。公共自行車租賃服務與商品出售不同，因為交通網路始終維持固定數量自行車，搬運車補貨必定來自其他自行車站，且過多與過少配置都會形成浪費，因此，有必要探討如何有效滿足補貨需求，降低成本。本研究探討在一個單一運補車只能造訪每個車站一次的情況下，我們必須計算每一台腳踏車的搬運成本，我們提出兩個基於分支切割法產生的演算法，來尋找最佳的解決方案。
;With urbanization, the transportation network connected densely, each city is committed to improving people′s quality of life and traffic problems, in recent years, relying on environmental awareness and popularity of RFID, public bicycle rental system becomes very popular. Unlike in the past that public bicycle is simple and fast circulation bike, and each station does not need to arrange human to conduct rental service, can be used as public transport and link urban transport hub, Its public nature is more than commercial in nature, as commuting, leisure, convenience and public transportation cannot reach the last Mile. Recent years public bicycle systems have become part of the urban population lives, not only increase the city′s image and become a tool to clear traffic, although public bike station does not need human to assist rental service, but there still needs regular maintenance schedule of the vehicle, so still need manpower to maintain the quality of service.
When the city relies on public bike rental system, we need to continue to maintain a high standard of service and quality of service, at this time, how to effectively improve service rate becomes a very important issue. Public bicycle rental service is different from the sale of goods, because the transportation network has always been to maintain a fixed number of bicycles, van replenish bikes must come from other bike stations, and too much or too little configuration will cause the cost burden, it is therefore necessary to explore how to meet replenishment requirements and reduce costs. In this study, in the case of a single vehicle and a single visit the station is set and each bike we carried on vehicle need to calculate its cost, we proposed two algorithms to solve this problem based on branch-and-cut algorithms to find an optimal solution. |
