Public Bike Stations in Indianapolis: A Location Allocation Study

Location Allocation, rooted in Operations Research and Mathematical programming, allows real world problems to be solved using optimization (based on mathematics and science) and equity principles (based on ethics). Finding nearest facilities for everyone simultaneously is a task solved by numerical and algebraic solutions. Bikeshare as a public good requires equitable allocation of bikeshare resources. Distance, as an impediment, can be minimized using location allocation algorithms. Since location allocation of this kind involves large numbers, sophisticated algorithms are needed to solve them due to their combinatorically explosive nature (i.e. as ‘n’ rises, solution time rises at least exponentially – sometimes called ‘Non Polynomial Time-Hard’ problems). Every day, researchers are working to improve such algorithms, since faster and better solutions can improve such algorithms and in turn help improve our daily lives.

Author dc:creator

• Cooper, Samuel D.

Advisor dc:contributor.advisor

• Banerjee, Aniruddha

• Bikeshare
• Location allocation
• GIS
• Network

Language dc:language.iso

en_US

DOI

10.7912/C2694X

Identifier URI

http://dx.doi.org/10.7912/C2/792

OAI identifier oai:identifier

oai:scholarworks.indianapolis.iu.edu:1805/16799