1. Introduction
Railway tracks are infrastructures supporting train traffic. For example, in France the global network was 48,000 km long in 2026, supporting each day around 15,000 trains of goods and travelers (These numbers were taken from the official website
www.sncf-reseau.com, in 17 February 2026). Therefore, they have a major social and economic impact in western countries.
Conventional ballasted railway tracks are composed of multiple elements: rails, sleepers, fasteners, ballast, rail pads, etc. The track’s global mechanical behavior can be explained with the three main elements—rails, sleepers, and ballast—as shown in
Figure 1 [
1]. Rails ensure the support and guidance of the trains. Sleepers maintain rails and transmit load from rails to ballast. Ballast is a geo-material extracted from natural rocks. It ensures multiple roles, transmits and shares load from sleepers to the ground, maintains track geometry, absorbs part of the vibrations, etc.
Train transportation safety and efficiency is highly dependent on track geometry, and centimeters of differential deformations could lead to derailment. In order to prevent these incidents, the track geometry is monitored and maintained throughout its life cycle. In order to predict these deformations, numerical modeling can be conducted with Finite Element Methods (FEMs). These models are the most commonly used when it comes to modeling the general behavior of tracks [
2]. These models allow the computation of track deformation, mainly due to the irreversible deformation of the ballast layer. Its elastic–plastic behavior widely contributes to track geometry evolution [
3]. Therefore, understanding these behaviors and degradation mechanisms is a safety concern.
An accurate modeling process requires all specificities of the track geometry to be properly represented as a periodic structure [
4,
5] and mobile loading [
6].
Some studies assume studying train solicitation like repeated loading on simplified models [
7,
8,
9]. This method is efficient from a numerical point of view, as it simplifies the solicitation and reduces the model complexity. In tunneling applications, a similar philosophy is followed to represent progressive construction of the tunnel with “convergence–confinement” methods [
10]. In doing so, transportation infrastructure allows high numbers of cyclic loading at reduced computational costs. However, it does not properly represent specificities of mobile loading, particularly stress history considering magnitude and stress orientation, even though stress history has a huge influence on plastic strain development [
11,
12]. An illustration of the importance of proper mobile loading representation is shown in
Section 2.
Therefore, railway track structure behavior should be studied, considering the specificities of such structures and their loading. In the case of transportation infrastructure, we consider a linear structure with mobile loading solicitation. Linear structures are described as structures developed with large dimensions in one particular axis. Road, railways, and dams could be described as linear structures. In particular, we consider here s ballasted track that could be considered self-similar, i.e., any section of the track is equivalent regardless of its position in the structure. The second particularity of railway tracks is the moving of load solicitations. From the structure’s point of view, these solicitations are non-permanent and repeated loading, characterized by loading phases: approaching, passing, and moving away. This moving load imposes stress magnitude and orientation variation that should be taken into account for proper structure behavior studies.
The most common strategies to represent load displacement effect on structure is to compute the structure behavior under several successive positions of the load. Although there are different strategies available for representing these load movements, they all rely on the Lagrangian study framework, i.e., from the point of view of the structure, and could be called step-by-step algorithms. These methods are widely used to study problems that involve a moving load such as tunneling (for example, Hasanpour and l. (2014) [
13] or Bourgeois et al. (2025) [
14]) or lorry loading on road pavement (for example, Valsšková and Melcer (2018) [
15] or Deng and al. (2019) [
16]). In railway track studies, only step-by-step algorithms have been used to represent actual load movement on the model [
17,
18,
19,
20].
In order to study railway tracks’ non-linear behaviour under moving loads, we present innovative methods called steady-state algorithms. Instead of using a Lagrangian approach, that decomposes the load movement in steps, these algorithms use an Eulerian framework. The algorithm is based on the works of Nguyen and Rahimian (1981) [
21] and Dang Van et al. (1985) [
22] which describe the theoretical framework (see
Section 2.3.1) and first applications of this method. It has been used for various problems involving moving loads, such as the impact of rolling on rail heads (Maïtournam, 1989 [
23], Dang Van and Maïtournam, 1993 [
24]), beading (Ouakka, 1993 [
25]), interaction between rock and cutting tool (Geoffroy, 1996 [
26]), automotive brake disc (Nguyen-Tajan et al., 2002 [
27]), tunnelling (Corbetta, 1990 [
28], Maïolino,2006 [
29], Defay and al. (2020) [
30]). Later adaptations of the steady state algorithm also allow studying different cases with non-constant load or non-constant speed within this Eulerian framework. The TRC algorithm (
Transitoire dans le Repère de Chargement) developed by Nguyen-Tajan [
27] allows such particularities.
Transportation infrastructure, in particular railway tracks, remains unstudied with such computation process, while structural periodicity of these structures is an additional difficulty. An adapted periodic-steady-state algorithm, as been developed to address such specific study cases.
Processing with steady state algorithms reduces the computations to one single computation step, in comparison with the multiple computation steps needed by step-by-step algorithms. The process results then in an efficient and time saving way to compute plastic strains in linear structure under moving loads. This paper aims to prove applicability and efficiency of those algorithms for studding the non-linear behavior of railways track infrastructure in comparison with the classical step-by-stem algorithm.
In the the following section, we describe a classic step-by-step algorithm, and then two versions of the steady state algorithm. The first one allows the computation of plastic strain in a linear, non-periodic structure. The second one is adapted to compute plastic strains in a periodic structure, such as railways tracks.
In subsequent sections, we expose the efficiency of these steady-state algorithms, comparing results computed by step-by-step and steady-state algorithms on typical railway structures. Two example models are presented, including geometry, load, and materials behaviors. Then, the results are compared in terms of plastic strain amplitude, computation time, and stored data.
The study presented in this paper addresses a critical need for transportation infrastructure management, such as railways, and the long-term numerical modeling of these infrastructures. It proposes a methodological improvement applicable to further research aiming to accurately predict ballasted track settlement. By introducing innovative steady-state algorithms in the finite element modeling process for computing plastic strains in ballasted railway tracks under moving loads, we drastically cut computational cost for such applications, while addressing the particularities of mobile loading. These methods are applicable to non-periodic and periodic structures, like ballasted railway tracks, and tremendously improve computational performance in both cases. This computational progress allows for the development of accessible long-term modeling and predictable infrastructure management. Although the application is demonstrated here on railways tracks, it also opens up the usability of these methods for various other geotechnical structures, contributing to improving their safety and maintenance strategies.
2. Computation Process for Moving-Load Solicitations
This section aims to describe the various computation process studied and compared in this paper.
2.1. No Movement Process
As introduced earlier, many studies on ballasted track behavior represent the loading cycle with a load of variable amplitude, or are precomputed load case, applied on a reduced section of the structure in order to reduce computation complexity and time cost. We will call these processes “no movement processes”. While efficient from a time-consumption point of view, especially for a high number of loading cycles, such a process hides the specificities of a moving load, such as a rolling train on a railway. Indeed, load position influences both stress magnitude and stress orientation all over the structure. Schematically, such a loading cycle is shown in
Figure 2 and stress history is shown in
Figure 3a. Therefore, no movement processes can mimic stress magnitude variation but will hide the variation in stress orientation, as illustrated in
Figure 3b.
In order to illustrate the importance of considering stress rotation during loading cycles, we present in
Figure 4 a plastic strain mapping computed with a moving load and a varying load (no movement process), with all other parameters being equal. These results clearly show the discrepancies between both approaches and demonstrate the importance of representing the complexity of the loading cycle.
In order to obtain a correct numerical model of a moving-load influence, we can use step-by-step or steady-state processes, as explained in the following part.
For simplicity, in the rest of the paper, we suppose that the structure is an axial structure and the load moves downstream of the structure, i.e., the load speed is .
2.2. Step-by-Step Computation
As introduced previously, step-by-step algorithms describe the methods for studying the moving load problem by progressively displacing (or extending) the load on the structure while the structure remains unchanged. These methods rely on a Lagrangian framework, i.e., a study from the point of view of the structure.
Principles
Within this framework, the presented algorithm describes load movement using a set of successive load positions. During one loading cycle, the load starts for a position on one side of the model, and is then moved to the other side of the model, with multiple successive positions, as shown in
Figure 5. In doing so, the central part of the model can be considered representative of the structure after the loading cycle as it undergoes the full loading cycle from approaching the load to the load moving away. Therefore, the size of the model and the initial and final load positions should be chosen in order to keep this central part out of the load’s influence at the initial and final steps.
We define N computation steps corresponding to N successive positions of the load, describing its movement. For each step, the load position is defined by the abscissa from down to .
At each step
n, the plastic strain fields
are computed over the entire structure based on the plastic strain fields resulting from the previous step
. Therefore, plastic strain variation is computed at each individual Gauss point according to Equation (
1), where
is the stress tensor,
is the plastic potential function, and
is the plastic multiplicative factor. The overall process uses a classical return mapping algorithm, as described in
Appendix A.1.
The step-by-step method is very simple, but it needs to compute the plastic strain fields at each step. Moreover, improving the precision will lead to multiplying the number of computation steps, resulting in an increased computational time.
2.3. Steady-State Computation
Steady-state methods suppose switching the point of view. When studying the problems from the moving-load point of view, the structures are seen as flowing under the load, as shown in
Figure 6. Any element (green rectangle) in front of the load represents the initial state of the structures. It will be seen as moving under the load, deforming while undergoing the load cycle. This ends at a final state at the back of the load, accounting for possible irreversible deformation. The simplest method supposes that the structure is continuous and invariant along the
axis. It also supposes that load speed
and load magnitude are constant. Similar processes can be used on curved structures, assuming a constant radius.
Because of the invariant structure assumption, a system composed of the load and its direct environment will be self-similar no matter the instant t during the loading cycle. Therefore, by knowing the load movement and speed (), we can determine a relation between the relative position of the load to a track element in the structure and time gap in the loading phases. In other words, while moving the load at speed V during , the element at position X will be in the same relative position to the load, as well as in the same stress state as the element at position before the movement. Therefore, during the loading cycle, any element will follow the same stress path, which could be read along a line in the structure. The stress state of an element in front of the load is representative of the beginning of the loading cycle, while the stress state of an element at the back of the load is representative of the end of the loading cycle. In the end, a single computation should be representative of the whole movement.
To study plastic strain evolution during a loading cycle, we will study the elements’ state by virtually moving them along the structure, with a fixed load position in the middle of the structure.
A loading cycle is described as follows. At the beginning of the cycle, at time , the studied element is considered to be located at one end of the structure, in front of the load. During the cycle, this process virtually moves the studied element from the front to the back of the load. At the end of the loading cycle, the studied element is considered to be located at the other end of the structure, at the back of the load. It should be noted that the size of the structure should be carefully designed in order to keep both ends of the structure out of the load influences. This could be achieved with usual preliminary computation, ensuring no deformation at both model ends. For example, in the models presented in the following part, the structure is set to 15 m length.
2.3.1. Theoretical Framework
Assuming a tensorial quantity
, depending on time
t and particle position
, its time derivative
will be written as (
2). Assuming that particle position
is time-dependent, the quantity
is equal to the particle speed
.
In the particular case described here (
Section 2), we studied the structure from the point of view of a moving load, assuming structure self-similarity and constant speed. While load speed is described as
, the relative speed of the particle is then
. Also,
can be reduced to
. Finally, the self-similarity assumption induces an invariable environment from the load’s point of view; therefore,
could be eliminated from the equation. In the end, the time derivative
equation could be reduced to Equation (
3), in the described frame of study.
In a steady-state algorithm, we study plastic strain evolution, usually described using the classical flow rules, Equation (
4), which could be rewritten as Equation (
5) with this framework:
with
,
,
and
.
with
if
, and
otherwise.
is the stress function describing the elastic criterion.
2.3.2. Steady-State Computation Principle
Like every computational method, this one uses the discretization of stress history. The steady-state assumption induces that the stress history during the loading cycle can be described by following the stress state along lines parallel to the structure axis. To do so, the mesh is conveniently built with quadrilateral elements extruded along the structure axis, as presented in
Figure 7. Therefore, the Gauss points are lined up in the structure, forming parallel lines where Gauss points can be numbered from 1 to
L by increasing the abscissa.
Since we assume continuous yielding during the movement, we describe plastic strain evolution by following the Gauss point lines. In doing so, the plastic strain state on a Gauss point
represents the past situation of the plastic strain at point
n. Therefore, the computational process is based on the transfer of plastic strain from Gauss point
to the next
n, as described in Equation (
6) and shown in
Figure 8.
With if or otherwise.
Plastic strain computation is then conducted on each independent integration line. When the iterative process of the algorithm is over, the resulting state describes an ongoing loading cycle. In front of the load, the structure state corresponds to the beginning of the cycle. At the back of the load, it corresponds to the structure state at the end of the cycle. Following the evolution of the stress–strain state along the structure with an increasing abscissa allows us to describe the temporal evolution of the structure during the loading–unloading cycle.
The entire computation process can be summarized in the detailed algorithm presented in
Appendix A.2. This computation algorithm, being non-standard because of the particular integration process, has slightly higher complexity compared to classical step-by-step algorithms. In exchange, the computation of the entire loading cycle only requires the determination of one unique acceptable global plastic strain state, reducing the overall computation time.
2.4. Adaptation for Periodic Structure
The basic steady-state algorithm assumption requires an invariable structure along the axis, which limits the variety of structures applicable with the steady-state algorithm. Indeed, railway tracks exhibit a periodic structure due to rail–sleeper construction. Nevertheless, it is possible to use modified algorithms to compute such periodic structures. We call this version the periodic-steady-state algorithm.
Periodic Steady-State Computation Principle
While the self-similarity assumption is invalid in periodic structures, we suppose a structure composed of a P periodic section. We consider that it is long and corresponds to N Gauss points along the integration lines.
During a loading cycle, points n and will not have the same loading history due to their different structural positions within a periodic section. However, points n and will have the same loading history and same behavior with temporal shift. Therefore, the computation of the plastic strain at point can use the current strain state at point n.
As a drawback, during the computational process, the jump from Gauss point n to Gauss point is equivalent to the load moving by for a time step of . Therefore, the loading gap can be huge, and the stress path discretization may be insufficient to accurately describe plastic strain evolution. In order to enrich this time decomposition of the movement, we split time steps with T smaller steps . We then adopt an intermediate approach between the step-by-step and steady-state computations. This sub-decomposition of corresponds to a sub-decomposition of the movement with the T position of the load along a period .
As with the previous process, the plastic strain computation requires the immediate previous plastic strain state at each Gauss point and for each computation step. In the case of the computation of plastic strain at Gauss point
n and time
, the immediate previous plastic strain state is taken from point
n at time
, and in the case of the computation of plastic strain at Gauss point
n and time
, the immediate previous plastic strain state is taken from point
at time
(see Equation (
Section 2.4)). From a practical point of view, the computational process transfers plastic strain from point
n at time
t (
n,
t) to point
n at time
(
n,
), if
. Also, it transfers (
n,
T) to the corresponding point,
, in the next section of the structure at time
(
,1) (see
Figure 9).
Plastic strains are computed according to this process on each Gauss point line independently. Ultimately, this results in T different states that correspond to the ongoing loading cycle of the structure for each particular load position. Following the plastic strain along the structure provides an idea of the structure evolution during the loading cycle, but it provides a poor discretization. A complete description of the loading cycle can be obtained by combining the T results.
This computation algorithm is more complex than both of the previously presented algorithms because of its particular integration process. In turn, it allows us to model periodic structures in opposition to the simple steady-state computation. In contrast with the step-by-step algorithm, the computation of the entire loading cycle only needs T acceptable plastic strain states to be determined, which results in a reduced computation time.
The detailed computation algorithm is described in
Appendix A.3.
2.5. Multiple Loading Cycles
When computing multiple loading cycles, all algorithms use the same principle. A plastic strain state in a representative section of the structure is identified when the cycle computation ends. This state is then repeated in the entire structure as if the whole structure had undergone the same and full loading cycle.
For a step-by-step algorithm, the process describes a load movement that approaches, passes, and moves away from the central elements. Therefore, any central slice undergoes the full loading cycle and should be representative.
For a steady-state algorithm, the process moves the plastic strain state the from front side to the back side of the load. Therefore, a structure slice at the back end of the structure is in a plastic strain state representative of a completed loading cycle. For the following loading cycle, this representative strain state will be used as the initial plastic strain state of the steady-state algorithm, as illustrated in
Figure 10.
5. Discussion
The comparisons presented in the previous section are meaningful and highlight the accuracy of the steady-state methods compared to classical step-by-step approaches.
Given equal results, the efficiency of steady-state algorithms can be established by comparing the amount of stored data and the computation times.
Comparing the step-by-step and stead-state algorithms on a non-periodic structure gives meaningful results. The step-by-step algorithm yields 57 files, for a total of . The total amount of computation time needed is . For the same model and with the same computer resources, the steady-state algorithm yields only one file of and a total computation time of , equivalent to of the computation time needed by the step-by-step algorithm.
These results are logical according to the construction of each algorithm. The step-by-step algorithm consists of the complete determination of 57 different plastic strain states corresponding to the 57 load positions. For the steady-state algorithm, only one plastic strain state is determined. Despite the particular computation process of the steady-state algorithm, it almost corresponds to a single-step computation.
Comparing the step-by-step algorithm to the steady-state algorithm on periodic structure lead to a similar conclusion.
For this structure, the step-by-step algorithm uses 73 steps. This results in 73 saved files for a total of stored. The 73 computation steps are conducted with an average of 23 iterations each and a total computation time of . In contrast, the periodic steady-sate algorithm simultaneously computes six steps in 36 iterations. This results in six saved files for a total of stored and a total computation time of .
These numbers also show an impressive decrease in the computation time, reducing it to of its initial value. The computational time consumption is again almost linear to the number of computational step. However, for a periodic structure, the complexity of the computation process leads to an increase in computation time per step ratio. Such a decrease was not observed with the non-periodic structure.
In any case, both comparisons are meaningful. In both cases, step-by-step algorithms are much more expensive in terms of computation time than steady-state algorithms. With reasonable simulation parameters, steady-state algorithms are computationally quicker than step-by-step methods and allow storage space saving.
It should be noted that the presented steady-state algorithm and periodic steady-sate algorithm rely on restrictive assumption. The range of applicable structure is limited to self-similar, or periodical self-similar structures. Also, the presented versions of these algorithms limit the loading case to a mobile load at constant speed and constant magnitude. While the variety of cases studies is limited, it is perfectly suitable for the study of linear transportation infrastructure like railway tracks.
6. Conclusions
In conclusion, the numerical study of linear infrastructure requires particular consideration. The plastic strain computation is highly dependent on the stress–strain path description. Moreover, the mobile loading of such a linear structure induces a particular stress path, including variation in both stress magnitude and orientation. These particularities cannot be correctly modeled with a static load of variable amplitude. Consequently, the numerical modeling of railway tracks and mobile loads requires a specific process.
In this study, we present two types of computational algorithms that allow the representation of a moving load. The first one is a step-by-step algorithm. It describes the temporal evolution of the load position. Therefore, stress amplitude and orientation naturally evolve to properly describe the loading cycle. The other algorithms are steady-state algorithms. They aim to observe the loading cycle from the load’s point of view. The structures are then viewed as flowing under the load. The steady-state algorithms also use the self-similitude of the linear structure. Therefore, a particular computation process allows for artificial movement of the structural state under the load in order to compute the final plastic strain state within a single step. An adaptation for the periodic structures of the steady-state algorithm is also presented.
To demonstrate the efficiency of the steady-state algorithm, two elastic–plastic models of a railway are described: one periodic and one non-periodic. Each model represents half of a symmetrical longitudinal railway structure. A ten-tonnes load was used to represent half of the axle load. For this example, the ballast was modeled with a simple Drucker–Prager elastic–plastic model.
The comparison of steady-state and step-by-step results provides convincing results. For both periodic and non-periodic structures, the results are similar in terms of topology (plastic strain zones) and magnitude. In both cases, transversal and longitudinal plastic strain representations show identical results within numerical tolerance. In terms of efficiency, each algorithm demonstrates performance corresponding to its construction. The number of computational steps is the key parameter needed to save on computational time. For a non-periodic structure, computation time is directly proportional to the number of computation steps. The steady-state algorithm is then equivalent to a single computation step. For the periodic structure, the steady-state algorithm needs a computation time nearly proportional to the number of computation steps compared to the step-by-step algorithm.
Steady-state algorithms also reduce the amount of stored data. For non-periodic structure, as the single final result is enough to describe a full loading cycle by following the integration lines. The same information would be obtained with the step-by-step algorithm, but would require the results of all computation steps and proper data processing. This multiplies the amount of stored data and increases the complexity of interpreting the results.
Finally, the steady-state algorithms are extremely efficient in comparison to a classical algorithm. Without the degradation of results, these algorithms reduce the computation time by up to and generally scale linearly with the number of computational steps.
The results presented in this paper open new methodological possibilities for the study of the long-term behavior of transportation infrastructure, particularly railways tracks. Even when cutting computational costs, accurate behavior prediction under high number of loading cycles would still be possible within a reasonable amount of time. Further work should use the proposed improvements with advanced behavior models, taking into account material hardening, complex plastic phenomena, or material degradation, in order to obtain insight into ballasted track degradation.