Trip Distribution - Fratar Model Overview

A trip distribution method that forecasts travel demand by adjusting for future growth factors in population, employment, etc.

Trip numbers grow proportionally to population/employment changes in trip distribution modeling.

The general pattern of trips remains similar over time in the Fratar model.

The model ensures trips originating from a zone are equal to those arriving at that zone.

This method works best if major changes in transportation or land use are not expected.

Forecasting the flow of trips between zones within a study area.

A survey that collects data on travel between origin (O) and destination (D) points.

The process of determining the proportion of trips between zones that are taken by automobile or transit.

The reason for a trip (e.g., work, shopping, visiting).

The time perceived to travel by specific modes.

Financial factors for transportation (fuel, fare, parking).

Ease to access transportation options (e.g., stop locations).

Individual features (income, age, car ownership) that influence mode choice.

Mode choice models that don't consider system attributes (time, cost, etc).

A factor used to adjust trip numbers to ensure it is close to 1.00 (within ± 5%).

The proportion of trips taken by different modes of transportation (e.g., car, bus, train).

Models that estimate trip numbers without considering interaction between zones or trips.

Models that consider the characteristics of trip origins and destinations to evaluate travel, like land use, population or employment.

Models that consider overall travel conditions, like time, cost, and economic status of travelers to determine how many take different modes.

A method used in trip interchange models to estimate mode choice by considering service parameters like travel time and cost along with economic factors.

Trips taken using public transportation like buses or trains.

The percentage of households in an area that own cars.

A method for finding the fastest route between two points in a network, considering travel times on each link.

A graphical representation of the shortest paths in a network, showing only the minimum time paths.

A method for assigning trips where every trip between zones is routed along the shortest time path.

A factor in transportation modeling that accounts for the capacity of links to handle the assigned traffic. Travel times increase when traffic overwhelms capacity.

The shortest time possible to reach a destination.

Models used to estimate how trips are distributed among different modes of transportation.

Models that predict mode choice based on the relative utility of different modes (like driving or public transit).

The process of assigning trips to specific routes in a transportation network.

Start and end points of trips used in transportation planning.

Models which show the portion of traffic between two routes, based on relative travel time/cost.

Algorithm finding the fastest route between two points in a transportation network.

Traffic assignment method where all trips between two points use the shortest or fastest route available.

Traffic assignment method that considers the limited capacity of transportation network.

A traffic assignment approach that presumes travelers use routes that allow them the shortest travel time.

Traffic assignment approach focusing on the overall traffic network efficiency, not on individual travelers' choices.

A traffic assignment approach that considers randomness in the route choice behavior of travelers.

A traffic assignment method that gradually assigns trips between zones, adjusting travel times in each step until equilibrium is reached.

Recalculating link travel times based on the current volume (traffic) assigned to each link; in turn, it influences the assignment.

A structured representation of all possible paths that originate from a specific zone, used for choosing routes during the process.

The flow of trips between zones; essentially the traffic volume in the network.

Assigning a portion of trips at a time, recalculating time values after each portion is assigned.

The fastest or quickest route between two points in a network.

Repeating a process several times, updating based on previous results until a stable outcome emerges.

A state in which the volume of traffic along a path does not change with repeated reassignments, all the components are stable.