<rss version="2.0" xmlns:atom="https://www.w3.org/2005/Atom">
  <channel>
    <title>Transport Research International Documentation (TRID)</title>
    <link>https://trid.trb.org/</link>
    <atom:link href="https://trid.trb.org/Record/RSS?s=PHNlYXJjaD48cGFyYW1zPjxwYXJhbSBuYW1lPSJkYXRlaW4iIHZhbHVlPSJhbGwiIC8+PHBhcmFtIG5hbWU9InN1YmplY3Rsb2dpYyIgdmFsdWU9Im9yIiAvPjxwYXJhbSBuYW1lPSJ0ZXJtc2xvZ2ljIiB2YWx1ZT0ib3IiIC8+PHBhcmFtIG5hbWU9ImxvY2F0aW9uIiB2YWx1ZT0iMCIgLz48L3BhcmFtcz48ZmlsdGVycz48ZmlsdGVyIGZpZWxkPSJpbmRleHRlcm1zIiB2YWx1ZT0iJnF1b3Q7TmV0d29yayBtb2RlbHMmcXVvdDsiIG9yaWdpbmFsX3ZhbHVlPSImcXVvdDtOZXR3b3JrIG1vZGVscyZxdW90OyIgLz48L2ZpbHRlcnM+PHJhbmdlcyAvPjxzb3J0cz48c29ydCBmaWVsZD0icHVibGlzaGVkIiBvcmRlcj0iZGVzYyIgLz48L3NvcnRzPjxwZXJzaXN0cz48cGVyc2lzdCBuYW1lPSJyYW5nZXR5cGUiIHZhbHVlPSJwdWJsaXNoZWRkYXRlIiAvPjwvcGVyc2lzdHM+PC9zZWFyY2g+" rel="self" type="application/rss+xml" />
    <description></description>
    <language>en-us</language>
    <copyright>Copyright © 2026. National Academy of Sciences. All rights reserved.</copyright>
    <docs>http://blogs.law.harvard.edu/tech/rss</docs>
    <managingEditor>tris-trb@nas.edu (Bill McLeod)</managingEditor>
    <webMaster>tris-trb@nas.edu (Bill McLeod)</webMaster>
    <image>
      <title>Transport Research International Documentation (TRID)</title>
      <url>https://trid.trb.org/Images/PageHeader-wTitle.jpg</url>
      <link>https://trid.trb.org/</link>
    </image>
    <item>
      <title>Day-to-day dynamic network modeling and optimization</title>
      <link>https://trid.trb.org/View/1354485</link>
      <description><![CDATA[In this paper, traffic signal setting with day-to-day dynamic process assignment is addressed. This issue seems relevant since optimization of signal timings under equilibrium assumptions only may not guarantee an effective solution, because it may well be not an attractor of the evolution over time. The main contribution of this paper is an analysis for a real size network of the impact of behavioral parameters that may be affected by information available to users.]]></description>
      <pubDate>Sat, 30 May 2015 18:00:56 GMT</pubDate>
      <guid>https://trid.trb.org/View/1354485</guid>
    </item>
    <item>
      <title>Map-Matching Algorithm for Applications in Multimodal Transportation Network Modeling</title>
      <link>https://trid.trb.org/View/1339023</link>
      <description><![CDATA[Generalized Transit Feed Specification (GTFS) files have gained wide acceptance by transit agencies, which now provide them for most major metropolitan areas. The public availability GTFSs combined with the convenience of presenting a standard data representation has promoted the development of numerous applications for their use. Whereas most of these tools are focused on the analysis and utilization of public transportation systems, GTFS data sets are also extremely relevant for the development of multimodal planning models. The use of GTFS data for integrated modeling requires creating a graph of the public transportation network that is consistent with the roadway network. The former is not trivial, given limitations of networks often used for regional planning models and the complexity of the roadway system. A proposed open-source algorithm matches GTFS geographic information to existing planning networks and is also relevant for real-time in-field applications. The methodology is based on maintaining a set of candidate paths connecting successive geographic points. Examples of implementations using traditional planning networks and a network built from crowdsourced OpenStreetMap data are presented. The versatility of the methodology is also demonstrated by using it for matching GPS points from a navigation system. Experimental results suggest that this approach is highly successful even when the underlying roadway network is not complete. The proposed methodology is a promising step toward using novel and inexpensive data sources to facilitate and eventually transform the way that transportation models are built and validated.]]></description>
      <pubDate>Mon, 30 Mar 2015 20:23:28 GMT</pubDate>
      <guid>https://trid.trb.org/View/1339023</guid>
    </item>
    <item>
      <title>Building a Water Distribution Network Hydraulic Model by Using WaterGEMS</title>
      <link>https://trid.trb.org/View/1275060</link>
      <description><![CDATA[Dynamic pipe network hydraulic modeling is the realization of the municipal water supply network to optimize an effective means of scheduling and science operations. Pipe network modeling processes; the basic data collection, including flow and pressure points supervisory control and data acquisition (SCADA) data; acquisition and importing of model work, are the key to establishing a precise model. Geographic information system (GIS) data in an urban pipeline network, for instance, creates a dynamic water supply network model. A detailed analysis of the operation, using WaterGEMS provides practical examples to establish a water supply network model based on SCADA data.]]></description>
      <pubDate>Wed, 30 Apr 2014 10:12:13 GMT</pubDate>
      <guid>https://trid.trb.org/View/1275060</guid>
    </item>
    <item>
      <title>Optimized Landing of Autonomous Unmanned Aerial Vehicle Swarms</title>
      <link>https://trid.trb.org/View/1216785</link>
      <description><![CDATA[This research explores a future concept requiring the efﬁcient and safe, landing and recovery of a swarm of unmanned aerial vehicles (UAVs). The presented work involves the use of an overarching (centralized) airspace optimization model, formulated analytically as a network-based model with side constraints describing a time-expanded network model of the terminal airspace in which the UAVs navigate to one or more (possibly moving) landing zones. This model generates optimal paths in a centralized manner such that the UAVs are properly sequenced into the landing areas. The network-based model is “grown” using agent based simulation with simple ﬂocking rules. The resulting solution is compared to another agent-based model which uses similar avoidance rules for the landing of these UAVs, exploring the beneﬁt of distributed computation and decision-making characteristic of swarming models. Relevant measures of performance include, e.g., the total time necessary to land the swarm. Extensive simulation studies and sensitivity analyses are conducted to demonstrate the relative effectiveness of the proposed approaches.]]></description>
      <pubDate>Fri, 19 Oct 2012 15:52:41 GMT</pubDate>
      <guid>https://trid.trb.org/View/1216785</guid>
    </item>
    <item>
      <title>Railways 2011, Including 2011 Thomas B. Deen Distinguished Lecture</title>
      <link>https://trid.trb.org/View/1133848</link>
      <description><![CDATA[This issue contains the 2011 Thomas B. Deen distinguished lecture on the future of railroads and 20 other papers concerned with the following aspects of railways:  economic impacts of high-speed rail for Great Britain; economic impacts of intercity passenger rail service; cluster analysis of intercity rail passengers; high-speed railways in Spain; hierarchical network model of high-speed rail operation; fire development and spread in passenger rail vehicles; geometry of high-speed turnouts; cost-benefit analysis of urban rail projects; value of time influence on profitability of railway projects; expanding Alaska-Canada rail; midwest rail study of emissions of fine particulates from railyard activities; risk management of railroad transport of hazardous materials; train delay and economic impact of in-service railroad failures; estimation of intermodal rail cost; noncontact ultrasonic guided-wave system for rail inspection; railroad wayside defect detectors; track maintenance of heavy haul railways; maintenance decisions related to rail track geometry; evaluation of railroad ballast performance; and analysis of derailments.]]></description>
      <pubDate>Wed, 07 Mar 2012 11:26:50 GMT</pubDate>
      <guid>https://trid.trb.org/View/1133848</guid>
    </item>
    <item>
      <title>Use of Regional Transportation Planning Tool for Modeling Emergency Evacuation: Case Study of Northern New Jersey</title>
      <link>https://trid.trb.org/View/1130475</link>
      <description><![CDATA[Evacuation modeling and analysis are concerned primarily with identifying the types of traffic movements associated with a disaster evacuation, as well as the estimation of evacuation and clearance times. Thus, an efficient evacuation planning model is important in determining evacuation times, identifying critical locations in the transportation network, and assessing traffic operations strategies and evacuation policies. In this paper various scenarios, including a hurricane, a toxic chemical leak, dirty bombs, and a nuclear event, are studied to understand the evacuation and highway network effects of the evacuating population. Unlike corridor studies or bottleneck studies found in the literature, a network model with equilibrium assignment is used. The scenarios are tested with a case study of Northern New Jersey, modeled with the North Jersey Regional Transportation Model–Enhanced, a large-scale travel demand model of the region. The results presented in this paper focus on the effect of several assumptions and input data on the evacuation estimates, giving planners an idea of the necessary considerations for evacuation planning with a modeling context. The experience with this study shows that regional planning models are suitable tools to model evacuation; however, the modeler must be careful in their use. Multiple methodologies can be used, and assumptions, such as time of day, notice or no-notice, passengers per car, and background traffic in the network, have wide-ranging effects.]]></description>
      <pubDate>Tue, 21 Feb 2012 10:06:03 GMT</pubDate>
      <guid>https://trid.trb.org/View/1130475</guid>
    </item>
    <item>
      <title>Network impacts of a road capacity reduction: Empirical analysis and model predictions</title>
      <link>https://trid.trb.org/View/1124172</link>
      <description><![CDATA[In spite of their widespread use in policy design and evaluation, relatively little evidence has been reported on how well traffic equilibrium models predict real network impacts. Here we present what we believe to be the first paper that together analyses the explicit impacts on observed route choice of an actual network intervention and compares this with the before-and-after predictions of a network equilibrium model. The analysis is based on the findings of an empirical study of the travel time and route choice impacts of a road capacity reduction. Time-stamped, partial licence plates were recorded across a series of locations, over a period of days both with and without the capacity reduction, and the data were 'matched' between locations using special-purpose statistical methods. Hypothesis tests were used to identify statistically significant changes in travel times and route choice, between the periods of days with and without the capacity reduction. A traffic network equilibrium model was then independently applied to the same scenarios, and its predictions compared with the empirical findings. From a comparison of route choice patterns, a particularly influential spatial effect was revealed of the parameter specifying the relative values of distance and travel time assumed in the generalised cost equations. When this parameter was 'fitted' to the data without the capacity reduction, the network model broadly predicted the route choice impacts of the capacity reduction, but with other values it was seen to perform poorly. The paper concludes by discussing the wider practical and research implications of the study's findings.]]></description>
      <pubDate>Fri, 16 Dec 2011 14:48:02 GMT</pubDate>
      <guid>https://trid.trb.org/View/1124172</guid>
    </item>
    <item>
      <title>Hierarchical Network Model of Safe High-Speed Rail Operation</title>
      <link>https://trid.trb.org/View/1091528</link>
      <description><![CDATA[This paper presents a preliminary hierarchical network model based on an analysis of the interaction of relationships between operating safety factors of high-speed rail (HSR). The model is based on the characteristics and factors specific to HSR operation and aims to provide a new theory and method for assessing the safety of HSR operation with the use of the relationship analysis methods of a hierarchical network model. A comprehensive theory of safety assessment in HSR operations is necessary for HSR designers and operators to consider rail safety pro­actively rather than passively. The development and the application of such a broad-ranging safety assessment theory for HSR operation could help to guarantee efficient HSR operation by protecting the safety of passengers, reducing losses, maintaining social stability, and improving economic efficiency.]]></description>
      <pubDate>Tue, 24 May 2011 07:42:21 GMT</pubDate>
      <guid>https://trid.trb.org/View/1091528</guid>
    </item>
    <item>
      <title>Network-based real option models</title>
      <link>https://trid.trb.org/View/1099099</link>
      <description><![CDATA[Building on earlier work to incorporate real option methodologies into network modeling, two models are proposed. The first is the network option design problem, which maximizes the expanded net present value of a network investment as a function of network design variables with the option to defer the committed design investment. The problem is shown to be a generalized version of the network design problem and the multi-period network design problem. A heuristic based on radial basis functions is used to solve the problem for continuous link expansion with congestion effects. The second model is a link investment deferral option set, which decomposes the network investment deferral option into individual, interacting link or project investments. This model is a project selection problem under uncertainty, where each link or project can be deferred such that the expanded net present value is maximized. The option is defined in such a way that a lower bound can be solved using an exact method based on multi-option least squares Monte Carlo simulation. Numerical tests are conducted with the classical Sioux Falls network and compared to earlier published results.]]></description>
      <pubDate>Fri, 29 Apr 2011 07:36:32 GMT</pubDate>
      <guid>https://trid.trb.org/View/1099099</guid>
    </item>
    <item>
      <title>Application of Complex Network Theory and Genetic Algorithm in Airline Route Networks</title>
      <link>https://trid.trb.org/View/1091654</link>
      <description><![CDATA[To cope with increasing customer demand and market changes, airline companies need to organize and manage their route networks in a more cost-efficient way. In addition, the robustness of flight operations against unpredictable accidents such as terrorist attacks and natural disasters has become more important to airlines. In this study, the concepts and techniques from complex network theory are used to model airline route networks, and then an effective and efficient genetic algorithm is developed to optimize airline route networks in terms of network properties that may have crucial roles to play in improving the cost-effectiveness and reliability of airspace systems. The simulation results illustrate that the work reported in this study has a good potential to improve the topology of airline route networks in terms of given network properties such as operating costs and network robustness.]]></description>
      <pubDate>Fri, 22 Apr 2011 11:04:28 GMT</pubDate>
      <guid>https://trid.trb.org/View/1091654</guid>
    </item>
    <item>
      <title>A two-stage supply chain DEA model for measuring container-terminal efficiency</title>
      <link>https://trid.trb.org/View/1097323</link>
      <description><![CDATA[Despite the growing amount of research into container-port operations and efficiency, much of the literature on the subject treats container ports and terminals as black box systems without examining the structure of their transformation and production processes. Research on the network and multi-stage structure of container-terminal operating systems is scarce and its applications in the context of port performance and benchmarking are even scarcer. In this paper, the authors argue that the container terminal production would be best modelled as a network of interrelated sub-processes and operating sites and develop a supply chain data envelopment analysis (DEA) model aimed at capturing the transformational process within the container-terminal system and across its sub-systems. The authors start by modelling container terminal operations as a container-flow process and analyse their site-specific and combined efficiency before formalising a two-stage supply chain DEA model to measure the efficiencies of both individual and network container terminal operations. Although, due to the unavailability of detailed operational data, this study is limited to container export flows only, the results provide further insight on the network structure of container-terminal operating systems and confirm the existence of disproportionate performances and efficiency levels between container-terminal operating sites and sub-processes.]]></description>
      <pubDate>Thu, 24 Mar 2011 13:45:59 GMT</pubDate>
      <guid>https://trid.trb.org/View/1097323</guid>
    </item>
    <item>
      <title>On a New Rotation Tour Network Model for Aircraft Maintenance Routing Problem</title>
      <link>https://trid.trb.org/View/1094830</link>
      <description><![CDATA[The airline industry is expected to grow rapidly with the population growth and growth in the overall economy and currently has a $40-billion plus market. Thousands of aircraft undergo maintenance, repair, and overhaul everyday. The aircraft maintenance problem is one of the airline industry's important logistical problems. It is aimed at scheduling aircraft routing to enable enough maintenance opportunities for every aircraft in the fleet. In this paper, The authors present a new compact network representation of the aircraft maintenance routing problem (AMR) and propose a new mixed-integer linear programming formulation to solve the problem in this paper. Four real test instances from a major U.S. carrier were used to assess the quality of this model, which was then compared with the flight string model proposed in the literature. The computational results show that in all test instances the proposed model is able to obtain the optimal solutions in reasonable time. This study suggests that this model can be applied to integrated AMR problems and other planning problems such as the fleet assignment problem and crew pairing problem.]]></description>
      <pubDate>Mon, 21 Mar 2011 14:13:55 GMT</pubDate>
      <guid>https://trid.trb.org/View/1094830</guid>
    </item>
    <item>
      <title>A time-space network model for unit load device stock planning in international airline services</title>
      <link>https://trid.trb.org/View/1096629</link>
      <description><![CDATA[Unit load devices (pallets, containers, etc.) are used to move luggage and air cargo on wide-bodied aircraft. This paper examines a case study of the number of devices needed by an airline for international scheduled services. Unit load device movements between airports require planes to load and deliver. The stock of the unit load devices is thus influenced by the airline's scheduled services. Based on a recurring weekly schedule, this study develops a time-space network to formulate mathematical programming models for minimizing device quantities. This model is applied to assess the preparation level of unit load devices for the various service networks for a Taiwanese airline.]]></description>
      <pubDate>Mon, 21 Mar 2011 14:13:53 GMT</pubDate>
      <guid>https://trid.trb.org/View/1096629</guid>
    </item>
    <item>
      <title>A generalized modeling framework to analyze interdependencies among infrastructure systems</title>
      <link>https://trid.trb.org/View/1096648</link>
      <description><![CDATA[Extreme events over the past decade in the USA, ranging from the 9/11 terror attacks to the 2003 Northeast power blackout to the 2005 hurricanes, have highlighted the urgent need to understand the interdependencies among civil infrastructure systems for more effective and efficient planning, design and operations. The need is further highlighted by the challenges arising from the capacity needs of rapid urbanization and the need to renew aging infrastructure. This paper proposes a generalized modeling framework that combines a multilayer network concept with a market-based economic approach to capture the interdependencies among various infrastructure systems with disparate physical and operational characteristics. Thereby, the various infrastructure systems are modeled as individual networks connected through links representing market interactions. The market interactions capture the various types of interdependencies through supply-demand mechanisms. The modeling framework uses a multilayer infrastructure network (MIN) concept, the computable general equilibrium (CGE) theory, and its spatial extension (SCGE), to formulate an equilibrium problem. The mapping between the modeling framework and the real-world context is discussed, followed by a description of the various model components. Numerical experiments are conducted to illustrate the capability of the model to capture various types of interdependencies and to provide insights on the importance of these interdependencies for real-world problems.]]></description>
      <pubDate>Mon, 21 Mar 2011 14:13:51 GMT</pubDate>
      <guid>https://trid.trb.org/View/1096648</guid>
    </item>
    <item>
      <title>Modeling Network Transition Constraints with Hypergraphs</title>
      <link>https://trid.trb.org/View/1094777</link>
      <description><![CDATA[Discrete time dynamic graphs are frequently used in modeling multicommodity flows or activity paths through constrained resources, but simple graphs fail to capture resource transition interaction effects. The resulting schedules return inflated objective values, since they are not operationally feasible. The authors derive a directed hypergraph formulation to address railway network sequencing constraints, and solve an experimental problem sample to estimate the magnitude of objective inflation when interaction effects are ignored. The model is used to demonstrate advance scheduling value of train paths on a busy North American railway.]]></description>
      <pubDate>Mon, 21 Mar 2011 14:13:50 GMT</pubDate>
      <guid>https://trid.trb.org/View/1094777</guid>
    </item>
  </channel>
</rss>