Travel Cost Matrix
The Travel Cost Matrix tool computes travel time or distance between a set of origins and a set of destinations, producing a table that can be used for accessibility analysis, location planning, and spatial modeling.
1. Explanation
The Travel Cost Matrix calculates the travel cost (time or distance) between every origin–destination pair in two input layers, for a selected routing mode. The output is a table where each row represents one O-D connection and includes the origin identifier, destination identifier, and the computed travel cost.
The Travel Cost Matrix is designed for batch computation across many origins and destinations at once. This makes it the right tool when you need the raw cost data to feed into further analyses, such as location scoring, supply-demand matching, or custom accessibility indices.
2. Example use cases
- Computing walking times from all residential buildings to the nearest schools to identify underserved areas.
- Calculating car travel times between a set of warehouses (origins) and retail stores (destinations) for logistics optimization.
- Building an input matrix for a custom accessibility score that weights travel time by destination attractiveness.
- Assessing how many destinations are reachable within a given travel time threshold from each origin.
- Comparing travel cost differences between two transport modes (e.g., cycling vs. public transport) for a set of O-D pairs.
3. How to use the tool?
Toolbox Accessibility Indicators, click on Travel Cost Matrix.Routing
Transport mode to use for travel cost computation.Configuration
- Walk / Bicycle / Pedelec / Car
- Flight Distance
- Public Transport (PT)
Calculate by, select Time (min) or Distance (m).Time (min), set the Travel speed (km/h).Advanced options to set a maximum cost limit: Limit - Time (min) when calculating by time, or Limit - Distance (m) when calculating by distance. If no limit is set, the calculation is unbounded (see limits table in Technical details).For suitable travel time limits by amenity type, see the Location Tool from the City of Chemnitz.
Computes the straight-line geodesic distance between every origin–destination pair. No routing network is used. There are no configuration fields for this mode — simply select it and proceed to the Input section.
Choose PT Modes to analyze: Bus, Tram, Rail, Subway, Ferry, Cable Car, Gondola, and/or Funicular.Day (Weekday, Saturday, or Sunday) and set the Start Time and End Time for the analysis time window.Travel time limit (min) — the maximum journey duration to consider.Advanced options to configure Max. transfers, Access Mode, and Egress Mode.Input
Origins layer (a point layer where each feature is a starting location) and set the Origins label — the column used to identify origins in the result matrix.Destinations layer (a point layer where each feature is a target location) and set the Destinations label — the column used to identify destinations in the result matrix.Result layer
Destinations layer name for the output destinations point layer.Matrix layer name for the output table layer.Run.Calculation time scales with the number of O-D pairs. Check the status bar for progress.
Results
Once the calculation finishes, a table layer is added to the map panel. Each row represents one origin–destination pair that falls within the specified travel cost threshold. The origin and destination columns contain the values from your selected label columns.
| Column | Description |
|---|---|
origin | Identifier of the origin feature (from your selected Origins label) |
destination | Identifier of the destination feature (from your selected Destinations label) |
travel_cost | Travel time (minutes) or distance (meters), depending on the selected measure type |
O-D pairs that exceed the maximum travel cost are excluded from the output.
A Destinations point layer is also added, containing all original destination attributes enriched with the computed travel_cost value for each point.
Want to use this matrix for further analysis? Connect the result table as input to other tools in a Workflow or export it as CSV for use in external tools.
4. Technical details
Travel costs are computed using the same routing engine as the Catchment Area tool, ensuring consistent results across all accessibility analyses in GOAT. For each origin, the routing algorithm explores the network up to the specified maximum cost and records the cost to each reachable destination.
Computational considerations
- The number of calculations scales as O × D (number of origins × number of destinations). Large datasets with many origins and destinations will take longer to process.
- Using a realistic maximum travel cost limit significantly reduces computation time and output size.
- For Public Transport, the travel cost represents the average travel time for all feasible trips departing within the specified time window.
Unbounded calculation limits
When no maximum travel cost is set, the following limits apply based on the bounding-box diagonal of all origin–destination pairs:
| Routing mode | Maximum O-D extent (bounding-box diagonal) |
|---|---|
| Walk | 100 km |
| Bicycle | 100 km |
| Pedelec | 100 km |
| Car | 300 km |
| Public Transport | 300 km |
| Flight Distance | No limit |
Output geometry
The Travel Cost Matrix produces a table (non-spatial) layer. To visualize the connections on the map, use the Origin-Destination tool, which can take an O-D table and a geometry layer to draw flow lines.
For further insights into the routing algorithm, visit Routing.