path based traffic assignment problem

Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

• View all journals
• My Account Login
• Explore content
• About the journal
• Publish with us
• Sign up for alerts
• Data Descriptor
• Open access
• Published: 29 March 2024

A unified dataset for the city-scale traffic assignment model in 20 U.S. cities

• Xiaotong Xu   ORCID: orcid.org/0000-0001-7577-6194 1 ,
• Zhenjie Zheng 1 ,
• Zijian Hu 1 ,
• Kairui Feng   ORCID: orcid.org/0000-0001-8978-2480 2 &
• Wei Ma 1 , 3  

Scientific Data volume  11 , Article number:  325 ( 2024 ) Cite this article

484 Accesses

Metrics details

• Engineering

City-scale traffic data, such as traffic flow, speed, and density on every road segment, are the foundation of modern urban research. However, accessing such data on a city scale is challenging due to the limited number of sensors and privacy concerns. Consequently, most of the existing traffic datasets are typically limited to small, specific urban areas with incomplete data types, hindering the research in urban studies, such as transportation, environment, and energy fields. It still lacks a city-scale traffic dataset with comprehensive data types and satisfactory quality that can be publicly available across cities. To address this issue, we propose a unified approach for producing city-scale traffic data using the classic traffic assignment model in transportation studies. Specifically, the inputs of our approach are sourced from open public databases, including road networks, traffic demand, and travel time. Then the approach outputs comprehensive and validated citywide traffic data on the entire road network. In this study, we apply the proposed approach to 20 cities in the United States, achieving an average correlation coefficient of 0.79 in average travel time and an average relative error of 5.16% and 10.47% in average travel speed when compared with the real-world data.

Similar content being viewed by others

Global prediction of extreme floods in ungauged watersheds

Grey Nearing, Deborah Cohen, … Yossi Matias

SpatialData: an open and universal data framework for spatial omics

Luca Marconato, Giovanni Palla, … Oliver Stegle

US oil and gas system emissions from nearly one million aerial site measurements

Evan D. Sherwin, Jeffrey S. Rutherford, … Adam R. Brandt

Background & Summary

City-scale traffic data, including traffic flow, speed, and density on every road segment of the entire road network, are foundational inputs and building blocks for modern urban research. These traffic datasets offer an overview of urban mobility, facilitating a better understanding of traffic conditions and travelers’ behaviors in a city. Utilizing the city-scale traffic data, policymakers could develop appropriate transport policies and strategies to mitigate traffic congestion 1 , 2 . Additionally, the traffic data can also be used to evaluate the noise and air pollution caused by vehicles in urban areas 3 , 4 , 5 , which are important in enhancing public health and environmental conditions 6 , 7 , 8 . Furthermore, it assists in formulating energy-efficient traffic management and control strategies that can substantially reduce energy consumption 9 , 10 , 11 . In view of this, it is of great importance to produce and publish open-access traffic datasets on a city scale to support related studies in interdisciplinary research.

However, it is challenging to directly collect the traffic data on every road segment on the entire road network. This is because the traffic data are typically collected from various traffic sensors (e.g., loop detectors, CCTV cameras), which are usually insufficient to cover the entire network due to the associated high installation and maintenance costs. For instance, there are over 30,000 links on the road network of Hong Kong, but less than 10% of the links (i.e., 2,800) are equipped with volume detectors 12 . Moreover, data missing or data measurement errors are inevitable problems due to various factors such as sensor failures, software malfunctions, and weak communication signal transmission 13 , 14 . For example, existing studies indicate that approximately 30% of the freeway sensors in California Performance Measurement System (PeMS: https://pems.dot.ca.gov/ ) are not working properly, resulting in data missing 15 , 16 . More importantly, directly observing the traffic conditions may not be sufficient since the underlying mechanism of the traffic dynamics is not reflected. For example, a reduction in traffic speed indicates congestion, while it is still not clear how the congestion is formed 17 .

To address the above challenges, many urban planning or transport departments utilize traffic modeling techniques to estimate the city-scale traffic data in a generative manner. Specifically, the traffic assignment model 18 , which is a mature model that has been studied extensively in the transportation field, is adopted to estimate the city-scale traffic states. The input of the traffic assignment model only includes the Origin-Destination (OD) demand information and network structure, both of which are public and openly available. Then, the model outputs the city-scale traffic dataset. Traffic assignment models utilize OD data to predict traffic flow and route choices for individual travelers, relying on either predefined or data-driven behavioral models. By modeling the interactions between travelers’ behaviors and traffic congestion, the traffic assignment model searches for the equilibrium condition that mimics real-world traffic conditions. Traffic assignment models can often serve as the primary tool for local governments to assess the potential impact of changes in land use or road network expansions on both local and global traffic conditions. These models are indispensable because they inherently focus on optimizing travel decisions for local residents, aligning with their individual preferences. This capability enables the model to predict changes in agent-level behavior in situations that may not be fully reflected in the available data. Moreover, traffic assignment models demonstrate robust predictive capabilities for estimating future traffic conditions. For example, Metropolitan Planning Organizations (MPOs) in urban areas of the United States would utilize travel survey data, such as the National Household Travel Survey (NHTS: https://nhts.ornl.gov/ ), to produce traffic data for each local urban area that represent residents’ travel patterns 19 . However, these traffic assignment models and data are usually maintained by public agencies and generally not available to most researchers or the public due to difficulties in information sharing or privacy concerns 20 , 21 . Furthermore, the data used in traffic assignment models are under the ownership of various institutions and lack standardization in terms of their structures, granularity, and output formats. As a result, the data are restricted to a few researchers and it is challenging to access the necessary data for traffic assignment models across cities from official sources. Given the above, there is still a notable absence of city-scale traffic datasets that include multiple major cities within one geographic and cultural region, adhere to consistent standards, collect and validate information on a uniform scale, provide comprehensive data types, and meet high-quality standards for public availability.

Although there are a few publicly available datasets 22 , 23 concerning urban areas (see Table  1 ), the reliability and completeness of these datasets limit their applications across broader urban studies, especially in fields like energy, environment, and public health 24 , 25 . The limitations come from the following aspects: First, the existing traffic datasets typically cover some important traffic segments for a single city rather than a city-scale traffic dataset for multiple cities. Second, these current datasets often lack the necessary input, including road network data and corresponding OD data, directly usable for traffic assignment models. Third, these datasets often suffer from incomplete data types and lack of timely updating, resulting in limited convenience when utilizing them. In other words, these datasets are often collected by different researchers or volunteers several years ago, leading to a lack of uniformity in the data types and formats, as well as infrequent updates and maintenance. Fourth, these datasets frequently lack comprehensive validation across multiple variables or fail to offer adequate tools for predicting traffic features from behavioral data. For example, a dataset that includes OD numbers may result in unrealistic traffic flow predictions when attempting to utilize a traffic assignment model. In light of these mentioned facts, currently, there is no unified and well-validated traffic dataset available for multiple cities that covers the entire urban road network at a citywide scale, which hinders the feasibility of conducting comprehensive urban studies across cities to unearth novel discoveries.

To facilitate convenient access to citywide traffic assignment models and data for researchers from different domains besides transportation fields, this study provides a unified traffic dataset for traffic assignment models in 20 representative U.S. cities, with populations ranging from 0.3 million to over 8.8 million. Specifically, we first obtain the input of the model by fusing multiple open public data sources, including OpenStreetMap, The Longitudinal Employer-Household Dynamics Origin-Destination Employment Statistics (LODES), Waze, and TomTom. Then, we employ a grid-search method to fine-tune the parameters and generate the final traffic dataset for each city. The real world’s average travel time and traffic speed serve as validation criteria to ensure a reliable and effective traffic dataset for multiple cities. The validation results demonstrate that our approach can successfully produce the dataset with an average correlation coefficient of 0.79 for average travel time and an average error of 5.16% and 10.47% for average travel speed between real-world data and our data. Finally, we upload the validated traffic dataset and the code used in this study to a public repository.

To sum up, we utilize the static traffic assignment model, leveraging annually aggregated statistical data and open public data sources, to offer a city-scale traffic dataset for macroscopic urban research. It is worth noting that the approach provided in this study can also be applied to other cities. A comprehensive workflow of processing multi-source open public datasets to acquire this dataset is provided in Fig.  1 .

The workflow of obtaining unified and validated traffic datasets from multi-source open public datasets.

Creating a unified traffic dataset in multiple cities involves four main procedures: (1) the identification of representative cities; (2) the acquisition of corresponding input data from multi-source open public datasets; (3) the fusion of the obtained data; and (4) the implementation of traffic assignment, along with parameters calibration. The main procedures are illustrated accordingly below.

Identification of representative cities

In this study, we select a total of 20 representative cities in the United States and generate corresponding traffic datasets using the proposed approach. To ensure diversity and exemplarity among the selected cities, we primarily consider factors such as geographic location, urban scale, topography, and traffic conditions during the commute. Our selection includes a range of cities, including megacities like New York City, as well as several large cities such as Chicago and Philadelphia. We also included smaller but equally representative cities such as Honolulu. The topography of these cities also varies widely. For example, New York and San Francisco are separated by several rivers and rely on critical bridges and tunnels for commuting, while Las Vegas and Phoenix have relatively flat and continuous terrain, with surface transportation playing a predominant role.

Basic information of the 20 representative cities in the United States is given in Table  2 . The population and land area data in the year 2020 are sourced from the U.S. Census Bureau ( https://www.census.gov/ ) while the congestion ranking information in the year 2022 is from TomTom ( https://www.tomtom.com/traffic-index/ranking/ ). Their geospatial distribution is shown in Fig.  2 .

The geospatial distribution of 20 representative U.S. cities.

Data acquisition

The road network structure and travel demand are two crucial inputs for traffic assignment. In this study, we derive these data from public open-source datasets. This section provides a brief overview of the data acquisition procedures.

Road networks

First, the road network structures of the 20 cities are generated from the OpenStreetMap (OSM: https://www.openstreetmap.org/ ) database, which is an open-source mapping platform that provides crowd-sourced road network geographic information, including network topology, road attributes, and connectivity information. By leveraging OSM data, researchers gain convenient access to a comprehensive and up-to-date depiction of the network structure, which facilitates the research in urban studies 26 , 27 , 28 , 29 . The road attributes are also sourced from OSM. After the implementation of cleaning and integration procedures, these processed data can serve as the input for the traffic assignment. A summary of the road network data is given in Table  3 .

Specifically, we employ a Python package named osmnx 30 ( https://github.com/gboeing/osmnx ) to download the OSM data. We then use another Python package called osm2gmns 31 ( https://github.com/jiawlu/OSM2GMNS ) to extract the nodes and links on the road network from the OSM data and save them into separate CSV files in GMNS format 32 , 33 . We use five main link types including ‘motorway’, ‘trunk’, ‘primary’, ‘secondary’, and ‘tertiary’ to implement the traffic assignment. For each link type, we initiate the corresponding road attributes, including parameters such as road capacity, speed limits, the number of lanes, and so on. For the nodes, each node represents the intersection between two links and contains a unique identifier along with latitude and longitude information. By establishing the connectivity between nodes and links through their corresponding relationships, the network topology and road attributes can be constructed. We use the graphing functions of osmnx to visualize the constructed road networks of 20 representative U.S. cities in Fig.  3 .

Road networks of 20 representative U.S. cities extracted from OpenStreetMap.

Travel demand

We then estimate the travel demand, another essential input data for traffic assignment, using the data from the LODES dataset ( https://lehd.ces.census.gov/data/lodes/ ) provided by the U.S. Census Bureau. The LODES dataset includes commuting data for the workforce in all states across the United States over multiple years, which have been widely used in existing studies 34 . LODES data collection involves employers reporting employee details to state workforce agencies, including work and home locations. The U.S. Census Bureau collaborates with state agencies to process and anonymize this data. It’s then used to create Origin-Destination (OD) pairs. This dataset, at the finest granularity of block level, documents the block code for both workplace census and residence census, along with the corresponding total number of jobs. Essentially, the LODES dataset provides an excellent representation of the trip distributions of the U.S. working population that can be used to construct the OD matrix. In this study, we mainly focus on producing the traffic dataset for the year 2019 and the commuting OD data in that year are collected. Moreover, the data collection process is performed at the block level, resulting in the OD data between blocks.

Travel time and speed

We collect data from two open-source dataset platforms, namely TomTom ( https://www.tomtom.com/traffic-index/ranking/ ) and Waze ( https://www.waze.com/live-map/ ), as two indicators of travel time and average speed respectively for our dataset validation. The detailed procedures of data collection can be found in the subsequent sec:Technical ValidationTechnical Validation section.

Data fusion

In this section, we integrate the road network data and OD data to unify the data format. Since the origins and destinations in the OD matrix are not associated with network nodes, it is infeasible to directly take these data as input for the traffic assignment. Therefore, we need to establish a connection between network nodes and blocks. After establishing the connection, we can employ the traffic assignment model to identify appropriate travel paths and allocate traffic flow to the respective links.

To be specific, we begin by aggregating the OD data from its minimum granularity at the block level to a higher level, namely, the tract level. According to the United State Bureau 35 , 36 , 37 , blocks are statistical units with small areas, generally defined to contain between 600 and 3,000 people, whereas tracts composed of multiple blocks are relatively larger and typically have a population size ranging from 1,200 to 8,000 people. In order to achieve a balance between computational complexity and accuracy, we consider tracts as an ideal basic unit for the traffic assignment, which is similar to the existing studies 38 , 39 . This implies that we use the tract as a Traffic Analysis Zone (TAZ) in the traffic assignment model.

Then, the geographical location of each TAZ is determined as the average coordinates of all the blocks within a tract. These TAZs (also called centroids) are generated and stored in the existing node file labeled with a unique identifier. Finally, we generate connectors to bridge the TAZs and network nodes. These connectors can be regarded as a special type of links that are generated from each TAZ center to their neighbor links. Moreover, these connectors are incorporated into the existing links labeled with a unique identifier. As a result, the commuting trips could start from the origin TAZ, traverse a connector to access the nearby road network, choose a suitable path, and then use another connector to reach the destination TAZ.

Traffic assignment

In this section, we use the traffic assignment model to produce the dataset based on the User Equilibrium (UE) 40 . To be specific, we formulate the UE using an optimization model and calibrate four categories of parameters used in the model. Using the network structure and OD demand as input, the model would output the traffic flow, speed, and density on each link. Moreover, we mainly focus on the static traffic assignment and do not consider the influence of temporal variations on traffic conditions.

User equilibrium

All travelers naturally make decisions to minimize their own travel costs (either travel time or equivalent monetary value). Wardrop’s First Principle 41 posits that when every traveler seeks to minimize their individual travel costs, traffic flow eventually stabilizes. In this equilibrium state, the travel costs on all utilized paths become equal and minimized. Meanwhile, the travel costs on unused paths for any given OD pair are greater than or equal to those on the used paths. In other words, a steady-state traffic condition is reached only when no traveler can improve his or her travel time by unilaterally changing routes. The satisfaction of Wardrop’s first principle is commonly referred to as User Equilibrium (UE).

The physical transport network including road segments and intersections in an urban area can be represented as a graph structure G ( N , A ) containing a link set A and a node set N . For each link α ∈ A , it has the link flow x a and the link travel cost t a respectively. For each node r , s ∈ N , it is defined as the TAZ that generates or attracts traffic demand. Therefore, the mathematical formulation of the traffic assignment model under the UE condition 42 can be expressed as follows:

where t a ( x a ) denotes the link performance function that indicates the travel cost on link a when the traffic flow is x a . \({f}_{k}^{rs}\) represents the traffic flow on path k connecting origin r and destination s . q rs indicates the number of trips from origin r to destination s . \({\delta }_{ka}^{rs}\) is a binary variable indicates whether link a is part of path k between origin r and destination s . Equation ( 2 ) imposes the flow conservation constraints. Equation ( 3 ) expresses the relationship between link flow and path flow. Please refer to the book Urban Transportation Networks 40 for details.

Once the traffic flow on each link is determined, the total travel time, denoted as \({c}_{k}^{rs}\) , for a specific path k can be calculated by summing the travel time of each link along this path, which can be formulated as follows:

Although the above optimization model has been proven to be a strict convex problem with a unique solution for traffic flow on links 40 , the computational cost of finding the optimal solution would significantly increase when dealing with large-scale city road networks. To alleviate the computational burden, a bi-conjugate Frank-Wolfe algorithm 43 , 44 is employed to find the optimal solution. In order to enable convenient usage of the provided dataset by users from various disciplines and allow them to easily modify the core parameter settings of the traffic assignment process according to their research needs, we employ two traffic modeling platforms to generate the final dataset. Subsequent users can either directly view the dataset in a no-code format or quickly adjust parameters through a low-code approach to conduct scenario testing under different scenarios. Specifically, a commercial software (named TransCAD ) and an open-source Python package for transportation modeling (named AequilibraE ) are utilized simultaneously in this study. For both platforms, the maximum assignment iteration time and the convergence criteria are set to 500 and 0.001, respectively. The results of the traffic assignment model in 20 U.S. cities are shown in Fig.  4 .

Results of the traffic assignment model in 20 representative U.S. cities.

Parameters calibration

The traffic conditions on the network are influenced by many factors related to traffic supply and demand. Consequently, the traffic assignment model would be impacted and output different results. Since the disturbances in the transport system are nonlinear and challenging to quantify, it is difficult to establish a deterministic mapping relationship between various influencing factors and the results of the traffic assignment model. Therefore, we adopt a grid-search approach to calibrate four common categories of factors that are closely related to the traffic assignment model. We determine the final model by continuously fine-tuning various parameters associated with the traffic assignment model until the transport system reaches the UE condition. In this study, we introduce four categories of factors including road attributes, travel demand, impedance function, and turn penalty, as outlined below.

Road attributes

We categorize the entire road network into three major types, namely expressways, arterial highways, and local roads. Capacity and free flow speed of each road type are two parameters identified to be calibrated. Based on the experimental results, the appropriate range of road capacity for expressways is between 1800 veh/h/lane and 2200 veh/h/lane, while the range for free flow speed is from 65 km/h to 90 km/h. In the case of highways, the corresponding capacity value falls within the range of 1500 veh/h/lane to 2000 veh/h/lane, and the free flow speed value ranges from 40 km/h to 65 km/h. As for local roads, their capacity varies from 600 veh/h/lane to 1500 veh/h/lane, while the suitable speed ranges between 25 km/h and 45 km/h. The detailed information for each type of road can be found in Table  4 .

The OD travel demand is another significant factor influencing the outcome of the traffic assignment. In this study, we aim to simulate the traffic conditions during the peak hours. As mentioned above, the OD demand matrix is derived from the total number of jobs in the United States in 2019, generated from LODES datasets. Although it is reasonable to assume that commuting travel accounts for the majority during peak hours, such demand cannot reflect the actual traffic conditions. Therefore, it is necessary to adjust the initial OD demand, considering variations in transport modes, travel departure time, and carpooling availability during commuting to work. To address this issue, we introduce an OD multiplier to estimate the actual traffic demand during the commuting time. We find that stable results can be obtained when the parameter ranges from 0.55 to 0.65. We show the travel demand and the percentage of internal travel within each TAZ in Fig.  5 .

Total travel demand and the percentage of internal travel demand for 20 U.S. cities.

Link performance function

The link performance function, also known as the impedance function or volume delay function, refers to the relationship between travel time and traffic flow on a road. Typically, travel time increases non-linearly with the increase in traffic flow, which also significantly affects the traffic assignment. One of the most commonly adopted functions in the literature is called the Bureau of Public Roads (BPR) function 45 , which is expressed as follows:

In the function above, t indicates the actual travel time on the road while t 0 represents the free flow travel time on the corresponding road. v and c are the traffic flow and capacity of the road, respectively. α and β are parameters needed to be fine-tuned. We find that the results are satisfactory when parameter α ranges from 0.15 to 0.6 while parameter β changes from 1.2 to 3. The specific values of parameters for each city are provided in Table  5 .

Turn penalty

The turning delay at intersections is also a significant factor that should not be dismissed. When vehicles pass through road intersections, their speed typically decreases, either due to signal control or the necessity to make turns. However, this behaviour cannot be adequately represented in solving traffic assignment problems. To ensure that the results of the traffic assignment model are in accordance with real-world scenarios, we uniformly set corresponding parameters for all junctions to simulate the turning delay effects. In other words, the turn penalty parameters are an average value for the turning delay at all intersections in the road network and these intersection types include signal-controlled intersections, roundabouts, yield or stop intersections, and others. Specifically, the time delay for right turns varies between 0 and 0.25 minutes, while the penalty for making a left turn ranges from 0 to 0.35 minutes. The delay for through traffic is between 0 and 0.15 minutes. U-turn is prohibited in the traffic assignment simulation. The specific parameter setting is demonstrated in Table  5 .

Data Records

We share the traffic dataset on a public repository (Figshare 46 ). In this dataset, each folder, named after the city, contains the input and output of the traffic assignment model specific to that city. We elaborate on the details as follows:

This folder contains all the input data required for the traffic assignment model, namely the OD demand data and network data. The network data contains both node and link files in a CSV format. The data in this file folder specifically includes the following contents:

the initial network data obtained from OSM

the visualization of the OSM data

processed node/link/od data

The detailed meanings of the fields contained in different input data are given in Table  6 .

TransCAD results

This folder contains all the input data required for the traffic assignment model in TransCAD, as well as the corresponding output data. The data in this file folder specifically includes the following contents:

cityname.dbd: geographical network database of the city supported by TransCAD

cityname_link.shp/cityname_node.shp: network data supported by the GIS software, which can be imported into TransCAD manually

od.mtx: OD matrix supported by TransCAD

LinkFlows.bin/LinkFlows.csv: results of the traffic assignment model by TransCAD

ShortestPath.mtx/ue_travel_time.csv: the travel time (in minutes) between OD pairs by TransCAD

The detailed meanings of the fields contained in output data generated from TransCAD are given in Table  7 .

AequilibraE results

This folder contains all the input data required for the traffic assignment model in AequilibraE, as well as the corresponding output data. The data in this file folder specifically includes the following contents:

cityname.shp: shapefile network data of the city support by QGIS or other GIS software

od_demand.aem: OD matrix supported by AequilibraE

network.csv: the network file used for traffic assignment in AequilibraE

assignment_result.csv: results of the traffic assignment model by AequilibraE

The detailed meanings of the fields contained in output data generated from AequilibraE are given in Table  8 .

Technical Validation

To ensure the consistency between the traffic assignment model’s output and real-world traffic conditions, we conduct validation using two different public open sources of traffic data. Specifically, the travel time between different OD pairs and the overall average travel speed are employed as two validation indicators to ensure the reliability and accuracy of the provided dataset. The validation results are shown in Tables  9 , 10 and we can see that the provided dataset for each city is accurate and valid.

Travel time

In examining the travel time metric, we obtain the travel time between different OD pairs both from traffic assignment models and map service providers. As for the model side, the travel time under both UE and free flow conditions are calculated respectively using traffic assignment models. First, under UE conditions, the travel time between different OD pairs could be generated by summing the link travel time determined by the corresponding assigned traffic flow along the shortest path as shown in Eq. ( 5 ). Then, under free flow conditions, the travel time between OD pairs is the travel time associated with the shortest path, disregarding congestion on road segments. Furthermore, the average value of Travel Time (in minutes) under UE conditions (UETT) as well as free flow conditions (FFTT) for all OD pairs can be expressed as follows:

where \({c}_{ue}^{rs}\) and \({c}_{ff}^{rs}\) denote the travel time between origin r and destination s under the UE and free flow conditions respectively. Additionally, the difference as well as the ratio between these two types of travel time give the average travel delay (in minutes) and delay factor for each city.

In terms of the real-world data for validation, since nowadays many map service providers have the capability to offer travel time estimates between two location points at different departure times based on users’ historical navigation records, in this study, we choose Waze as the data source to obtain the actual travel time between each OD pair by using its WazeRouteCalculator API ( https://github.com/kovacsbalu/WazeRouteCalculator ) with Python code.

The results of travel time are shown in Table  9 . It can be seen that Honolulu experiences the least travel time under free flow conditions, at about 8.70 minutes, while Minneapolis has the shortest average travel time during commuting hours, at about 10.25 minutes. Minneapolis also has the lowest delay travel time among all cities, merely 0.47 minutes, indicating that the commuting travel time in this city is almost the same as the travel time under free flow conditions. In contrast, New York City experiences significant delays, with a delay time of 24.47 minutes, revealing that the travel time during peak periods in New York is more than double that of the free flow condition. In terms of the delay factor, New York City has the highest value, reaching 2.24, followed by Chicago with a value of 1.65. Minneapolis and Pittsburgh have the lowest delay factor values, both at 1.05.

To evaluate the results, we use the Pearson Correlation Coefficient (PCC) 47 to measure the correlation between the actual travel time and the travel time produced by our model. The PCC r xy is defined as follows:

where r xy denotes the Pearson’s Correlation Coefficient. x i and y i are the individual sample points indexed with i . n represents the sample size.

Since the turning penalties are not incorporated in the traffic assignment algorithm of AequilibraE, the parameter settings in TransCAD and AequilibraE are not identical. Consequently, results of the two platforms are not entirely consistent. Considering the more comprehensive parameter settings in TransCAD, we adopt the results of TransCAD as the primary benchmark. We perform PCC analysis between Waze and TransCAD, as well as between TransCAD and AequilibraE, with the evaluation results presented in Table  9 .

From the correlation analysis, we can find that all correlation coefficients R 2 are greater than 0.7, which confirms the accuracy and reliability of the results to some extent. We also visualize the correlation coefficient for each city in Fig.  6 . It can be seen that the simulated travel time is consistent with the travel time in the real world.

Correlation analysis results between Waze and TransCAD.

Average speed

The overall average speed of the entire road network is another important indicator for validation. In this study, we use the speed data collected from TomTom Traffic Index as the actual speed to validate our model. We first calculate the average link-based speed of our model through dividing Vehicle Hours Travelled (VHT) by Vehicle Kilometers Travelled (VKMT). Then, the average OD-based speed values are derived from the ratio of distance to travel time between each OD pair. The Mean Absolute Percent Errors (MAPE) and Mean Absolute Errors (MAE) for both the link-based speed and the OD-based speed are used to measure the reliability of our model:

where y i is the actual observed value, \({\widehat{y}}_{i}\) is the predicted value, and n is the number of samples.

The results are summarized in Table  10 . We find that the average MAPE and MAE values for the link-based speed metric are 5.16% and 1.77 km/h, respectively. Moreover, the average MAPE and MAE values for the OD-based speed indicator are 10.47% and 3.82 km/h, respectively. This implies that our approach can produce satisfactory and reliable results.

Network traffic impact on model performance

To validate the effectiveness and robustness of our model across cities, we further investigate how traffic conditions of a city affect the model performance. The MAE and MAPE values for link-based average speed metrics obtained in Table  10 are used to evaluate the model performance. The traffic conditions are characterized by two different indicators. One is the ratio of the total OD travel demand to the number of links for the entire road network, which can characterize the average OD demand and represent the traffic conditions of a city. The other is the average speed (km/h) in rush hour obtained from TomTom (refer to Table  10 ). If the values of average traffic demand are large, it reveals a congested city network experiencing substantial traffic demand, exemplified by cities like New York and San Francisco. Conversely, a small value suggests a city road network with low traffic demand, as observed in cities like Atlanta and Dallas. We can draw similar conclusions with respect to the average traffic speed.

The results are shown in Fig.  7 . The red dashed line represents the linear regression trendline that has been fitted to the data points. The R 2 values of Fig.  7a and Fig.  7b are 0.0049 and 0.0218, respectively. This implies that there is no evident relationship between the model performance and the varying traffic demand of the network. Similarly, the R 2 values of Fig.  7c and Fig.  7d are 0.0212 and 0.0177, respectively. This suggests that the model performance is not affected by the varying traffic speeds in different cities. In summary, the proposed model exhibits low sensitivity to variations in city traffic conditions and achieves satisfactory performance across cities.

The model performance in relation to different traffic conditions for 20 U.S. cities. ( a ) The MAPE values (%) regarding the average OD demand for different cities. ( b ) The MAE values (km/h) regarding to the average OD demand for different cities. ( c ) The MAPE values (%) regarding the average speed for different cities. ( d ) The MAE values (km/h) regarding the average speed for different cities.

Usage Notes

The acquisition of OD data is crucial in performing the traffic assignment and producing the citywide traffic dataset. In this study, we utilize the commuting OD data (LODES) provided by the U.S. Census Bureau to generate the OD matrix. For cities in other countries, OD data can be substituted with alternative open data sources, such as OD data provided by TomTom ( https://developer.tomtom.com/od-analysis/documentation/product-information/introduction ).

Moreover, we use the average traffic time and average travel speed between different OD pairs in the real world to validate the results of our approach, ensuring its reliability and accuracy. If additional data sources are available, such as traffic flow data obtained from traffic detectors, we can also use the corresponding data to further evaluate the effectiveness of the provided dataset.

It is worth noting that the provided dataset is mainly used for macroscopic urban research and policy development across interdisciplinary studies. In view of this, the given dataset provides full spatial coverage of the entire road network, unlike existing traffic datasets that focus on specific areas. Hence, the provided traffic dataset and existing traffic datasets complement each other, which can better facilitate research in urban studies. Specifically, the full spatial coverage of the provided dataset makes it valuable for comprehensive macroscopic urban research and policy development, making a notable contribution to the literature, such as public transport planning, road expansions, the determination of bus routes, the estimation of the transport-related environmental impact and so on. In contrast, existing traffic datasets (e.g., PeMS) may exhibit incomplete spatial coverage, making them less suitable for the aforementioned macroscopic urban studies. Actually, the datasets containing fine-grained temporal information are more suitable for investigating regional traffic dynamics by leveraging the spatiotemporal relationship between the traffic data, such as traffic prediction, spatiotemporal propagation of shockwaves, calibration of fundamental diagrams, traffic data imputation, and so on.

In this study, the provided dataset lacks fine-grained temporal information due to the limited availability of input data. To fully understand dynamic traffic patterns, it is essential to consider both spatial and temporal dimensions within the traffic data. Consequently, developing a dynamic traffic assignment model that effectively captures the spatiotemporal interdependencies of traffic data is important. Moreover, employing daily traffic data for more fine-grained validation would enhance further urban research.

Code availability

The guidelines for data retrieval and utilization have been uploaded to GitHub 48 . The specific contents comprise:

1. Input data introduction.ipynb : A brief introduction and data demonstration about the input data for the traffic assignment process in the dataset.

2. A guide for TransCAD users.md : It is a guide for users who want to view and modify the dataset in the Graphical User Interface (GUI) of TransCAD.

3. AequilibraE_assignmnet.py : A Python code file for users who want to get access to the traffic assignment results by using the AqeuilibraE.

Huang, Y., Weng, Y., Wu, W. & Chen, B. Control strategies for solving the problem of traffic congestion. IET Intelligent Transport Systems 10 , 642–648 (2016).

Article   Google Scholar  

Tajdari, F. & Roncoli, C. Adaptive traffic control at motorway bottlenecks with time-varying fundamental diagram. IFAC-PapersOnLine 54 , 271–277 (2021).

Guo, B. et al . Uncovering China’s transport CO 2 emission patterns at the regional level. Energy Policy 74 , 134–146 (2014).

Article   CAS   Google Scholar  

Donchenko, V. et al . Estimated atmospheric emission from motor transport in Moscow based on transport model of the city. Transportation Research Procedia 14 , 2649–2658 (2016).

Aminzadegan, S., Shahriari, M., Mehranfar, F. & Abramović, B. Factors affecting the emission of pollutants in different types of transportation: A literature review. Energy Reports 8 , 2508–2529 (2022).

Wang, X., Rodrguez, D. A., Sarmiento, O. L. & Guaje, O. Commute patterns and depression: Evidence from eleven Latin American cities. Journal of Transport & Health 14 , 100607 (2019).

Dam, P. et al . COVID-19: Impact on transport and mental health. Journal of Transport & Health 19 , 100969 (2020).

Conceição, M. A. et al . The effect of transport infrastructure, congestion and reliability on mental wellbeing: A systematic review of empirical studies. Transport Reviews 43 , 264–302 (2023).

Achour, H. & Belloumi, M. Investigating the causal relationship between transport infrastructure, transport energy consumption and economic growth in Tunisia. Renewable and Sustainable Energy Reviews 56 , 988–998 (2016).

Wang, Y., Li, K., Xu, X. & Zhang, Y. Transport energy consumption and saving in China. Renewable and Sustainable Energy Reviews 29 , 641–655 (2014).

Adams, S., Boateng, E. & Acheampong, A. O. Transport energy consumption and environmental quality: Does urbanization matter? Science of the Total Environment 744 , 140617 (2020).

Article   ADS   CAS   PubMed   Google Scholar  

Transport Department, The Government of the Hong Kong Special Administrative Region. Intelligent Road Network Package (IRNP). https://www.td.gov.hk/en/public_services/intelligent_road_network_package/index.html (2023).

Chen, X., He, Z. & Sun, L. A Bayesian tensor decomposition approach for spatiotemporal traffic data imputation. Transportation Research Part C: Emerging Technologies 98 , 73–84 (2019).

Liang, Y., Zhao, Z. & Sun, L. Memory-augmented dynamic graph convolution networks for traffic data imputation with diverse missing patterns. Transportation Research Part C: Emerging Technologies 143 , 103826 (2022).

Rajagopal, R. & Varaiya, P. P. Health of California’s loop detector system. Tech. Rep. (2007).

Yang, Y., Yang, H. & Fan, Y. Networked sensor data error estimation. Transportation Research Part B: Methodological 122 , 20–39 (2019).

Johari, M., Keyvan-Ekbatani, M., Leclercq, L., Ngoduy, D. & Mahmassani, H. S. Macroscopic network-level traffic models: Bridging fifty years of development toward the next era. Transportation Research Part C: Emerging Technologies 131 , 103334 (2021).

Patriksson, M. The Traffic Assignment Problem: Models and Methods (Courier Dover Publications, 2015).

Horowitz, A. Statewide Travel Forecasting Models, NCHRP Synthesis of Highway Practices N 358. Transportation Research Board, Washington DC (2006).

Xie, H., Kulik, L. & Tanin, E. Privacy-aware traffic monitoring. IEEE Transactions on Intelligent Transportation Systems 11 , 61–70 (2009).

Google Scholar  

Xiao, W., Zhang, H., Wen, Q. & Li, W. Passive RFID-supported source location privacy preservation against global eavesdroppers in WSN. In 2013 5th IEEE International Conference on Broadband Network & Multimedia Technology , 289–293 (IEEE, 2013).

Nourmohammadi, F., Mansourianfar, M., Shafiei, S., Gu, Z. & Saberi, M. An open GMNS dataset of a dynamic multi-modal transportation network model of Melbourne, Australia. Data 6 , 21 (2021).

Yap, W. & Biljecki, F. A global feature-rich network dataset of cities and dashboard for comprehensive urban analyses. Scientific Data 10 , 667 (2023).

Article   PubMed   PubMed Central   Google Scholar  

Rey, D., Bar-Gera, H., Dixit, V. V. & Waller, S. T. A branch-and-price algorithm for the bilevel network maintenance scheduling problem. Transportation Science 53 , 1455–1478 (2019).

Loder, A., Ambühl, L., Menendez, M. & Axhausen, K. W. Understanding traffic capacity of urban networks. Scientific Reports 9 , 16283 (2019).

Article   ADS   PubMed   PubMed Central   Google Scholar  

Fonte, C. C. et al . Using openstreetmap to create land use and land cover maps: Development of an application. In Geospatial Intelligence: Concepts, Methodologies, Tools, and Applications , 1100–1123 (IGI Global, 2019).

Vargas-Munoz, J. E., Srivastava, S., Tuia, D. & Falcao, A. X. OpenStreetMap: Challenges and opportunities in machine learning and remote sensing. IEEE Geoscience and Remote Sensing Magazine 9 , 184–199 (2020).

Grinberger, A. Y., Schott, M., Raifer, M. & Zipf, A. An analysis of the spatial and temporal distribution of large-scale data production events in OpenStreetMap. Transactions in GIS 25 , 622–641 (2021).

Atwal, K. S., Anderson, T., Pfoser, D. & Züfle, A. Predicting building types using OpenStreetMap. Scientific Reports 12 , 19976 (2022).

Article   ADS   CAS   PubMed   PubMed Central   Google Scholar  

Boeing, G. OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks. Computers, Environment and Urban Systems 65 , 126–139 (2017).

Lu, J. & Zhou, X. S. Virtual track networks: A hierarchical modeling framework and open-source tools for simplified and efficient connected and automated mobility (CAM) system design based on general modeling network specification (GMNS). Transportation Research Part C: Emerging Technologies 153 , 104223 (2023).

Li, P. & Zhou, X. Path4GMNS. https://github.com/jdlph/Path4GMNS (2023).

Zhou, X. & Taylor, J. DTALite: A queue-based mesoscopic traffic simulator for fast model evaluation and calibration. Cogent Engineering 1 , 961345 (2014).

McKinney, K. L., Green, A. S., Vilhuber, L. & Abowd, J. M. Total error and variability measures for the quarterly workforce indicators and LEHD origin-destination employment statistics in OnTheMap. Journal of Survey Statistics and Methodology 9 , 1146–1182 (2021).

Morrill, R., Cromartie, J. & Hart, G. Metropolitan, urban, and rural commuting areas: Toward a better depiction of the United States settlement system. Urban Geography 20 , 727–748 (1999).

Logan, J. R., Xu, Z. & Stults, B. J. Interpolating US decennial census tract data from as early as 1970 to 2010: A longitudinal tract database. The Professional Geographer 66 , 412–420 (2014).

Smith, R. M. & Blizard, Z. D. A census tract level analysis of urban sprawl’s effects on economic mobility in the United States. Cities 115 , 103232 (2021).

Abdel-Aty, M., Lee, J., Siddiqui, C. & Choi, K. Geographical unit based analysis in the context of transportation safety planning. Transportation Research Part A: Policy and Practice 49 , 62–75 (2013).

Gunier, R. B., Hertz, A., Von Behren, J. & Reynolds, P. Traffic density in California: socioeconomic and ethnic differences among potentially exposed children. Journal of Exposure Science & Environmental Epidemiology 13 , 240–246 (2003).

Sheffi, Y. Urban transportation networks , vol. 6 (Prentice-Hall, Englewood Cliffs, NJ, 1985).

Wardrop, J. G. Road paper. some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers 1 , 325–362 (1952).

Boyce, D. Beckmann’s transportation network equilibrium model: Its history and relationship to the Kuhn–Tucker conditions. Economics of Transportation 2 , 47–52 (2013).

Mitradjieva, M. & Lindberg, P. O. The stiff is moving–Conjugate direction Frank-Wolfe methods with applications to traffic assignment. Transportation Science 47 , 280–293 (2013).

Zill, J. C., Camargo, P., Daisy, N. S. & Veitch, T. Toll choice and stochastic user equilibrium: ticking all the boxes. Transportation Research Record 2673 , 930–940 (2019).

Manual, T. A. Bureau of Public Roads, US Dept. Commerce, Urban Planning Division, Washington, DC, USA (1964).

Xu, X., Zheng, Z., Hu, Z., Feng, K. & Ma, W. A unified and validated traffic dataset for 20 U.S. cities. Figshare https://doi.org/10.6084/m9.figshare.24235696 (2023).

Edwards, A. L. An introduction to linear regression and correlation. The Correlation Coefficient 33 , 46 (1976).

Xu, X., Zheng, Z., Hu, Z., Feng, K. & Ma, W. A unified and validated traffic dataset for 20 U.S. cities. https://github.com/xuxiaotong/A_unified_and_validated_traffic_dataset_for_20_U.S._cities (2023).

Transportation Networks for Research Core Team. Transportation Networks for Research. https://github.com/bstabler/TransportationNetworks (2023).

The Institute for Transport Planning and Systems ETH Zurich. UTD19. https://utd19.ethz.ch/index.html (2023).

California Department of Transportation (Caltrans). Caltrans Performance Measurement System (PeMS). https://pems.dot.ca.gov/ (2023).

Department for Transport (UK). Road Traffic Statistics. https://roadtraffic.dft.gov.uk/downloads/ (2023).

California Department of Transportation (Caltrans). Traffic Volumes (Annual Average Daily Traffic (AADT)). https://gisdata-caltrans.opendata.arcgis.com/datasets/d8833219913c44358f2a9a71bda57f76_0/about (2023).

New York City Department of Transportation (NYC DOT). Traffic Volume Counts. https://data.cityofnewyork.us/Transportation/Traffic-Volume-Counts/btm5-ppia/about_data (2023).

Transport Department (HK). Traffic Data of Strategic/Major Roads. https://data.gov.hk/en-data/dataset/hk-td-sm_4-traffic-data-strategic-major-roads (2023).

Yan, H. City-scale vehicle trajectory data from traffic camera videos. Figshare https://doi.org/10.6084/m9.figshare.c.6676199.v1 (2023).

Yu, F. et al . City-scale vehicle trajectory data from traffic camera videos. Scientific Data 10 , 711 (2023).

Wang, Y. et al . City-scale holographic traffic flow data based on vehicular trajectory resampling. Figshare https://doi.org/10.6084/m9.figshare.c.5796776.v1 (2022).

Wang, Y. et al . City-scale holographic traffic flow data based on vehicular trajectory resampling. Scientific Data 10 , 57 (2023).

Download references

Acknowledgements

The work described in this paper was supported by the National Natural Science Foundation of China (No. 52102385), grants from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. PolyU/25209221 & PolyU/15206322), and a grant from Dean’s Reserve at the Hong Kong Polytechnic University (Project No. P0034271). The authors would like to thank Prof. Xuesong Zhou for providing constructive suggestions and active discussions regarding the data.

Author information

Authors and affiliations.

Department of Civil and Environmental Engineering, The Hong Kong Polytechnic University, Hong Kong, 999077, China

Xiaotong Xu, Zhenjie Zheng, Zijian Hu & Wei Ma

The Department of Civil and Environmental Engineering, Princeton University, Princeton, 08544, USA

Kairui Feng

The Hong Kong Polytechnic University Shenzhen Research Institute, Shenzhen, Guangdong, 518000, China

You can also search for this author in PubMed   Google Scholar

Contributions

X.X. conceived the study, curated data, developed methodology, conducted experiment and wrote the original draft. Z.Z. conceived the study, developed methodology, coded for the data acquisition, reviewed and edited writing. Z.H. coded for the data acquisition. K.F. conceived the study, contributed to the original data, reviewed and edited writing. W.M. conceived the study, acquired funding, developed methodology and supervised the study. All authors reviewed and agreed on the final manuscript.

Corresponding authors

Correspondence to Zhenjie Zheng or Wei Ma .

Ethics declarations

Competing interests.

The authors declare no competing interests.

Additional information

Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/ .

Reprints and permissions

About this article

Cite this article.

Xu, X., Zheng, Z., Hu, Z. et al. A unified dataset for the city-scale traffic assignment model in 20 U.S. cities. Sci Data 11 , 325 (2024). https://doi.org/10.1038/s41597-024-03149-8

Download citation

Received : 27 November 2023

Accepted : 18 March 2024

Published : 29 March 2024

DOI : https://doi.org/10.1038/s41597-024-03149-8

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Quick links

• Explore articles by subject
• Guide to authors
• Editorial policies

Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

A path-based greedy algorithm for multi-objective transit routes design with elastic demand

• Original Paper
• Published: 19 August 2016
• Volume 8 , pages 261–293, ( 2016 )

Cite this article

• Amirali Zarrinmehr 1 ,
• Mahmoud Saffarzadeh 1 ,
• Seyedehsan Seyedabrishami 1 &
• Yu Marco Nie 2  

523 Accesses

5 Citations

Explore all metrics

This paper is concerned with the problem of finding optimal sub-routes from a set of predefined candidate transit routes with the objectives of maximizing transit ridership as well as minimizing operational costs. The main contributions of this paper are: (1) considering transit ridership maximization in a multi-objective bi-level optimization framework; (2) proposing a greedy algorithm for the multi-objective design problem; (3) applying an efficient path-based algorithm to solve the lower level multi-modal traffic assignment problem. Numerical experiments indicate that the proposed algorithm is not only able to approximate the Pareto-optimal solutions with satisfactory accuracy, but also achieves a fast performance even for problems of real-world scale.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price includes VAT (Russian Federation)

Instant access to the full article PDF.

Rent this article via DeepDyve

Institutional subscriptions

Similar content being viewed by others

A survey on the transit network design and frequency setting problem

Javier Durán-Micco & Pieter Vansteenwegen

Computing Pareto-Optimal Transit Routes Through Mathematical Algorithms

Trip-Based Public Transit Routing

In a more general setting, several sub-routes may be selected from a candidate route. However, this extension is left for a future study.

Aashtiani HZ (1979) The multi-modal traffic assignment problem. Dissertation, Massachusetts Institute of Technology

Aashtiani HZ, Magnanti TL (1981) Equilibria on a congested transportation network. SIAM J Algebra Discr 2(3):213–226

Article   Google Scholar  

Azizian H (2012) Multi-modal traffic assignment with mode choice models. Dissertation, Sharif University of Technology

Babazadeh A (2005) Equilibrium transit assignment problem in congested networks: formulation and solution algorithm. Dissertation, Sharif University of Technology

Babazadeh A, Aashtiani HZ (2005) Algorithm for equilibrium transit assignment problem. Transp Res Rec 1923:227–235

Bar-Gera H (2016) Transportation network test problems. http://www.bgu.ac.il/~bargera/tntp . Accessed 20 Feb 2016

Ben-Ayed O, Boyce DE, Blair CE III (1988) A general bilevel linear programming formulation of the network design problem. Transp Res Part B 22(4):311–318

Brands T (2015) Multi-objective optimisation of multimodal passenger transportation networks. Dissertation, University of Twente

Ceder A, Wilson NHM (1986) Bus network design. Transp Res Part B 20(4):331–344

Chiu YC, Bottom J, Mahut M, Paz A, Balakrishna R, Waller T, Hicks J (2011) Dynamic traffic assignment. A Premier. Transp Res Circular E-C153, Washington DC

Cipriani E, Gori S, Petrelli M (2012) A bus network design procedure with elastic demand for large urban areas. Public Transp 4(1):57–76

Desaulniers G, Hickman MD (2007) Public transit. In: Barnhart C, Laporte G (eds) Handbook in operations research and management science, transportation, vol 14. Elsevier, Amsterdam, pp 69–127

Google Scholar  

Fan W, Machemehl RB (2006) Optimal transit route network design problem with variable transit demand: genetic algorithm approach. J Transp Eng 132(1):40–51

Fan W, Machemehl RB (2008) Tabu search strategies for the public transportation network optimizations with variable transit demand. Comput Aided Civ Inf 23(7):502–520

Farahani RZ, Miandoabchi E, Szeto WY, Rashidi H (2013) A review of urban transportation network design problems. Eur J Oper Res 229(2):281–302

Fruin JJ (1971) Designing for pedestrians: a level-of-service concept. Highw Res Rec 355:1–15

Furth PG, Wilson NH (1981) Setting frequencies on bus routes: theory and practice. Transp Res Rec 818(1981):1–7

Guihaire V, Hao JK (2008) Transit network design and scheduling: a global review. Transp Res Part A 42(10):1251–1273

Hasselström D (1981) Public transportation planning—mathematical programming approach. Dissertation, University of Gothenburg

Israeli Y, Ceder A (1995) Transit route design using scheduling and multi-objective programming techniques. In: Daduna J, Branco I, Paixao JP (eds) Computer-aided transit scheduling: proceedings of the sixth international work-shop on computer-aided scheduling of public transport. Lecture notes in economics and mathematical systems. Springer, Berlin, pp 56–57

Izadpanah P, Aashtiani HZ (2011) Application of paths information in network design problem. J Transp Eng 138(7):863–870

Kepaptsoglou K, Karlaftis M (2009) Transit route network design problem: review. J Transp Eng 135(8):491–505

Laporte G, Marín A, Mesa JA, Ortega FA (2007) An integrated methodology for rapid transit network design. In: Algorithmic methods for railway optimization. Lecture notes on computer science, vol 4359. Springer, Berlin, pp 187–199

Lee YJ, Vuchic VR (2005) Transit network design with variable demand. J Transp Eng 131(1):1–10

Lee DH, Nie Y, Chen A (2003) A conjugate gradient projection algorithm for the traffic assignment problem. Math Comput Model 37(7):863–878

Lo HK, Yip CW, Wan KH (2003) Modeling transfer and non-linear fare structure in multi-modal network. Transp Res Part B 37(2):149–170

Mauttone A, Urquhart ME (2009a) A multi-objective metaheuristic approach for the transit network design problem. Public Transp 1(4):253–273

Mauttone A, Urquhart ME (2009b) A route set construction algorithm for the transit network design problem. Comput Oper Res 36(8):2440–2449

Miandoabchi E, Zanjirani Farahani R, Dullaert W, Szeto WY (2012) Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks. Netw Spat Econ 12(3):441–480

Mumford CL (2013) New heuristic and evolutionary operators for the multi-objective urban transit routing problem. IEEE C Evol Comput, 939–946

Murty KG (1988) Linear complementarity, linear and nonlinear programming. Heldermann, Berlin

Nie YM (2010) A class of bush-based algorithms for the traffic assignment problem. Transp Res Part B 44(1):73–89

Nie Y (2012) A note on Bar-Gera’s algorithm for the origin-based traffic assignment problem. Transp Sci 46(1):27–38

Ortuzar J, Willumsen LG (2001) Modelling transport, 3rd edn. Wiley, New York

Poorzahedy H, Safari F (2011) An ant system application to the Bus Network Design Problem: an algorithm and a case study. Public Transp 3(2):165–187

Spiess H, Florian M (1989) Optimal strategies: a new assignment model for transit networks. Transp Res Part B 23(2):83–102

Szeto WY, Jiang Y (2014) Transit assignment: approach-based formulation, extragradient method, and paradox. Transp Res Part B 62:51–76

Szeto WY, Wu Y (2011) A simultaneous bus route design and frequency setting problem for Tin Shui Wai, Hong Kong. Eur J Oper Res 209(2):141–155

Verbas İÖ, Frei C, Mahmassani HS, Chan R (2015) Stretching resources: sensitivity of optimal bus frequency allocation to stop-level demand elasticities. Public Transp 7(1):1–20

Wan QK, Lo HK (2009) Congested multimodal transit network design. Public Transp 1(3):233–251

Yang Z, Yu B, Cheng C (2007) A parallel ant colony algorithm for bus network optimization. Comput Aided Civ Inf 22(1):44–55

Yildirim KS, Kalayci TE, Ugur A (2008) Optimizing coverage in a K-covered and connected sensor network using genetic algorithms. In: Proc of the 9th WSEAS Int Conf on Evol Computat, pp 21–26

Yu B, Yang ZZ, Jin PH, Wu SH, Yao BZ (2012) Transit route network design-maximizing direct and transfer demand density. Transp Res Part C 22:58–75

Download references

Acknowledgments

The authors would like to thank the editor and two anonymous reviewers for their constructive comments which helped improve this paper. The research is partially funded by the United States National Science Foundation under the award number CMMI-1402911.

Author information

Authors and affiliations.

Department of Civil and Environmental Engineering, Tarbiat Modares University, Tehran, Iran

Amirali Zarrinmehr, Mahmoud Saffarzadeh & Seyedehsan Seyedabrishami

Department of Civil and Environmental Engineering, Northwestern University, Evanston, USA

Yu Marco Nie

You can also search for this author in PubMed   Google Scholar

Corresponding author

Correspondence to Mahmoud Saffarzadeh .

1.1 The information of candidate routes in the Chicago Sketch network

Table  4 shows the sequence of transit nodes for each of 55 candidate routes adopted in the Chicago Sketch network.

1.2 Finding the greedy solutions in the Chicago Sketch network

To illustrate how the algorithm finds 61 greedy solutions in the Chicago Sketch network, as in Table  2 of the paper, Table  5 reports transit links that are removed from the configuration as the algorithm proceeds. For brevity, the following notations are used in this table to show the removed links:

The beginning link of the k th sub-route

The ending link of the k th sub-route

All links of the k th sub-route

The removed transit links, in each iteration, are listed in ascending order of their D/L values.

1.3 Configuration of sub-routes for solutions A , B , C , and D

Table  6 reports the configuration associated with four solutions A , B , C , and D , depicted in Fig.  7 of the paper. In this table, we use either k ( N 1 , N 2 ) or k (Ø) to show the k th sub-route. The former notation stands for a sub-route starting from node N 1 and ending in node N 2 of the k th sub-route. The latter also means that the k th sub-route is empty.

Rights and permissions

Reprints and permissions

About this article

Zarrinmehr, A., Saffarzadeh, M., Seyedabrishami, S. et al. A path-based greedy algorithm for multi-objective transit routes design with elastic demand. Public Transp 8 , 261–293 (2016). https://doi.org/10.1007/s12469-016-0131-1

Download citation

Accepted : 05 July 2016

Published : 19 August 2016

Issue Date : September 2016

DOI : https://doi.org/10.1007/s12469-016-0131-1

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

• Transit routes design
• Transit ridership
• Path-based traffic assignment
• Greedy algorithm
• Pareto-optimal
• Find a journal
• Publish with us
• Track your research