<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+PHBhcmFtIG5hbWU9ImxvY2F0aW9uIiB2YWx1ZT0iMCIgLz48L3BhcmFtcz48ZmlsdGVycz48ZmlsdGVyIGZpZWxkPSJpbmRleHRlcm1zIiB2YWx1ZT0iJnF1b3Q7QWxnZWJyYSZxdW90OyIgb3JpZ2luYWxfdmFsdWU9IiZxdW90O0FsZ2VicmEmcXVvdDsiIC8+PC9maWx0ZXJzPjxyYW5nZXMgLz48c29ydHM+PHNvcnQgZmllbGQ9InB1Ymxpc2hlZCIgb3JkZXI9ImRlc2MiIC8+PC9zb3J0cz48cGVyc2lzdHM+PHBlcnNpc3QgbmFtZT0icmFuZ2V0eXBlIiB2YWx1ZT0icHVibGlzaGVkZGF0ZSIgLz48L3BlcnNpc3RzPjwvc2VhcmNoPg==" 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>Algebraic Method of Arterial Progression Based on Green Center Line</title>
      <link>https://trid.trb.org/View/2278539</link>
      <description><![CDATA[An algebraic method of arterial progression based on the green center line was presented in this study, which optimized the common signal cycle, phase sequence of each intersection, and offsets by seeking the ideal intersection positions with a small bias distance from the actual intersection positions. Since the bias split would determine the progression bandwidth and impact the progression effect directly, this method took the maximum difference of all bias splits as an evaluation index for scheme optimization. This method was applied to obtain an arterial progression for the 21 signalized intersections on Huanshi West Road in Nansha District, Guangzhou. Compared with the MAXBAND, MULTIBAND model, and the Synchro software, the VISSIM simulation results showed that the algebraic method achieved the best coordinated control effect for the through vehicles along the artery. The schemes obtained by the MULTIBAND model and algebraic method achieved the minimum delay and number of stops for all through vehicles on each road section.]]></description>
      <pubDate>Tue, 28 Nov 2023 10:27:32 GMT</pubDate>
      <guid>https://trid.trb.org/View/2278539</guid>
    </item>
    <item>
      <title>A multi-channel geometric algebra residual network for traffic data prediction</title>
      <link>https://trid.trb.org/View/2043509</link>
      <description><![CDATA[Traffic data prediction offers a significant way to evaluate the future traffic congestion status; many deep learning based approaches have been widely applied in this field. Most current methods only consider short-term traffic data forecasting; however, long-term prediction, which supports the optimized distribution of traffic resources, is not well studied. Besides, multiple traffic parameters enable stronger constraints for the data estimation, but the correlation between them in both spatial and temporal domains has not been efficiently learned. Geometric algebra, as a generalization of linear algebra, provides a framework to encode multidimensional data and analyze the correlation. By combining the advantages of the deep neural network and geometric algebra, a multi-channel geometric algebra residual network (MGAResNet) is proposed to address the problem of long-term traffic data prediction. Traffic data obtained from two urban expressways are employed and experimental results demonstrate that the approach outperforms the state-of-the-art work.]]></description>
      <pubDate>Thu, 20 Oct 2022 10:23:54 GMT</pubDate>
      <guid>https://trid.trb.org/View/2043509</guid>
    </item>
    <item>
      <title>An expeditious algebraic formulation to the buckling critical load of risers under dynamic compression</title>
      <link>https://trid.trb.org/View/1761329</link>
      <description><![CDATA[Dynamic compression of risers can play an important role in the structural stability of submerged pipes in catenary-like configuration. In this paper, the analytical formulation for the buckling critical load, developed in the early 2000's, is revisited and extended to cover a wider range of practical cases. A purely algebraic expression for the critical load is provided, eliminating the original formulation requirement related to solving transcendental equations, for both free and anchored risers. The analytic formulations and respective algebraic approximations are compared with numerical simulations, presenting a fairly good agreement. A discussion on the differences and similarities of each formulation ends this paper, highlighting their range of validity. Also, from the comparison, the analytical formulation developed in this work was more suitable for precise and fast determination of the critical buckling load for both riser types, rigid and flexible, and for most typical operating conditions. The proposed algebraic expressions were highly accurate and may substitute the previous analytical formulations for critical load prediction.]]></description>
      <pubDate>Wed, 27 Jan 2021 10:10:43 GMT</pubDate>
      <guid>https://trid.trb.org/View/1761329</guid>
    </item>
    <item>
      <title>Application of Kronecker Algebra for Railway Line Zagreb – Rijeka</title>
      <link>https://trid.trb.org/View/1696355</link>
      <description><![CDATA[Within the Shift2Rail-Project "GoSafeRail" so called Kronecker Algebra is applied on the railway line from Zagreb to Rijeka for traffic flow optimisation. Kronecker Algebra consists out of Kronecker Product and Kronecker Sum to describe concurrency of tasks as well es their inter-leavings. The railway line from Zagreb to Rijeka has been successfully modelled by software tool called OpenTrack. In this project data from OpenTrack model is converted into input for Kronecker Algebra to manage rail capacity in an efficient manner. To model the infrastructure so called IVT format is used to export an itinerary covering the main track. The entire line from Zagreb to Rijeka is modelled by 250 edges. The timetable is exported in OpenTrack text format and used to create train run files for the 225 daily running trains. Train dynamics are also considered by tractive effort diagram and braking force diagram.]]></description>
      <pubDate>Mon, 27 Apr 2020 14:39:19 GMT</pubDate>
      <guid>https://trid.trb.org/View/1696355</guid>
    </item>
    <item>
      <title>Numerical Analysis of Turbulent Buoyant Helium Plume by Algebraic Reynolds Stress and Turbulent Mass Flux Models</title>
      <link>https://trid.trb.org/View/1595065</link>
      <description><![CDATA[Numerical analysis has been performed for vertical buoyant turbulent flow of air-helium mixture plume in open space by using algebraic Reynolds stress model and algebraic turbulent mass flux model. Calculated results are compared with the experimental data of velocity profile, helium concentration and Reynolds stresses in order to confirm the validity of the presented algebraic turbulent mass flux model. Although the agreement is certainly not perfect especially for vertical normal stress, the main features, which are accelerated flow, rapid diffusion of helium and periodic puff cycles induced by Rayleigh-Taylor instability, are reasonably predicted by the presented algebraic turbulent mass flux model.]]></description>
      <pubDate>Thu, 23 May 2019 10:23:18 GMT</pubDate>
      <guid>https://trid.trb.org/View/1595065</guid>
    </item>
    <item>
      <title>Simulation of railway network using Kronecker algebra for optimization of the transport flow</title>
      <link>https://trid.trb.org/View/1515485</link>
      <description><![CDATA[As a part of the project GoSAFE RAIL, one working package is dedicated to the development of the integrated model of the railway network which will incorporate the data on infrastructural resources in order to enable the safe, reliable and efficient railway infrastructure. Using the mechanism for simulation of micro-levels OpenTrack enables the optimization of the capacity and maximum availability of the network. Until now the optimization was defined in advance by the users and it was tested, which led to the missed optimum solutions. This modelling tool will be able to dynamically optimize the operations, especially during the degraded operations, using the algorithms for optimization with multiple criteria for solution of complicated requests. Using the Kronecker algebra for optimization as well as the programme interface of application software (API) as a part of the study of the railway network Zagreb – Rijeka, the behaviour of the real flows of the network was simulated as the proof on the acceptability of the solutions given by the algorithm.]]></description>
      <pubDate>Mon, 25 Jun 2018 13:49:44 GMT</pubDate>
      <guid>https://trid.trb.org/View/1515485</guid>
    </item>
    <item>
      <title>Tools for Primal Degenerate Linear Programs: IPS, DCA, and PE</title>
      <link>https://trid.trb.org/View/1409573</link>
      <description><![CDATA[This paper describes three recent tools for dealing with  primal degeneracy in linear programming. The first one is the improved primal simplex (IPS) algorithm which turns degeneracy into a possible advantage.  The constraints of the original problem are dynamically partitioned based on the numerical values of the current basic variables. The idea is to work only with those constraints that correspond to nondegenerate basic variables. This leads to a row-reduced problem which decreases the size of the current working basis.  The main feature of IPS is that it provides a nondegenerate pivot at every iteration of the solution process until optimality is reached. To achieve such a result, a negative reduced cost convex combination of the variables at their bounds is selected, if any. This pricing step provides a necessary and sufficient optimality condition for linear programming. The second tool is the dynamic constraint aggregation (DCA), a constructive strategy specifically designed for set partitioning constraints. It heuristically aims to achieve the properties provided by the IPS methodology. We bridge the similarities and differences of IPS and DCA on set partitioning models. The final tool is the positive edge (PE) rule. It capitalizes on the compatibility definition to determine the status of a column vector and the associated variable during the reduced cost computation. Within IPS, the selection of a compatible variable to enter the basis ensures a nondegenerate pivot, hence PE permits a trade-off between strict improvement and high, reduced cost degenerate pivots. This added value is obtained without explicitly computing the updated column components in the simplex tableau. Ultimately, we establish tight bonds between these three tools by going back to the linear algebra framework from which emanates the so-called concept of subspace basis.]]></description>
      <pubDate>Tue, 28 Jun 2016 16:22:22 GMT</pubDate>
      <guid>https://trid.trb.org/View/1409573</guid>
    </item>
    <item>
      <title>Optimisation of Railway Operation by Application of Kronecker Algebra</title>
      <link>https://trid.trb.org/View/1373207</link>
      <description><![CDATA[Kronecker Algebra consists of Kronecker Product and Kronecker Sum. This mathematical model can be used to model systems consisting of a number of limited resources and several actors. In particular, it can be used to model railway systems with trains, track sections and their routes. In this paper the authors show several applications of Kronecker Algebra in the railway domain. The authors consider deadlock prevention, travel time calculation, and energy analysis. The integration of these three tasks within one single type of Kronecker-based analysis is rather simple and can be carried out very efficiently. Due to the fact that Kronecker Algebra operations can be easily parallelized, the authors implementation can take full advantages of today's multi-core computer architecture. In addition the authors implementation shows that adding constrains for connections or overtaking speeds up the calculation. In fact, a harder problem is easier to solve.]]></description>
      <pubDate>Tue, 24 Nov 2015 09:28:21 GMT</pubDate>
      <guid>https://trid.trb.org/View/1373207</guid>
    </item>
    <item>
      <title>Heap-model-based scheduling of ship building lines for tandem construction of a pair of ships</title>
      <link>https://trid.trb.org/View/1371838</link>
      <description><![CDATA[This paper aims to develop further the authors' previous work, which is concerned with a just-in-time scheduling problem of block-assembly lines lines conveyorized in a shipyard. The blocks fabricated are stocked for pre-fitting and painting works and they are provided to pre-election area. The authors proposed a new method called as Max-Plus Method to solve the problem. In some cases, however, this method can’t satisfy a synchronization constraint that pre-subblocks must be fabricated before the specific subblocks are fabricated. Also it can’t manage the stockyard very well except the utilization of round-robin type. In the paper, another new method called as Heap Method is proposed, which is inspired from the Heap Model in the field of Max-Plus algebra. It is shown that the above unsolved problems can be solved.]]></description>
      <pubDate>Wed, 28 Oct 2015 10:21:37 GMT</pubDate>
      <guid>https://trid.trb.org/View/1371838</guid>
    </item>
    <item>
      <title>Max-plus-algebra based scheduling of ship building lines for tandem construction of a pair of ships</title>
      <link>https://trid.trb.org/View/1351547</link>
      <description><![CDATA[The paper is concerned with a just-in-time scheduling problem of block-assembly lines conveyorized for tandem construction of a pair of ships in a shipyard. The blocks fabricated are stocked for pre-fitting and painting works and they are provided to pre-election area. It is not easy to schedule the block-assembly lines in order to avoid the stock overflow and to realize the just-in-time arrivals to the pre-election area. In a conventional scheduling of push type, there are many idling days in the stocking period. Therefore the problem can be formulated as minimizing these idling days such that constraints of conveyor plates and stockyard capacities are satisfied under a dispatching rule for assembled order. In the paper, a new method to solve the problem is proposed, which requires a linear inequality represented by Max-Plus algebra. A pull-type scheduling is obtained as its maximal solution. Based on the scheduling results applied to the shipyard, the effectiveness and limitations are discussed.]]></description>
      <pubDate>Tue, 28 Apr 2015 08:40:33 GMT</pubDate>
      <guid>https://trid.trb.org/View/1351547</guid>
    </item>
    <item>
      <title>Synchronization Optimization Model of BRT System Based on Max-Plus Algebra Petri Net</title>
      <link>https://trid.trb.org/View/1276412</link>
      <description><![CDATA[Urban public transport system can be seen as a Petri nets synchronization model based on time. In this article, considering Petri nets' insufficient analysis capabilities, the Petri nets model—Timed Event Graph (TEG)—is transformed, using max-plus algebra, to a linear model with special algebra structure. The two methods, Petri nets and max-plus algebra, are combined to solve the synchronization problem of an urban public system to reduce the transfer waiting time of passengers in an urban public transportation system and improve its service quality.]]></description>
      <pubDate>Mon, 03 Mar 2014 10:52:23 GMT</pubDate>
      <guid>https://trid.trb.org/View/1276412</guid>
    </item>
    <item>
      <title>Algebraic Approach for Performance Bound Calculus on Transportation Networks: Road Network Calculus</title>
      <link>https://trid.trb.org/View/1242742</link>
      <description><![CDATA[An application of the basic results of deterministic network calculus theory to road traffic flow theory is presented. Network calculus is a theory based on min-plus algebra. This calculus uses algebraic techniques to compute performance bounds in communication networks, such as maximum end-to-end delays and backlogs. The objective of this paper is to investigate the application of those techniques for determining performance bounds on road networks, such as upper bounds for travel times. A traffic model is proposed for cars moving in a single-lane ring road without passing. The model is compatible with network calculus theory and permits derivation of an upper bound of the travel time of cars on the road. An approach for extending the model to calculate upper bounds for the travel times of cars on paths passing through intersections in a whole network is also proposed.]]></description>
      <pubDate>Tue, 23 Apr 2013 16:04:25 GMT</pubDate>
      <guid>https://trid.trb.org/View/1242742</guid>
    </item>
    <item>
      <title>Kronecker algebra-based deadlock analysis for railway systems</title>
      <link>https://trid.trb.org/View/1226091</link>
      <description><![CDATA[Deadlock analysis for railway systems differs in several aspects from deadlock analysis in computer science. While the problem of deadlock analysis for standard computer systems is well-understood, multi-threaded embedded computer systems pose new challenges. A novel approach in this area can easily be applied to deadlock analysis in the domain of railway systems. The approach is based on Kronecker algebra. A lazy implementation of the matrix operations even allows analysing exponentially sized systems in a very efficient manner. The running time of the algorithm does not depend on the problem size but on the size of the solution. While other approaches suffer from the fact that additional constraints make the problem and its solution harder, this approach delivers its results faster if constraints are added. In addition, this approach is complete and sound for railway systems, i.e., it generates neither false positives nor false negatives.]]></description>
      <pubDate>Thu, 17 Jan 2013 13:49:49 GMT</pubDate>
      <guid>https://trid.trb.org/View/1226091</guid>
    </item>
    <item>
      <title>Minimization of the Linear Functional</title>
      <link>https://trid.trb.org/View/1124165</link>
      <description><![CDATA[This paper presents some numerical methods for minimization problems as Variational Inequalities of Elliptic (IVE). The numerical analysis, which is obtained based on abstract algorithms and concrete numerical algorithms, is described by software (in Pascal).]]></description>
      <pubDate>Thu, 29 Dec 2011 07:47:46 GMT</pubDate>
      <guid>https://trid.trb.org/View/1124165</guid>
    </item>
    <item>
      <title>Drivers of Conflict in Developing Country Infrastructure Projects: Experience from the Water and Pipeline Sectors</title>
      <link>https://trid.trb.org/View/1112537</link>
      <description><![CDATA[Despite the considerable scholarship focused on infrastructure investment in the developing world and the substantial sums of money spent each year on developing-country infrastructure, little attention has been given to understanding the drivers of conflict that shape the trajectory and cost structures of these massive investments. The manifestation of conflict among stakeholders in infrastructure projects ranges from the renegotiation of contract terms by project partners to popular protests among consumers of privatized services. The principal objective of this research is to identify combinations of country, project, and stakeholder factors that are associated with the emergence of legal and political conflict within natural gas and oil pipeline projects and water supply concessions and leases. The analysis includes data from 26 infrastructure projects spanning 31 countries and uses an analytical approach derived from Boolean algebra. Country-level characteristics, such as extent of democracy and rate of international NGO membership, are found to be important elements in the recipes for conflict among water supply projects but not for pipeline projects. Local impacts such as service price increases (water supply) and limited provision of oil and gas to the project host country (pipelines) are also important drivers of conflict for both subsectors. The involvement of one or more international financial institutions is also associated with the emergence of conflict in projects. Contrary to expectations, public consultation is associated with conflict in both subsectors. Overall, the study findings suggest that several factors associated with conflict in infrastructure projects can be minimized with careful project design.]]></description>
      <pubDate>Wed, 24 Aug 2011 11:28:09 GMT</pubDate>
      <guid>https://trid.trb.org/View/1112537</guid>
    </item>
  </channel>
</rss>