由於公共自行車租借系統能節能減碳、舒緩交通擁擠問題，並具有健身效果，近年來在世界各大都會區已蔚為風尚。本研究首先探討公共自行車租借系統營運前最初始的租借站建置決策方式，在已知所有租還需求發生之時段、大小、起訖站址、候選租借站建置個數、及服務品質要求等諸多條件下，以混整數規劃模式來決定最小成本之租借站選址及初始自行車配置方式。為求更貼近現實需求，本研究提出之數學模式將考慮不同起訖需求之相對比例關係，亦即由各租車站至不同還車站之自行車流量必須與其原始的需求量成正比，並以此為模式分配車流量之主要依據。此外，本研究將探討公共自行車租借系統如何在營運階段中以暫時人力配置有效地提升服務品質，其中，「站點人力配置」模式針對空停車柱需求較多的站配置暫時人力，以增加顧客還車的方便性；而「人力自助運補」模式則利用折扣或促銷、贈品等鼓勵方式，招募適量的自願者依系統指示來騎乘自行車，以達到運補的效果。最後，本研究探討如何在夜間無人租借時段，以「靜態自行車運補」的方式指派運補車至各站，將各站期初自行車運補成其期望之配置數量，幫助系統在租借期間降低無車可租與無位可還的次數。

In this thesis we first present how to formulate a network design problem for bike sharing systems that selects the best locations for constructing rental sites and the best amount of bikes as well as racks to be installed in each site with minimum total cost satisfying a given service level. To mimic the actual biking traffic between rental sites, we force the bike flows to be proportional to their designed patterns obtained by a surveyed demand profile. Based on the proportion, we propose a nonlinear mixed integer model and solve it by a two-stage Particle Swarm Optimization (PSO) algorithm.
We then propose linear programming models to allocate temporary manpower on rental sites to take care of excessive returned bikes, and seek volunteer bikers on some specific origin-destination routes to balance the demands on bikes and empty racks at stations, so that the designed quality of service can be achieved with minimum cost.
We finally introduce a static repositioning mathematical programming model that seeks the best routing and load/unload plans for each repositioning vehicle with balanced workload. We present two static repositioning models based on different forms of flow balance constraints, and observe that the model based on assignment problem has better performance. We also propose PSO algorithms for solving the static repositioning problem of larger size.

劉奕青. (2003). 自動販賣機存貨途程問題之研究. 元智大學.

謝騰飛. (2010). 使用螞蟻演算法求解隨機需求車輛路徑問題－以販賣機補貨車為例. 國立高雄第一科技大學

Ai, T. J., and Kachitvichyanukul, V. A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers and Operations Research, 36(5), 1693-1702, 2009.

Ann, C., Lloyd, C., Anton, K., and Martin, S. The Inventory Routing Problem: Kluwer Academic Publishers, 1998.

Aydin, M. E., and Fogarty, T. C. A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems. Journal of Heuristics, 10(3), 269-292, 2004.

Bard, J. F., and Nananukul, N. Heuristics for a multiperiod inventory routing problem with production decisions. Computers and Industrial Engineering, 57(3), 713-723., 2009.

Benchimol, M., Benchimol, P., Chappert, B., De La Taille, A., Laroche, F., Meunier, F., and Robinet, L. Balancing the stations of a self-service bike hire system. RAIRO- Operations Research, 2011.

Bodin, L., Golden, B. L., Assad, A., Ball, M. Routing and Scheduling of Vehicles and Crews, Computers and Operations Research. Vol. 10, No.2, pp.63-211, 1983.

Chang, L. C. Design and management of urban bike sharing systems. Master Thesis, National Cheng Kung University, 2010.

Chaudhry, S. S., He, S., and Chaudhry, P. E. Solving a class of facility location problems using genetic algorithms. Expert Systems, 20(2), 86-91, 2003.

Chien, T. W., Balakrishnan, A., and Wong, R. T. An Integrated Inventory Allocation and Vehicle Routing Problem. Transportation Science, 23(2), 67-76, 1989.

Contardo, C., Morency, C., Rousseau, L. M., Balancing a dynamic public bike-sharing system, CIRRELT, CIRRELT-2012-09, 2012. https://www.cirrelt.ca/DocumentsTravail/CIRRELT-2012-09.pdf

Dantzig, G. B., and Ramser, J. H. The Truck Dispatching Problem. Management Science, 6(1), 80-91, 1959.

Daskin, M. and Owen, S. Location models in transportation. Handbook of Transportation Science, 311–360, 1999. (Boston/Dordrecht/London: Kluwer Academic Publishers)

Deif, I. and Bodin, L. Extension of the Clarke and wright algorithm for solving the vehicle routing problem with backhauling. Kidder, Proceedings of the Babson Conference on Software Uses in Transportation and Logistic Management, 75-96, 1984.

Edelstein, M., and Melnyk, M. The Pool Control System. Interfaces, 8(1-Part-2), 21-36, 1977.

Golden, B. L., Baker, E. K., Alfaro, J. L. and Schaffer, J. R. The vehicle routing problem with backhauling: two approaches. working paper MS/S 85-017, University of Maryland, College Park, 1985.

Groß, D., Hamacher, H., Horn, S., and Schöbel, A., Stop location design in public transportation networks: covering and accessibility objectives. TOP, 17(2), 335-346, 2009.

Hokey, M. The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research Part A: General, 23(5), 377-386, 1989.

Hung, C. P. Optimal Station Allocation and Dynamic Bike Repositioning Strategies for Public Bike Sharing Systems. Master Thesis, National Cheng Kung University, 2011.

Kennedy, J. and Eberhart, R. Particle swarm optimization. IEEE International Conference on Neural Networks, 1942-1948, 1995.

Laporte, G., Mesa, J. A., and Ortega, F. A. Optimization methods for the planning of rapid transit systems. European Journal of Operational Research, 122(1), 1-10, 2000.

Levanova, T. V., and Loresh, M. A. Algorithms of Ant System and Simulated Annealing for the p-median Problem. Automation and Remote Control, 65(3), 431-438, 2004.

Lin, J. R., and Yang, T. H. Strategic design of public bicycle sharing systems with service level constraints. Transportation Research Part E: Logistics and Transportation Review, 47(2), 284-294, 2011.

Mohemmed, A. W., Sahoo, N. C., and Geok, T. K. Solving shortest path problem using particle swarm optimization. Applied Soft Computing, 8(4), 1643-1653, 2008.

Murray, A. T. Strategic analysis of public transport coverage. Socio-Economic Planning Sciences, 35(3), 175-188, 2001.

Pachon, J., Iakovou, E. and Chi, I. Vehicle fleet planning in the car rental industry. Journal of Revenue and Pricing Management, 5(3), 221-236, 2006.

Pachon, J. E., Iakovou, E., Ip, C., and Aboudi, R. A Synthesis of Tactical Fleet Planning Models for the Car Rental Industry. IIE Transactions, 35(9), 907-916, 2003.

Pongchairerks, P. and Voratas, K. A particle swarm optimization algorithm on job-shop scheduling problems with multi-purpose machines. Asia-Pacific Journal of Operational Research, 26(2), 161-184, 2009.

Raviv, T., Tzur, M., and Forma, I. A. Static Repositioning in a Bike-Sharing System:Models and Solution Approaches, 2010. Working Paper, http://dl.dropbox.com/u/717696/Home%20Page/Publications/Static%20Repositioning%20in%20a%20Bike-Sharing%20System.pdf

Salhi, S. Defining tabu list size and aspiration criterion within tabu search methods.
Computers and Operations, 29, 67-86, 2002.

Sevkli, M. and Guner, A. R. A continuous particle swarm optimization algorithm for uncapacitated facility location problem. Ant Colony Optimization and Swarm, 4150, 316-323, 2006.

Shintani, K., Imai, A., Nishimura, E., and Papadimitriou, S. The container shipping network design problem with empty container repositioning. Transportation Research Part E: Logistics and Transportation Review, 43(1), 39-59, 2007.

Shu, J., Chou, M., Liu, Q., Teo, C. P., and Wang, I. L. Bicycle-Sharing System:Deployment,Utilization and the Value of Re-distribution, 2010. Working Paper, http://bschool.nus.edu/Staff/bizteocp/cv/tcp-resume.htm

Wang, C. W. A Simulation Study on the Design and Management Strategies to Public Bike Sharing Systems. Master Thesis, National Cheng Kung University, 2011.

White, W. W. Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers. Networks, 2(3), 211-236, 1972.

Wu, L. Y., Zhang, X. S., and Zhang, J. L. Capacitated facility location problem with general setup cost. Computers and Operations Research, 33(5), 1226-1241., 2006.

Yang, T. H., Lin, J. R. and Chang, Y. C. Strategic design of public bicycle sharing systems incorporating with bicycle stocks considerations. Proceeding of The 40th International Conference on Computers and Industrial Engineering, 25-28, 2010. (Awaji, Japan)