= spread parameter setting variability in the fish velocity Fig. 24 Movement along axis of segment vs. time. Shown are mean path, three paths, and 95% confidence intervals. For these simulations, r is set at 10, and set at 20. |
|---|
![]() |
The stochastic equation describing fish positions is random so we must define the probability distribution of fish position over time instead of the actual position, which changes from one fish to another. The probability density function (pdf) of the stochastic differential equation (eq (46)) can be defined with a Fokker-Planck (Gardiner 1985) equation
To solve the pdf from eq (46), boundary conditions must be identified. We assume that upon release into a segment a fish can move upstream or downstream in the segment but once it has reached the downstream end of the segment, at x = L, it will move into the next segment. The next downstream segment may be a confluence or the forebay of a dam. The boundary conditions are
The solution to the partial differential equation (eq (46)) describing the probability distribution of fish in a river segment is a probability density function for the fish. This is
An example of the distribution of p with respect to x for different times is illustrated in Fig. 25. The pdf in the figure can be interpreted as probability where a fish is in the river at any time. It can also be interpreted as the distribution of a group of fish in a river segment if they have experienced no predation. Notice that the group moves down the segment and spreads over time. At the absorbing boundary representing a dam, the fish enter the boundary regions and pass through to the next segment. Note that the equation cannot define the deterministic path of fish with time.
Fig. 25 Plot of eq (48) for various values of t. Parameters r, and L are set at 5, 8, and 100 respectively. |
|---|
![]() |
The probability that a fish that entered the river segment at time ti is still in the river segment at time tj is obtained by integrating eq (48) over reservoir length. This is expressed
= cumulative distribution of the standard normal distribution
t is
This is the arrival time distribution at the point L, which is generally a dam or river confluence. The number of fish exiting each river segment is defined by eq (50).
| Fig. 26 Fish distribution, p (x, t), at tj and t j-1. Size of the shaded area represents probability of fish leaving the segment over the interval tj - t j - 1 |
|---|
![]() |
The flow independent migration rate is driven by two parameters,
min and
max.
min is the flow independent migration rate at the time of release (TRLS), and
max is the maximum flow independent migration rate. In the equation below (eq(51)), it is easier to express the equation in terms of
0 and
1, with the following relations:
's = regression coefficients, described above
= average river velocity during the average migration period
= slope parameter The equation has a minimum value of
0 and a maximum value of
0 +
1. T0 determines the inflection point, and
determines the slope. Fig. 27 contains example plots of the equation and demonstrates how varying the parameter affects the shape of the curve.
Fig. 27 Examples of the logistic equation (eq (53)) with various parameter values. In all four plots, the parameter values for the solid curves are: 0 = 1.0, 1 = 2.0, = 0.2, and T0 = 20. In the upper left plot 0 is varied, and 1 is varied in the upper right. In the lower left plot, is varied, and T0 is varied in the lower right. |
|---|
![]() |
Implementing the Travel Time Algorithm
The basic unit of the travel time algorithm is a reach of river between two nodes, where a node is a dam, confluence of two rivers, or a release point (Fig. 28). The travel time algorithm passes a group of fish from node to node and determines the distribution of travel times from an upstream node to the next downstream node.
CRiSP.1 groups fish according to user preference. The user defines species (and stocks, if desired) in the columbia.desc file and associates behavioral characteristics with each species through the user interface or the yearly input data file1. For instance, the user may decide that all chinook 1's should be treated identically or that wild and hatchery stocks be treated separately. All releases that are treated similarly are referred to as a release group, except for the random selection of a migration rate variance.
During one iteration of the travel time algorithm, fish from a release group pass through a reach. The input to CRiSP.1 is the number of fish from the release group that are ready to depart a node during the time interval. This input group is passed to the next node downstream with the travel time distributions determined by eq (49) and eq (50). Fig. 29 demonstrates a single iteration of the travel time algorithm.
columbia.desc creates three species: chinook 1 = spring chinook, chinook 0 = autumn chinook, and steelhead.
Columbia River Salmon Passage Model CRiSP.1.5 Theory, Calibration & Validation Manual
Copyright © 1996, Columbia Basin Research. All rights reserved.