Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp016d5700243
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorAhmadi, Amir Ali-
dc.contributor.authorMiller, Ryan-
dc.date.accessioned2017-07-19T16:26:13Z-
dc.date.available2017-07-19T16:26:13Z-
dc.date.created2017-04-17-
dc.date.issued2017-4-17-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp016d5700243-
dc.description.abstractEvery year, Outdoor Action (OA) sends hundreds of Princeton freshmen on small-grouporientation trips to backcountry settings across the Northeast. When assigningfreshmen to these trips, OA must balance student preferences, logistical needs, andthe orientation goals of frosh trip. This paper formulates the OA trip assignmentproblem as a mathematical program, demonstrates that the problem is NP-hard, andimplements a working heuristic solution. The results of this paper can reduce theamount of time and effort required for OA to complete the trip assignment processwhile significantly improving the quality of those assignments.en_US
dc.language.isoen_USen_US
dc.titleThe Outdoor Action Trip Assignment Problemen_US
dc.typePrinceton University Senior Theses-
pu.date.classyear2017en_US
pu.departmentOperations Research and Financial Engineeringen_US
pu.pdf.coverpageSeniorThesisCoverPage-
pu.contributor.authorid960862286-
pu.contributor.advisorid960188305-
pu.certificateApplications of Computing Programen_US
Appears in Collections:Operations Research and Financial Engineering, 2000-2020

Files in This Item:
File SizeFormat 
Miller_Ryan.pdf257.05 kBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.