{"id":{"repo_id":"iupui","oai_identifier":"oai:scholarworks.indianapolis.iu.edu:1805/16799"},"canonical_url":"https://search.dev.ndltd.org/etd/iupui/oai:scholarworks.indianapolis.iu.edu:1805/16799","repository":{"repo_id":"iupui","name":"IUPUI","base_url":"https://scholarworks.indianapolis.iu.edu/server/oai/request"},"display":{"title":"Public Bike Stations in Indianapolis: A Location Allocation Study","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Cooper, Samuel D."],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Banerjee, Aniruddha"],"committee_chairs":[],"committee_members":[],"year":2018,"date_issued":"2018-02","date_published":"2018-02","updated_at":"2026-07-24T02:40:13Z","subjects":["Bikeshare","Location allocation","GIS","Network"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["10.7912/C2694X"],"render_values":[{"text":"10.7912/C2694X","href":"https://doi.org/10.7912/C2694X","code":true}]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://dx.doi.org/10.7912/C2/792"],"render_values":[{"text":"http://dx.doi.org/10.7912/C2/792","href":"http://dx.doi.org/10.7912/C2/792","code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/1805/16799","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Banerjee, Aniruddha"]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Wilson, Jeffrey S.","Lulla, Vijay"]},{"key":"dc:creator","label":"Author","values":["Cooper, Samuel D."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-07-25T16:23:51Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2018-07-25T16:23:51Z"]},{"key":"dc:date.issued","label":"Date","values":["2018-02"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Bikeshare","Location allocation","GIS","Network"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.doi","label":"DOI","values":["10.7912/C2694X"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1805/16799","http://dx.doi.org/10.7912/C2/792"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Indiana University-Purdue University Indianapolis (IUPUI)"]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Public Bike Stations in Indianapolis: A Location Allocation Study"]}]}],"canonical_facts":{"dc:contributor.advisor":["Banerjee, Aniruddha"],"dc:contributor.other":["Wilson, Jeffrey S.","Lulla, Vijay"],"dc:creator":["Cooper, Samuel D."],"dc:date.accessioned":["2018-07-25T16:23:51Z"],"dc:date.available":["2018-07-25T16:23:51Z"],"dc:date.issued":["2018-02"],"dc:description":["Indiana University-Purdue University Indianapolis (IUPUI)"],"dc:description.abstract":["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."],"dc:identifier.doi":["10.7912/C2694X"],"dc:identifier.uri":["https://hdl.handle.net/1805/16799","http://dx.doi.org/10.7912/C2/792"],"dc:language.iso":["en_US"],"dc:subject":["Bikeshare","Location allocation","GIS","Network"],"dc:title":["Public Bike Stations in Indianapolis: A Location Allocation Study"],"dc:type":["Thesis"]},"updated_at":"2026-07-24T02:40:13Z"}