This report is an archived publication and may contain dated technical, contact, and link information 

Publication Number: FHWAHRT05137
Date: July 2006 
`
Evaluation of Safety, Design, and Operation of SharedUse PathsFinal ReportPDF Version (1172 KB) PDF files can be viewed with the Acrobat® Reader®
CHAPTER 3. DEVELOPMENT OF THEORYINTRODUCTIONThis chapter discusses the theoretical underpinnings of the proposed operational models. The first model (discussed in the next section) was developed for the purpose of estimating the desired number of active passing, passive passing, and meeting events on a shared path from the perspective of the bicyclist. In calculating the desired number of events, it is assumed that the path has adequate width, so that no passing or other events are constrained by the path geometry. Active passing refers to the situation where the average bicyclist (traveling at the average bicycle speed) desires to pass slower moving vehicles on the path (i.e., bicycles, pedestrians, inline skaters, etc.). Passive passing refers to the average bicyclist being overtaken by faster moving bicyclists or other modes. Meeting refers to the number of opposing vehicles that are met while the average bicyclist is on the path. This model is demand oriented and uses primarily the attributes of the mixed traffic flow that are on the path. These attributes consist of the modal volumes and their respective means and standard deviations of speeds over the path. As will be indicated in chapters 4 and 5 on field data collection and analysis, the modal attributes pertaining to speed are based on the fieldverified assumption that speeds are normally distributed with a given mean and standard deviation that may vary from mode to mode. The second model discussed in this chapter imposes constraints on the number or fraction of passing maneuvers that can be executed because of the geometry of the path. The motivation for focusing on active passing maneuvers is founded on the results of the perception data analysis (chapter 7), where the primary impedance reported is related to the inability of the bicyclist to pass other users on the path. In this model, the path width is converted into an equivalent number of lanes in each direction, and a probabilistic model of the delayed passing maneuvers for each lane configuration is estimated. The LOS method described in chapter 8 uses the actual number of delayed passings per hour (which is the product of the desired passing maneuvers and the probability of a delayed passing) in determining the path LOS.
ESTIMATING THE NUMBER OF EVENTSThe estimates shown in this chapter are founded on the original work done by Botma^{(5, 43)} and are partially documented in the 2000 HCM.^{(4)} The original work by Botma was confined to two modes, namely pedestrians and bicycles. The proposed model extends Botma's calculations to estimate the desired number of meetings and passings by any vehicle (bicycle, pedestrian, inline skater, etc.) at any desired speed. As stated in the previous section, the speeds of the various modes are normally distributed, and this assumption was verified with field data. A second difference between the proposed approach and Botma's is the numerical nature of the model. This is because the area under the normal distribution curve (representing modal speed) is needed to calculate the estimated number of events. For simpler speed distributions (e.g., uniform distribution), closedform solutions can be derived. However, because the method is numerical, it should be able to cope with any (or more than one) speed distribution for each of the modes using the path. The same type of models can be used to look at crossmodal meetings and passings (e.g., bicycles passing pedestrians, etc.). The model is meant to be applied for one pair of modes at a time. This means that the procedure first predicts the number of events encountered by the average bicyclist when considering other bicyclists only. The model is then reapplied when considering another mode (e.g., pedestrians), and so forth. The total number of events is then summed across all modes, and provides an overall picture of the multimodal passing and meeting demand on the path. The following derivations are therefore limited to a pair of modes. The "test unit" in this case refers to the bicycle mode. Modal flow rates and speed apply to the mode that is impeding the bicycle mode on the path. Glossary of Variables
ESTIMATING ACTIVE PASSING EVENTSActive passing is defined as the desired number of passing maneuvers for the test vehicle (in our case, a bicycle, but it could be any mode), which is traveling at a constant speed, U, and encountering an impeding modal stream (other bicycles, pedestrians, etc.), which is traveling in the same direction at a speed (v) that is normally distributed in space with N(,^{2}). This situation is depicted graphically in figure 1.
Figure 1. Schematic for active passing estimation. In our example, the test vehicle is a bicycle that is traveling at speed U. Let x be the distance from the location of the test bicycle to a strip on the path of length dx. By definition, the expected number of modal units in dx is k * dx. The desired number of passings by the test bicycle of those units in dx can be calculated as follows. The test bicycle will pass only those units in dx that will exit the segment L after the test bicycle has exited. Mathematically, this is defined as:
which, with some manipulation, gives:
Therefore, the expected number of active passings for strip dx will be:
Since v is distributed with N(,^{2}), then the stated probability in equation 10 can be easily calculated from the integral under the standard normal curve. By dividing the full length of the shared path into small discrete slices, each of length dx, the cumulative probability, F(x), and the expected number of active passing maneuvers can be calculated as the average of the probability at the start and end of each slice, as shown in equation 11 below:
The number of active passing events is then summed over all slices to produce the desired passings for the entire path. As an illustration, the following numerical example demonstrates the model application: Let L = 1 mi, Q = 400 bicycles per hour, x = 0.2 mi, dx = 0.01 mi, U = 15.5 mi/h, = 12.5 mi/h, and = 3 mi/h. The density of modal users is estimated at k = 400/12.5 = 32 vehicles/mi (1 mi = 1.61 km, 1 mi/h = 1.61 km/h). Applying equation 11,
where Z is the standard normal variable. Similiarly, at the downstream end of the slice:
which, according to equation 11, gives: P [ ] = (0.507 + 0.487)/2 = 0.497 and E (pa) = 32 * 0.01 * 0.497 = 0.159 desired passing maneuvers. By numerically repeating this process for x = 0.01 to 1 mi in increments of 0.01 mi (1 mi = 1.61 km), the total number of active passings on the path can be estimated. For this example, the total number of desired passing maneuvers can be shown to be 6.71 for the test bicycle. A portion of a spreadsheet illustrating the above computations for active passing events is shown in table 5. The above computations are bolded in the table. It should be noted that since the number of passing events is random, the standard deviation is computed as the square root of the mean number of events, based on the Poisson property. Extension to Exclude Marginal Active Passing Events The stated probability formulation in the preceding section is quite restrictive in that a desired passing is considered to take place even when there are very small differences in speed between the test unit and slower moving units ahead of it. This assumption can be relaxed to restrict the count of active passing to cases where the ratio of the speed of the passed vehicle to the passing vehicle is below a certain threshold. Let that threshold be b (see table 5). In this case, the probability of passing described in equation 9 can be restated as:
When = 1, the number of active passings estimated by equation 12 reverts to the original formulation in equation 9. As b drops below 1, the probability decreases, and so does the number of desired passings. For the above example, a beta threshold of 0.80 (meaning that a desired passing occurs only if the passed vehicle speed is below 80 percent of the passing vehicle speed) will result in a drop of active passings from 6.71 to 5.66, a reduction of about 16 percent. Table 5. Computational spreadsheet for active passing events
Estimating the Number of Passive Passing Events By definition, passive passing events refer to the number of units that will overtake the test vehicle as it travels at speed U over the path. The test vehicle is overtaken by other units traveling in the same direction at speeds that are characterized by a normal distribution N(,^{2}). Units that are already in the path cannot overtake a test vehicle that is about to enter the path. Passive passing events are thus calculated for units that are about to enter the path, based on their travel time relationship to that of the test unit. Again, a unit will pass the test unit if: (1) it is behind the test unit when the test unit enters the path, and (2) it will exit the path prior to the test unit. This process is illustrated in figure 2 below.
Figure 2. Schematic for passilve passing estimation. In this case, the probability that a modal unit at location dx (e.g., faster bicycle) will pass the test bicycle, which is traveling at speed U while on path L, is the probability that the unit will exit the path prior to the test bicycle, or:
which can be rewritten as:
The expected number of passive passings because of the units that are in dx at time zero is:
An important question arises regarding the length x needed to capture most of the passive passing events. It is evident that the slower the test unit or the higher the average modal user speed, the longer x should be. Define as the lowest probability of passing to be included in the computations. Note that as x increases, the probability of a passive passing event decreases. Then, the objective is to find the lowest x, x*, such that:
Assuming a normal distribution of speeds over space, the standard normal variable Z that corresponds to is Z_{} and P (Z > Z_{}) = . Then, the minimum value of x is computed as:
As an example, let L = 1 mi, x = 0.2 mi, dx = 0.01 mi, Q = 400 vehicles per hour, = 12.5, s = 3, U = 9.5 mi/h, and = 0.01 (1 mi = 1.61 km, 1 mi/h = 1.61 km/h). From a standard normal distribution table, Z^{0.01} = +2.326. Substituting into equation 19 gives:
This is slightly longer than the actual path length. If a more accurate estimate is neededsay only probabilities less than 0.005 are ignoredthis will require a longer analysis length of 1.8 km (1.129 mi). Similar to the active passing procedure, the individual slice passings are aggregated over each dx and summed over L to calculate the total number of passive passings on the path. For the example above, it can be shown that for x = 0.20 mi (0.32 km):
and the total passive passing events over the entire path are estimated at 10.95. Portions of a computational spreadsheet that executes the above equations are shown in table 6.
Table 6. Computational spreadsheet for passive passing events.
Extension to Exclude Marginal Passive Passing Events Similar to the active passing condition, the above formulation can be extended to restrict passive passing to cases where the ratio of the speed of the passing vehicle to the speed of the passed vehicle is above a certain threshold. Let that threshold be ; therefore, the probability of passing can be restated as:
For = 1, the number of passive passings in equation 18 reverts to the original formulation (equation 16). As increases above 1, the probability decreases, and so does the number of desired passings. For the above example, a Gamma threshold of 1.25 (meaning that a desired passing occurs only if the passing vehicle speed is 25 percent above the slower vehicle speed) will result in a drop of active passings from 10.95 to 9.96 (about 9.1 percent).
Estimating the Number of MeetingsUsing the same concepts outlined in the previous section for passive passing events, let x be defined as a segment of the path upstream from the segment of interest in the opposing direction. It is obvious from the schematic in figure 3 that every opposing vehicle that is present on the path when the test unit enters it will meet the test unit regardless of speed, assuming, of course, that no vehicle enters or exits the path at an intermediate point. In addition, all opposing vehicles that enter the segment before the test vehicle exits it will also meet the test unit. The computations in this section focus on this second term. The probability of a meeting because of units that are present at location dx at time zero (when the test vehicle enters the path) is estimated as:
Figure 3. Schematic for meeting event estimation. Which can be reorganized as:
and the corresponding average number of meeting events because of units in dx is:
Similar to the case of passive passings, the minimum length x* to guarantee a minimum probability d of inclusion into the computations of meetings can be calculated from the equation:
where Z is the standard normal variable. The total number of meetings is then calculated as the sum of the meetings with opposing vehicles that are already on the path when the test unit enters it (this is simply the equivalent of the opposing density times the path length) and meeting with vehicles that have yet to enter the path (as described by equation 25). Therefore, the total meeting events are computed as:
For a numerical example of the calculation of the number of meetings, assume that there is a vehicle positioned between x = 0.19 mi and x = 0.20 mi when the test bicycle enters the path. Also assume L = 1 mi, x = 0.20 mi, dx = 0.01 mi, U = 15.5 mi/h, Q = 400 vehicles per hour, = 12.5 mi/h, = 3 mi/h, and d = 0.01 (1 mi = 1.61 km, 1 mi/h = 1.61 km/h). We first determine the minimum virtual path length needed to capture 99 percent of all meetings. From equation 26:
so that 124 segments, each 0.01 mi in length, would be required to numerically compute the meetings. From equation 24:
so that P[0.19  0.20] = (0.9993 + 0.999276)/2 = 0.999206. The expected number of meetings per equation 25 is computed as:
Finally, the total expected number of meetings per equation 27 is:
A partial computational spreadsheet that executes the above equations for estimating the number of meeting events is shown in figure 6. For comparison purposes, table 7 contrasts the numerical estimates of meetings developed in this work with Hein Botma's^{(5)} analytical estimate given in equation 33:
In most cases (assuming the minimum x value is satisfied), the two estimates are identical.
Table 7. Computational spreadsheet for meeting events.
Sensitivity of Passing Events to Key Parameters In this section, we present the results of a limited sensitivity analysis of the rate of desired passing events. We conducted two experiments in which the speed of the test unit and the directional flow rate, respectively, were allowed to vary while keeping all other parameters fixed. These analyses were important as a first step in understanding the basis for setting LOS thresholds for shared paths. In both experiments, the following parameters were kept fixed: stream speed = 20.1 km/h (12.5 mi/h), standard deviation of speed = 4.8 km/h (3 mi/h), and path travel time = 1 h (to obtain hourly passing rates). In the first experiment, the test bicyclist speed was allowed to vary from 15.3 to 24.9 km/h (9.5 to 15.5 mi/h) in 1.6km/h (1mi/h) increments. This was done to compare the passing requirements for bicyclists on either end of the speed distribution. The results are summarized in figure 7. As expected, active passing demand increased with the test bicyclist speed, while passive passing demand decreased. For a test bicyclist traveling at the average stream speed (20.1 km/h (12.5 mi/h) in the figure), the number of active and passive passing events is exactly the same, as expected. It is important to note from the figure that the total lowest passing demand occurs at that point as well. In other words, the application of the model will always assume the case of the average bicyclist. It should be remembered, however, that trip purpose could have an impact on which test bicyclist speed to use. It is obvious, for example, that based on the trend in figure 4, those cyclists at either end of the speed spectrum will have to contend with many more events than the average bicyclist does. Not shown are the effects of speed on meetings. These events are much more common, ranging from a low of 704 meetings per hour at a speed of 15.3 km/h (9.5 mi/h) to 896 meetings per hour at a speed of 24.9 km/h (15.5 mi/h), an increase of 28.5 percent. The effect on impeding bicycles in the opposite direction should be considered minimal, and is discussed further in chapter 7.
Figure 4. Sensitivity of hourly passing rates to individual bicyclist speed.
In the second experiment, the directional flow rate was allowed to vary from 100 to 700 vehicles per hour, in 150vehicle per hour increments. The test bicyclist speed was fixed at 25 km/h (15.5 mi/h). The results are summarized in figure 5. As expected, all passing rates increased as flow rate increased, with the trend close to linear. It should also be noted that the rate of passive passing events is low given that the test bicyclist speed is, on average, 4.8 km/h (3 mi/h) higher than the average traffic stream speed. On the other hand, the active passing events are quite frequent. The analysis indicates that at an exclusive bicycle path operating with 700 vehicles per hour per direction in which one would like to maintain a speed of 25 km/h (15.5 mi/h) requires an active passing maneuver on average every 3,600/196 = 18 s (obviously a very intolerable situation). By comparison, such maneuvers will occur very infrequently (every 105 s or so) when directional flow is 100 vehicles per hour. In conclusion, the preceding analysis established a mechanism for identifying passing and meeting event demand rates under a variety of operating conditions. However, the analysis did not account for the supply or capacity side of the path, in particular, how the width of the path or the number of lanes impact the ability to carry out the desired meeting and passing maneuvers. This is explained next, and provides a fundamental approach to determining LOS on multimodal shareduse paths.
Figure 5. Sensitivity of hourly passing rates to directional flow rates.
ESTIMATING THE PROBABILITY OF DELAYED PASSINGThe preceding section focused on estimating the demand for passing maneuvers. In this section, constraints on performing such maneuvers are introduced in the form of delayed passing probabilities. These constraints depend heavily on the geometry of the path, and are analyzed for two, three, and fourlane path configurations. There is no attempt to precisely translate width into the number of lanes because much of that translation really depends on how the units actually use the path. However, there are some clear assignments. A 2.4m (8ft) wide path should always be analyzed as a twolane path, a 3.6m (12ft) path as a threelane path, and a 4.8m (16ft) path as a fourlane path. Intermediate widths, however, are much more difficult to gauge, and the number of effective lanes in those cases will depend very much on the actual use. In general, and irrespective of configuration, a delayed passing maneuver emerges when there is a bicycle or pedestrian ahead of the overtaking bicycle in the subject direction in conjunction with another opposing bicycle(s) or pedestrian(s) in the opposing direction. This presence of impeding vehicles is computed for a "required passing distance" that is dependent on the type of passing vehicle and type of passed vehicle. For example, chapter 5 shows that a bicycle passing another bicycle requires 33.5 m (110 ft) of clear space, on average, to pass, while only 20.7 m (68 ft) are required for a bicycle to pass a pedestrian. For multilane paths (three or more lanes), the procedure below accounts for multiple user groups that may block multiple lanes. Each path configuration is treated separately. Common calibration features are also highlighted as needed. Glossary of Variables (1 mi = 1.61 km, 1 mi/h = 1.61 km/h)
Delayed Passing on TwoLane Paths In this case, a delayed passing in the subject direction occurs when, within the distance required to complete a pass (x^{*}), the passing bicycle encounters: (1) traffic in both directions, each blocking a single lane; or (2) no traffic in the subject direction in conjunction with traffic in the opposing direction that is being overtaken by an opposing bicycle. These two cases are illustrated in figure 6.
Figure 6. Delayed passing cases on a twolane path. The delayed passing probability in the subject direction can be expressed as:
The first term in equation 34 is simply the joint probability of blocking a lane in each of the directions. The other terms are the joint probability of no traffic in the subject lane (1  P _{ns}), traffic in the opposing lane (P_{no}), and a nondelayed passing maneuver in the opposing direction (1  P _{do}). Similarly, for the opposing direction, it can be shown that:
Solving equations 34 and 35 for P_{ds} yields the following expression:
Substituting back into equation 35 yields the corresponding value for Pdo. It is evident from this model that the likelihood of delay for the twolane case is highly sensitive to the level of opposing traffic. The above model requires the calibration of two parameters, P_{ns} and P_{no}. We now assume that the overtaken traffic in the subject direction has a density K_{s} in vehicles per mile. Thus, for a passing distance x as indicated in figure 9, and assuming Poisson counts, the probability of observing no vehicles over that length (or a vacant segment of length X) is computed as:
where K_{s} is estimated as the ratio of flow rate Q_{s} to space mean speed Us for the overtaken traffic in the subject direction. Note that if K_{s} is computed in units of vehicles per mile, then x in the above equation should be entered in miles as well. Similarly, for the opposing direction:
From equations 37 and 38, the probability of having one or more vehicles in segment x is simply computed as:
It is important to reiterate that the distance x depends on the mode being passed (i.e., other bicycles, pedestrians, inline skaters, etc.) and is not a constant. Values for x are calibrated from field data and are further explained in chapter 5. Delayed Passing on ThreeLane Paths Threelane paths represent a more difficult challenge for modeling than twolane paths because the use of the middle lane could create a variety of operational scenarios. To limit the number of possible scenarios, several assumptions were made during the development of the procedure as to how users will behave on the path. The principal three assumptions are:
As a result of the above assumptions, the middle lane can be used by:
In the threelane case, a delayed passing in the subject direction occurs when encountering: (a) traffic in the subject direction blocking the ri.cfmost lane only, in conjunction with opposing traffic occupying the other two lanes; or (b) sidebyside users blocking the two ri.cfmost lanes in the subject direction (see assumption 2 above). These cases are illustrated in figure 7. The delay passing probability in the subject direction can be expressed as:
where the probability of opposing traffic occupying the two leftmost lanes is estimated from:
Figure 7. Schematic of delayed passing on a threelane path.
Equation 33 states that opposing traffic occupying the two leftmost lanes can occur in two ways: (1) by having opposing sidebyside users occupying the two lanes (first term of the right side of equation 33), or (2) by having an undelayed opposing passing maneuver (which can occur only if there is an opposing group of users blocking the leftmost lane). Combining equations 41 and 42 gives:
Since the reciprocal case occurs in the opposing direction, it can be shown that:
Equations 43 and 44 are simultaneous equations with two unknowns, Pds and Pdo. A closedform solution can be obtained as follows. First, define:
By manipulating equations 44 and 45, it can be shown that:
Substituting in equation 43 gives:
Substituting the value of P_{ds} in equation 38 and D in equation 46 back into equation 45 gives:
Thus, the above model will estimate the probability of delayed passing in both directions simultaneously. From the above derivation, it is apparent that the model requires the calibration of four probability parameters, two for the subject and two for the opposing directions, namely P_{n} and P_{b} in each direction. This is discussed next. We start by estimating P_{b}. From field observations of threelane paths, the fraction of all events in which both lanes are blocked by traffic from the subject direction (case c in figure 10) can be estimated (note that an event is considered to occur only when there is traffic in the subject direction). Let that fraction of events be F_{bs}. This value is essentially the marginal distribution of Pbs when traffic is present in x. Therefore, we can estimate Pbs in the subject direction as:
Next, the probability of singlelane blockage Pns is estimated as:
Note that P_{vs}, the probability of a vacant segment x, is estimated from equation 37 in exactly the same manner as for the twolane paths. The same procedure is applied for the opposing traffic calibration parameters, yielding the equations below:
Delayed Passing on FourLane Paths In the case of fourlane paths, the assumption is that the path is divided in a manner similar to a divided fourlane highway. Therefore, the probability of delayed passing is taken to be independent of the amount of opposing traffic since no passing will occur in the two leftmost lanes. This is a conservative assumption, but one that it is necessary to make given the lack of national data on fourlane paths at the volume levels needed to test that assumption. Referring to equation 32, the value of P_{o} is set to zero, and the delayed passing probability is simply equal to P_{bs} (equation 49 for the subject direction, and P_{bo} (equation 51) for the opposing direction. Figure 8 depicts the delayed passing concept.
Figure 8. Schematic of delayed passingon a fourlane path.
Multimodal Delayed Passing Probability The probability estimates given in the preceding sections dealt exclusively with one pair of modal users, namely a bicycle passing another mode (other bicycles, pedestrians, etc.). Assuming that the speeds and flows of various modes on the path are independent, the probability of delayed passing under the combination of modes that interfere with the bicycle can be calculated as the probability of no delay from all modes combined. Assuming independence between scenarios (possibly a strong assumption), the aggregate delayed passing probability when encountering m different modes on the path can be shown as:
Numerical Application of the Delayed Passing Models To illustrate the concepts defined in this chapter, a numerical example of a path serving two modes–bicycles and pedestrians–is presented. The data include: Bicycle Data
Pedestrian Data
The example illustrates the difference in the probability of delayed passing for a two, three, or fourlane paths. Since flows and other parameters on the path are fully symmetrical, only the results for the subject direction are reported. Table 8 below summarizes all of the computations by mode and references the source equation for the calculation when applicable. Table 8. Numerical illustration of pathwidth effect on delayed passing.
The first four rows in the table pertain to the calculation of desired passing events as described earlier in the chapter. The analysis yields a total of about 24 desired passing maneuvers (of slower bicycles and pedestrians) by a bicyclist traveling at the average speed while on the path. The effect that path widening would have on the quality of service is shown in table 8 as exemplified by the delayed passing probability and the average time between delayed passing events. By going from two to three lanes, the delayed passing probability is reduced by about 44 percent, and the time between delayed passing events increases from 27 to 49 s. Further widening to develop a fourlane path will result in an additional reduction of 48 percent in delayed passing and a comfortable time between delayed passing events of more than 1.5 min. The analysis shown can be extended for any combination of modes that may occur in the subject and opposing direction. Based on the field data gathered in this study, we applied the delayed passing method to 25 various combinations of modes in the subject and opposing directions. The combinations included a test bicycle passing each of the five modes that were at all common on the paths we studied (bicycles, child bicyclists, joggers, inline skaters, and pedestrians), while the opposing traffic consisted of each of those same five modes. Additional details on the application for multimodal users can be found in chapter 8 and the User's Guide.
FHWAHRT05137 
Previous  Table of Contents  Next
Topics: Path, trail, bicycle, shared use, level of service, width, pedestrian, skater Keywords: Path, trail, bicycle, shared use, level of service, width, pedestrian, skater Updated: 04/12/2012
