The Bike Share Program
Abstract
This paper proposes and solves a modi1ed allocation problem that aims to implement the Bike Sharing Program. Here, we seek to maximize the total benefit of each bike stations while minimizing the total operational cost. Through this two-step process, various optimization methods and techniques, including both linear and non-linear programming, are used to: a) determine the most optimal bike stations among all the candidate locations, and b) decide on the most optimal number of bikes needed for each station. Considering the constraints imposed by the software used in this project, Microsoft Excel, the problem is limited to selecting four stations, while operating over a 24-hour cycle. In part a, the solver has selected stations B, G, H, and N among 14 different candidates to maximize the total benefit. In part b, the optimal number of bikes during the opening hour at each of these four stations is calculated as: 297 bikes at station B, 106 bikes at station N, and no bikes at stations G and H.
References
Bixi Montreal. Ride with BIXI. 6 April, 2013. Retrieved from website: https://montreal.bixi.com/ride-with-bixi/functioning
City of Vancouver (2011, Aug 8). VanMap: Public edition. [Interactive Media]. Retrieved from website: http://vanmapp.vancouver.ca/pubvanmap_net/default.aspx
Downloads
Published
Section
License
The images, figures, and tables in the Simon Fraser University Operations Research Undergraduate Journal are not necessary those of the Simon Fraser Student Society, Operations Research Union, or the Department of Mathematics at Simon Fraser University or their respective Directors and Executives. The copyright of all contributions remains with their authors. By submitting to Analytics Now, authors acknowledge that submissions reflect original work, and that proper credit has been given to outside sources.
All material herein is Copyright 2012 by the respective authors. Permission to reprint or reproduce the material contained herein is prohibited without express written permission from the author and publisher with the exception of dissemination for non-profit, educational, academic, or informative purposes.
