Show simple item record

dc.contributor.authorQingge, Letu
dc.contributor.authorSmith, Killian
dc.date.accessioned2017-12-18T21:16:29Z
dc.date.available2017-12-18T21:16:29Z
dc.date.issued2016-10
dc.identifier.urihttps://scholarworks.montana.edu/xmlui/handle/1/14092
dc.description.abstractIn this paper, we consider the two different aspects of the bike parking problem; namely the assignment of bike racks to locations, and the selection of the minimal number of bike rack locations satisfying some maximum walking distanced. The first sub-problem considered was the assignment of bike racks to individual buildings in the attempt to satisfy the needs of the total number of cyclists expected to reside within a building during the course of an average day. We show that the case of assigning a finite number of bike racks to all buildings on a campus is NP-Hard, and propose a greedy algorithm to obtain a solution. The case of allowing for additional bike racks to be purchased is shown to bePolynomial-Time solvable. The second sub-problem, finding the minimal number of bike rack locations, is shown to be NP-Hard, and a method to use approximation algorithms for the Maximum Independent Set to find solutions is demonstrated.en_US
dc.language.isoen_USen_US
dc.publisherMontana State Universityen_US
dc.titleOptimizing Cyclist Parking in a Closed Systemen_US
dc.typePresentationen_US
dc.typeVideoen_US
mus.citation.extentfirstpage1en_US
mus.citation.extentlastpage6en_US
mus.identifier.categoryEngineering & Computer Scienceen_US
mus.relation.collegeCollege of Engineeringen_US
mus.relation.departmentComputer Science.en_US
mus.relation.universityMontana State University - Bozemanen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record