Indiana University-Purdue University Indianapolis (IUPUI) / 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.
| Identifer | oai:union.ndltd.org:IUPUI/oai:scholarworks.iupui.edu:1805/16799 |
| Date | 02 1900 |
| Creators | Cooper, Samuel D. |
| Contributors | Banerjee, Aniruddha, Wilson, Jeffrey S., Lulla, Vijay |
| Source Sets | Indiana University-Purdue University Indianapolis |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.0022 seconds