Team 13955: Computing Along the Big Long River

Page 10 of 18 Control #13955
3 Scheduling Simulation
We will now use our model to briefly demonstrate how it could be used to schedule river trips.
In the following example, we assume there are 50 campsites along the 225 mile river, and introduce 4
groups to the river each day. We project the trip schedules of four specific groups, which we introduce
to the river on day 25. We choose a midseason date to demonstrate our models stability over time:
g ! : Motorized boat, t ! = 6
g ! : Oar-powered river raft, t ! = 18
g ! : Motorized boat, t ! = 12
g ! : Oar-powered river raft, t ! = 12
Campsite numbers and priority values for each group
Number of nights spent on river
g ! P ! g ! P ! g ! P ! g ! P !
1 5 1.43 2 1.32 3 1.28 1 3.85
2 20 0.71 6 0.87 19 0.4 8 0.96
3 20 1.07 6 1.32 19 0.61 8 1.44
4 36 0.79 13 0.81 19 0.81 15 1.02
5 36 0.99 13 1.01 19 1.01 15 1.28
6 49 0.87 13 1.21 35 0.66 23 1
7 OFF 1 13 1.42 35 0.77 25 1.08
8 13 1.66 35 0.88 32 0.96
9 15 1.58 35 0.99 32 1.08
11 23 1.14 35 1.1 39 0.99
12 30 0.96 49 0.86 39 1.08
13 30 1.05 49 0.94 46 1
14 30 1.14 OFF 1 OFF 1
15 36 1.02
16 36 1.1
17 44 0.96
18 44 1.02
19 44 1.01
20 OFF 1
Figure 3.1: Shows each group’s campsite number and priority value for each night spent on the river.
I.e. the column labeled g ! gives campsite numbers for each of the nights of g ! ’s trip.
We find that each g ! is off the river after spending exactly t ! nights camping, and that P ! → 1 as
d ! → t ! . These findings are consistent with the intention of our method as outlined in section 2:
Methods. We see in this simulation that our algorithm produces desirable results. Figures 3.1 and 3.2,
display our results graphically.