Figures
Abstract
To address the multiple sources of uncertainty in railway emergency resource scheduling, this study uses interval numbers to characterize uncertainty in scheduling time, models resource demand as a fuzzy-random variable, and integrates fuzzy credibility constraints with interval programming within a unified optimization framework. Based on interval fuzzy credibility-constrained programming, an emergency resource scheduling model is developed to minimize both scheduling time and scheduling cost. Given the characteristics of the model constructed in this paper, an improved solution strategy based on the VEPSO algorithm is designed. By using the mean of existing feasible solutions to repair infeasible solutions generated during the optimization process, the proposed method ensures that all particles satisfy the constraints. This approach effectively addresses the complex and discontinuous Pareto front characteristics inherent in multi-objective programming involving multiple uncertain variables, enabling rapid search and selection of Pareto-optimal solutions. The results of the case study indicate that the VEPSO algorithm outperforms PSO, NSGA-II, VEGA, and MOEA/D in terms of convergence efficiency and solution quality. Its average number of convergence iterations is only 385, which is approximately 26.0% lower than that of MOEA/D, with an average runtime of 273 seconds, a convergence success rate of 93.3%, and a total demand fulfillment credibility of 0.983. By introducing a satisfaction evaluation method, this study quantifies the degree of alignment between resource allocation and actual demand under different confidence levels across various accident scenarios, revealing the distribution patterns by which both factors jointly determine resource satisfaction. This provides a quantitative basis for dynamically adjusting emergency resource scheduling strategies. Furthermore, a sensitivity analysis of resource demand was conducted at a fixed confidence level. The results indicate that when the demand scaling factor k increases from 1.0 to 1.2, the rate of change in total scheduling cost is 16.0529%, and the rate of change in total scheduling time is 50%. The model exhibits a stable and approximately linear response, indicating good robustness. This study provides quantifiable decision support for railway emergency resource scheduling in environments with multiple uncertainties, offering both theoretical value and practical significance.
Citation: Sun J, Wan Y, Lu G, Tang Z (2026) Research on railway emergency resource scheduling strategy under multiple uncertainty coupling. PLoS One 21(5): e0349372. https://doi.org/10.1371/journal.pone.0349372
Editor: Van Thanh Tien Nguyen, Industrial University of Ho Chi Minh City, VIET NAM
Received: September 6, 2025; Accepted: April 28, 2026; Published: May 19, 2026
Copyright: © 2026 Sun et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Data Availability: All relevant data are within the manuscript and its Supporting information files.
Funding: This study was supported by Social Science Fund of Jiangxi Province of China (No. 25GL14), Humanities and Social Science Fund of Ministry of Education of china: “Research on the Synergistic Mechanism and Realization Path of Digital Intelligence Empowering Railway Emergency Capability Reconstruction and Resilience Governance” (No. 24YJAZH132), Natural Science Foundation of Jiangxi Province: “Optimization Theory and Method for Emergency Resource Scheduling of Railway Large-scale Emergencies under Multiple Uncertainties” (No. 20242BAB26083). The Funders had no role in study design, data collection and analysis, decision topublish, or preparation of the manuscript.
Competing interests: The authors have declared that no competing interests exist.
1. Introduction
As China’s railway network continues to expand and train speeds continue to increase, both the likelihood and potential consequences of railway emergencies have grown, posing serious challenges to operational safety. Railway emergencies are often characterized by strong spatial and temporal urgency, in which emergency resource scheduling is central to emergency rescue command and decision-making, and is constrained by multiple departments, operational links, and influencing factors. Investigating emergency resource scheduling strategies under multiple uncertainties can help minimize accident-related losses, improve rescue efficiency, and enhance system robustness under fluctuating conditions.
Regarding emergency resource allocation, scholars both domestically and internationally have conducted extensive research. Existing studies can be broadly categorized into two main types based on model construction: deterministic models and models under uncertainty. For deterministic models, researchers have developed multi-objective optimization models targeting parameters such as time and cost under specific scenarios, including resource shortages [1], material damage [2], and dynamic processes [3]. These models are solved using intelligent optimization algorithms like the Deep Q-Network (DQN) algorithm [4] and an improved whale optimization algorithm [5–7]. Such studies provide crucial foundational models and solution approaches for emergency resource allocation. However, in real-world emergency scenarios, parameters such as incident conditions, resource demands, and transport times are typically subject to significant uncertainty, limiting the applicability of deterministic models.
To address this limitation, methods based on uncertainty theories—including stochastic programming, fuzzy programming, and interval programming—have been successively introduced. Liu [8] addressed the issue of uncertain dispatch times during emergency resource allocation across multiple centers and incident locations by introducing the concept of fuzzy control and establishing a fuzzy stochastic programming model based on fuzzy opportunity constraints. Hu et al. [9] examined uncertainty in resource demand during railway emergencies and proposed a multi-objective scheduling model that maximized scheduling fairness and minimized transportation cost. Tang et al. [10] investigated high-speed railway emergencies under uncertain resource demand. They applied a “scenario-response” approach to estimate demand at accident points and introduced the concept of a “soft time window”. Their model minimized the total cost consisting of overtime penalty, resource transportation, and fixed scheduling of rescue points. Tan et al. [11] considered both uncertain demand at accident points and uncertain incidents in highway emergencies. They established a multi-objective optimization model with the goals of minimizing scheduling time, scheduling cost, disaster-site loss, and dissatisfaction at potential disaster locations. Li et al. [12] studied emergency resource scheduling for offshore oil spills. Considering the uncertainty of demand at spill and drift points, they adopted a robust optimization approach to construct a bi-objective model that minimized rescue cost and response time. Wang et al. [13] introduced interval numbers and triangular fuzzy numbers to describe uncertainties in resource demand, transportation time, and maximum transport capacity. They developed an emergency scheduling model under uncertain disaster information, focusing on both efficiency and fairness. Zhang [14] addressed the uncertainties and multi-stage nature of oil spill evolution in the dynamic allocation of emergency resources for major marine oil spills by constructing a three-stage fuzzy stochastic programming-based emergency resource allocation model. Li et al. [15] addressed the multi-objective optimization problem in emergency resource allocation for public health emergencies. By constructing an uncertain multi-objective programming model and employing a hierarchical sequential method for solution, they derived candidate optimal allocation schemes for emergency resources.
A comparative analysis of the aforementioned literature reveals that, although uncertainty optimization methods have been widely applied in the field of emergency resource scheduling, most existing studies focus on addressing a single type of uncertainty or, at most, a simple combination of two uncertainties. However, railway emergency resource scheduling systems typically involve multiple uncertainty factors—such as fuzziness, randomness, and interval uncertainty—concurrently. Ignoring the coupled effects of these uncertainties makes it difficult to comprehensively and accurately characterize the actual scheduling process. Furthermore, although fuzzy-stochastic programming has been attempted for such problems, it remains limited in the highly complex and incomplete context of railway emergency scenarios. Specifically, it requires the probability distributions or membership functions of uncertain parameters to be known in advance—a condition that is difficult to satisfy in the early stages of an emergency. Additionally, it tends to treat uncertainties from different sources homogeneously, making it difficult to capture their essential differences and failing to effectively incorporate decision-makers’ varying risk tolerances for different emergency objectives.
Addressing the limitations of existing research—which is largely confined to single or double uncertainty—and the shortcomings of fuzzy stochastic programming in handling complex and incomplete scenarios, this paper innovatively considers the synergistic effects of three types of uncertainty: fuzzy, interval, and stochastic. It constructs a multidimensional coupled decision-making environment that integrates scenario stochasticity, demand fuzziness, and temporal intervality, thereby overcoming the limitations of traditional models that simplify uncertainty to single or double dimensions; By integrating fuzzy credibility constraints and interval programming into a unified framework, this study pioneers a hierarchical uncertainty structure. This structure preserves interval characteristics externally while embedding fuzzy risks internally, achieving a synergistic representation where “heterogeneous uncertainties coexist without mixing,” thereby fundamentally avoiding distortion issues caused by the mixing of parameters of different natures; based on this, an improved vector-evaluated particle swarm algorithm was developed to address the multi-objective and nonlinear characteristics of the constructed model, capable of efficiently generating Pareto-optimal scheduling schemes that match different risk preferences.
The subsequent chapters of this paper are structured as follows:
Chapter 2 conducts an in-depth characterization and coupling analysis of multiple uncertainties in railway emergency resource scheduling. Chapter 3 builds upon Chapter 2 to construct an optimization model for railway emergency resource scheduling under multiple uncertainties. A fuzzy credibility constraint programming model is established and further extended into a more general interval fuzzy credibility constraint programming model.
Chapter 4 designs an improved solution strategy based on the VEPSO algorithm to address the solution requirements of the constructed model, effectively obtaining the Pareto optimal solution set for the problem.
Chapter 5 conducts validation and analysis through case studies, examining scheduling outcomes under varying confidence levels. Additionally, this chapter includes algorithm comparison experiments and sensitivity analysis of uncertain parameters to comprehensively validate the effectiveness and superiority of the proposed model and algorithm.
Chapter 6 concludes the study by summarizing the research work and key findings, while outlining future research directions.
2. Characterization and coupling of uncertainties
In the process of railway emergency resource dispatch, various uncertainties do not exist independently. Instead, they interact through different pathways within the same decision-making process, jointly influencing dispatch outcomes. Key elements such as scheduling time, emergency resource demand at incident locations, and incident scenarios all exhibit distinct forms of uncertainty. Their interplay results in the emergency resource dispatch problem being characterized by a distinct interweaving and coupling of multiple uncertainties.
This paper employs interval numbers to characterize the uncertainty of scheduling time, depicting the fluctuation range of transportation response times under varying operational conditions. The uncertainty of resource demand at the accident site is described using fuzzy random parameters. Its randomness stems from the unpredictability of incident scenarios, while the fuzziness of demand under a given scenario reflects the subjectivity and information incompleteness inherent in emergency resource assessment.
This study couples multiple uncertainties rather than treating them as mutually independent. They are simultaneously introduced into the model through a unified decision variable system, where they interact. The uncertainty of incident scenarios does not enter the scheduling model as independent parameters. Instead, it influences the range and membership structure of resource demand values at incident points, altering their fuzzy representation. This creates an evolutionary process where randomness and fuzziness are mutually nested. Furthermore, resource demand uncertainty participates in model construction through fuzzy credibility constraints, interacting with the interval uncertainty of dispatch timing within the same optimization framework to jointly influence dispatch decision outcomes. Consequently, the feasibility and quality of dispatch schemes depend not only on the values of individual uncertain parameters but are collectively determined by the combined effects of multiple uncertainties under the same constraints, thereby revealing the coupling characteristics among these uncertainties.
2.1. Uncertainty in emergency resource scheduling time
Emergency resource scheduling time refers to the maximum amount of time it takes to deliver rescue resources from the rescue point to the accident point. The operating time from the rescue point to the accident point is uncertain due to the influence of uncertain factors such as the response efficiency of the rescue point’s dispatch, the weather, the operating status of the line, and the impact of damage to the line caused by emergencies. To represent emergency resource scheduling time in an objective and realistic manner, interval numbers are used to describe the possible range of arrival times.
The road network is abstracted as an undirected weighted graph , and the existing rescue bases, stations and accident points are selected as the vertices of the network, the arcs of the road network are the lines connecting them, and their weights are the time spent by the rescue trains running on the arcs.
.
is the set of all possible paths between any two points
and
,
, and the traveling time via the path
is denoted as an interval number
considering the uncertainty of time, where
and
are the lower bound (optimistic state) and the upper bound (pessimistic state) of the traveling time of the rescue train via the path
, respectively.
2.2. Uncertainty in resource demand at the accident point
Due to the uncertainty of the location of the emergency, the scale of the accident and the level of the emergency, it is difficult for the decision makers to accurately judge and predict the demand for emergency resources for each accident point, which is somewhat ambiguous. In addition, the scenarios of emergencies will also affect the demand for resources at the accident points, showing a certain degree of randomness. Therefore, the emergency resource demand has fuzzy-random double uncertainty, and its intertwined and coupled mechanism is as follows.
2.2.1. Fuzzy characterization of emergency resource demand.
Considering that if the demand is too small, there will be insufficient rescue, and if the demand is too large, there will be waste or occupation of resources, trapezoidal fuzzy number is introduced to characterize the uncertainty of resource demand. The trapezoidal fuzzy number represents the fuzzy demand for the
resource at an accident point, where
is the minimum demand,
is the smaller value of the most likely demand,
is the larger value of the most likely demand, and
is the maximum demand. As shown in Fig 1, when
, the satisfaction value is
, this time the function is a monotonically increasing function; when
, satisfaction is 1; when
, satisfaction takes the value of
, this time the function is a monotonically decreasing function. The uncertainty associated with set membership is characterized by the satisfaction degree. If the quantity of the kth type of resource received at the accident site is
, the corresponding fuzzy satisfaction degree is
, as shown in Fig 1.
2.2.2. Stochastic characterization of emergency scenarios.
Due to the complexity and variety of emergency types, the severity of damage at accident point and the spreading trend of disaster all show randomness, each accident point has independent and limited scenarios. Set all scenarios of an emergency event as a set , extract all the characteristic information in its life cycle, and according to the attributes and characteristics of the information content, classify the information into the event classification set
, the event severity grading
, and the disaster spreading tendency staging set
, of which
,
and
are the number of extracted information of classification, grading, and staging characteristics in the scenario set
, respectively. Then, the scenario set of emergencies is
, where
is the number of classified and staged feature information extracted from the scenario set. Let
be any scenario point in the scenario set
, then
, where
,
,
.
In order to reasonably measure the stochasticity of resource demand at an accident point under different scenario levels, the likelihood of a stochastic scenario occurring can be characterized in the form of discrete probabilities, as shown in Fig 2. This figure illustrates the distribution of occurrence probability levels under different emergency incident scenarios. By abstracting all possible emergency incident scenarios into a discrete scenario set and assigning a corresponding occurrence probability to each scenario, the stochastic characteristics at the scenario level can be effectively characterized. The horizontal axis represents the accident scenario index , while the vertical axis denotes the corresponding scenario occurrence probability level
. The height of each bar reflects the relative likelihood of occurrence for each accident scenario. Differences in bar heights indicate the probability weights of different scenarios within the overall set of accident scenarios, and satisfy
.
2.2.3. Fuzzy-stochastic coupling of emergency resource demands.
In addition to the fuzzy nature, the resource demand of each accident point is also affected by the randomness of the emergency scenarios, showing certain random fluctuation characteristics. This kind of randomness and fuzziness penetrate into each other, coupled with each other, resulting in the uncertainty of the resource demand at the accident point is no longer reflected in a single randomness or fuzziness, but presents a fuzzy-stochastic double uncertainty.
In order to describe this phenomenon of simultaneous existence of fuzziness and randomness, the fuzzy sets whose values are taken as random quantities are portrayed, and the emergency scenarios are divided into Scenario 1, Scenario 2, …, and Scenario , so as to characterize the unpredictable dynamic properties of the emergency scenarios. The trapezoidal fuzzy numbers are used to describe the range of values when the emergency resource demand is at different scenario levels, and the discrete probability form is used to characterize the possibility size of each random scenario. The coupling process between fuzziness and randomness in emergency resource demand at incident sites is illustrated in Fig 3. Accidents are categorized into discrete scenarios
based on incident type, severity, and disaster propagation trends, with scenario probabilities describing their random characteristics. Under each incident scenario, resource demand at the incident site is characterized using fuzzy numbers due to incomplete information and subjective assessments. Thus, resource demand exhibits randomness at the scenario level and fuzziness within individual scenarios. Their combined effect forms a fuzzy-random demand structure. This coupling process demonstrates that the uncertainty of resource demand at the incident site cannot be described independently by a single random variable or fuzzy variable. Instead, it requires simultaneous consideration of scenario randomness and demand fuzziness within a unified framework.
According to Fig 3, it can be seen that under the random demand scenario, the satisfaction function of the accident point for the quantity of resource scheduling can be expressed as:
In the formula, and
are the quantity of the
resource and its satisfaction level under the scenario point
, respectively. Through this formula, the fuzzy resource demand at the accident point under different probability levels of emergency scenarios can be characterized as a fuzzy random variable, which realizes the measurable mapping from the probability space to the set composed of fuzzy variables.
While fuzzy random variables can more accurately describe the uncertainty of resource demand, it also increases the computational difficulty of problem solving to a certain extent, therefore, using the method in the literature [16–17], the fuzzy random variable is first transformed into a trapezoidal fuzzy number during the solution process, and the computation using the fuzzy number expectation will be more efficient, and the transformation process is shown in Fig 4,
The expectation of the fuzzy number can be obtained as:
Figure 4 illustrates the schematic process of transforming fuzzy-random emergency resource demand into a trapezoidal fuzzy number.
It should be noted that the trapezoidal treatment of the fuzzy-random variables corresponding to Eqs. (2)–(4) is an approximately equivalent transformation for optimization purposes, rather than a lossless reconstruction of the original fuzzy-random process. This transformation preserves the main characteristics of resource demand under different accident scenarios in terms of location, core interval, and overall spread, thereby allowing the aggregated demand to participate in subsequent credibility-constrained modeling in the form of a trapezoidal fuzzy number. At the same time, however, finer-grained differences in discrete structures across scenarios, tail asymmetry, and higher-order distributional information are compressed during the aggregation process. Since the subsequent optimization model in this study mainly relies on the interval boundaries and credibility measure of fuzzy demand to determine the feasible region, rather than on higher-order statistical features of the original scenario distribution for inference, this approximate treatment can substantially reduce the computational complexity of the model while ensuring decision-making effectiveness, thereby achieving a balance between modeling accuracy and computational efficiency.
To analyze the effect of this approximation on the model results, let the original fuzzy-random variable be denoted by , and let its trapezoidal fuzzy approximation be denoted by
. The deviation between the two in terms of credibility can be expressed as follows:
In practical applications, since trapezoidal fuzzy numbers can effectively characterize the value range of a variable and its core distribution region, the aforementioned bias typically remains within an acceptable range when the membership functions of the original fuzzy random variables vary smoothly. Furthermore, the model in this paper primarily focuses on the relative merits of scheduling schemes under uncertain conditions rather than the precise characterization of individual parameters; thus, the impact of this approximation on the final decision results is limited. Therefore, converting fuzzy random variables into trapezoidal fuzzy numbers ensures the solvability of the model while striking a reasonable balance between computational complexity and expressive accuracy.
2.2.4. Lemma on coupling and the fundamental theorem of non-decomposability of couplings.
1) Lemma on Coupling
Lemma 1: Let be a stochastic scenario,
be a fuzzy demand, and
be an interval of time. Suppose there exists a decision variable
such that:
This indicates that there is a coupling between and
. Actual data from railway emergency dispatching verify that this partial derivative is non-zero, confirming the existence of an intrinsic coupling.
2) Core Theorem on the Indecomposability of the Coupling
Theorem 1: For an objective function of the form , the following operations are not commutative:
Proof: Let ,
,
.Then:
Therefore, the two sides are not equal, which completes the proof. This counterexample directly demonstrates that scenario randomness and demand uncertainty must be modeled in a nested manner rather than as independent variables added together; this is the fundamental basis for the construction of an optimization model for railway emergency resource scheduling under multiple uncertainties, distinguishing it from traditional methods.
3. Optimization model construction of railway emergency resource scheduling under multiple uncertainties
3.1. Problem description
When an unexpected accident occurs in a region of the road network, it is often necessary to quickly deploy emergency resources from multiple rescue bases to meet the needs of the accident, i.e., to formulate corresponding resource scheduling programs in different emergency rescue bases. The types and quantities of emergency resources reserved by each rescue base vary according to the importance of the nodes in the network where they are located, and the cost of emergency rescue scheduling mainly includes the basic cost of emergency response of rescue bases and the cost of resource scheduling. Assuming that an unexpected accident occurs at in a certain area of the railway network, it can be rescued by
rescue bases
, and for the
type of emergency resources, the reserve quantity of the rescue base
is
. When an accident point makes a rescue request, the decision maker, under the influence of multiple uncertainties of the emergency event, how to determine the type and quantity of resources to be dispatched from each rescue point, so that the scheduling plan can take into account the fairness and efficiency, and realize the goal of minimizing the scheduling cost and the shortest scheduling time.
3.2 Definition of relevant symbols and variables and model assumptions
3.2.1 Definition of relevant symbols and variables.
represents the actual scheduling quantity of the kth resource transported from rescue base
to accident point
. The demand for the kth resource at accident point
is represented by the fuzzy-random parameter
. The resource scheduling time from rescue base
to accident point
is represented by the interval parameter
. At the same time, introduce the 0–1 variable,
indicates that the rescue base
provided at least one emergency resource to the accident point
, and
indicates that no resources were provided.
represents the credibility confidence level;
represents the transportation distance from each rescue base to the accident point.
represents the transportation cost per unit mileage, and
is the basic start-up cost of rescue base
.
3.2.2 Model assumptions.
In the initial stage of emergency response, to improve computational efficiency and highlight key resource scheduling decisions, it is assumed that each rescue train performs only one transport task within a single scheduling period. In actual operations, however, a train may complete multiple transport tasks through multiple rounds of scheduling. Therefore, this assumption is mainly applicable to the rapid deployment of resources during the initial emergency stage. At this stage, the primary objectives of decision-making are to shorten response time and achieve the rapid delivery of emergency resources. Accordingly, the model focuses on capturing the effects of multi-source uncertainties on scheduling decisions, while more complex situations involving multi-round scheduling and detailed loading and unloading operations are beyond the scope of this study.
With regard to the composition of scheduling time, this study mainly focuses on the uncertain impact of transport time. As for loading and unloading time, in railway emergency rescue scenarios, transport distance and line conditions are usually the dominant factors affecting scheduling efficiency, whereas loading and unloading time is relatively stable and accounts for only a limited proportion compared with transport time. To avoid excessive expansion of the model dimension, loading and unloading time is equivalently incorporated into the interval-valued transport time parameter for integrated representation. In this way, the solvability of the model can be maintained without altering the structure of multiple uncertainties. The specific assumptions are as follows:
- 1) The amount of rescue resources stored at each emergency rescue base
is known as
.
- 2) Each rescue train is assumed to perform one transport task in each scheduling period, with loading and unloading time equivalently incorporated into transport time. Accordingly, emergency resource scheduling time is defined as comprising response time and transport time, while the specific rescue operation time is not considered.
- 3) The geographic locations of the emergency rescue bases and the point of emergencies are known;
- 4) The base startup cost of each emergency rescue base is known.
3.3. Fuzzy credibility constraint programming model
For the optimization problem in which the constraint coefficients have fuzzy characteristics and are represented by the possibility distribution, the fuzzy credibility constrained programming (FCCP) method can allow the decision to meet the constraints to a certain extent, i.e., the credibility of the establishment of fuzzy constraints is greater than the pre-defined confidence level, whose expression is shown in Eq. (10).
In the formula, is the decision variable,
is the profit coefficient,
is the technical coefficient, and
is the fuzzy coefficient.
is the credibility measure, and
is the credibility confidence level.
Let be the fuzzy variable of membership function
, and
be a real number. The credibility measure is defined as follows:
Due to and
, the reliable measure can be transformed into:
Similar to the probability measure can be obtained:
The trapezoidal fuzzy set is chosen to characterize the fuzzy variables, and
, whose affiliation function is:
and the plausibility measure expression of
is:
Generally, the confidence level of plausibility should be greater than 0.5, so based on the above definition of plausibility, according to the derivation of the literature [18], it can be seen that and
can be rewritten as:
Substituting this into the model, the fuzzy planning problem can be transformed into the following equivalent form:
3.4. Constructing an interval fuzzy credibility constrained programming model for railway emergency resource scheduling
The above method can effectively deal with the fuzzy uncertainty of the right side of the model constraints, and the other parameters are deterministic parameters. However, in the actual railway emergency rescue scheduling process there are also parameters such as emergency resource scheduling time that are expressed as interval numbers, and interval parameter planning can effectively deal with the uncertainty parameters characterized by interval numbers. This paper combines Eq. (19), innovatively integrates the interval planning model into the fuzzy credibility-constrained programming method, and constructs the interval fuzzy credibility constrained programming model (Interval Fuzzy Credibility-Constrained Programming, IFCCP), as shown in Eq. (20).
Where “-” and “+” denote the upper and lower bounds of the interval parameters, respectively.
Theorem 2: The Reduction Relationship Between IFCCP and Traditional Models
Proof:
- (1). When the time interval is reduced to a fixed value, IFCCP reduces to fuzzy credibility constraint programming;
- (2). When the fuzzy demand is reduced to a deterministic distribution, IFCCP reduces to interval programming;
Conversely, however, existing models cannot express IFCCP equivalently without introducing additional assumptions. This indicates that IFCCP is a generalized, non-trivial extension of the two aforementioned model classes, rather than a simple combination.
From a theoretical perspective, the IFCCP model represents a significant breakthrough over traditional fuzzy stochastic programming and interval programming models. First, there is a fundamental shift in modeling logic: IFCCP no longer attempts to convert intervals into fuzzy numbers or simplify fuzzy numbers into intervals, but instead constructs a hierarchical uncertainty structure—the outer layer retains the time-varying domain of interval parameters to avoid homogenization distortion of time parameters; the inner layer utilizes fuzzy credibility constraints to handle demand fluctuations under stochastic scenarios. This modeling approach, in which different types of uncertainty coexist without mixing, achieves a fundamental logical leap from “single-dimensional approximation”to“multi-dimensional coupled fidelity,” representing a structural innovation not found in existing methods. Second, the theoretical basis for its irreplaceability: In scenarios characterized by the triple coupling of “scenario randomness, demand fuzziness, and temporal intervality,” the sole use of fuzzy stochastic programming or interval programming inevitably leads to two types of systematic biases: one arising from approximating intervals as fuzzy numbers, and the other from simplifying fuzzy demands into intervals. For example, treating the interval parameter of rescue time as a triangular fuzzy number would render the interpretation of time-window constraint satisfaction invalid; conversely, simplifying fuzzy demands under random scenarios into intervals would result in the loss of probability weight information across different scenarios, causing high-risk, low-probability scenarios to be treated equally with low-risk, high-probability scenarios—a situation that contradicts the practical requirements of risk grading in railway emergency rescue.
In summary, the IFCCP model is currently one of the few modeling frameworks capable of simultaneously avoiding both types of bias. The IFCCP model possesses a rigorous theoretical advantage only when a problem exhibits all three characteristics: “discrete randomness of scenarios, cognitive fuzziness of requirements, and interval nature of time parameters.”
Combining the IFCCP method, considering the multiple uncertainty factors in the process of railway emergency rescue, and taking the shortest emergency rescue time and the lowest emergency rescue scheduling cost as the optimization objectives, the optimization model of railway emergency resource schedule under multiple uncertainties is established as Eqs. (21)–(29).
In the model: Eq. (21) is the objective function of the shortest emergency rescue time. Eq. (22) is the objective function of the minimum emergency rescue scheduling cost. Eq. (23) indicates that the total amount of emergency resources actually transported to the accident point by the rescuing point is not less than the fuzzy constraints of the demand of the accident point. Eq. (24) indicates that the total amount of resources provided by the rescuing point does not exceed the amount of its own storage of the resources. Eq. (25) indicates that it is guaranteed that each accident point has at least one out rescue point to provide rescue for it. Eq. (26) is a 0–1 integer constraint. Eqs. (27) and (28) are non-negative constraints. and Eq. (29) denotes that the amount of resource scheduling is rounded.
Among them, linear weighting can be utilized to deal with the interval parameters in the objective function (21), as shown in Eq. (30).
In Eq. (23), is the confidence level of plausibility, and the constraints of the confidence level in the model are the resource demand quantity constraints for the accident point. When deals with simple problems, the macro decision-making can be based on the needs of decision makers to consider converting the constraints to the resource demand constraints corresponding to the accident point, and then relax the constraints to obtain a more relaxed decision-making program. The significance of confidence level in the model is shown in Table 1.
In summary, by coupling interval parameters with credibility constraints, the IFCCP model achieves a hierarchical characterization and unified representation of multi-source heterogeneous uncertainty. This approach not only avoids the loss of information resulting from the homogenization of uncertainty in traditional methods but also improves the accuracy of modeling complex emergency decision-making problems while maintaining the model’s solvability.
4. VEPSO algorithm design
For multi-objective optimization problems, traditional methods commonly adopt the weighted sum approach, in which multiple objectives are combined linearly through predefined weight coefficients, thereby transforming the problem into a single-objective optimization task. However, this method has notable limitations: the choice of weight coefficients heavily affects the results, and the single-objective optimization process often yields only local optima. Without sufficient prior knowledge, it is difficult to effectively evaluate the optimality of the solutions.
The Vector Evaluated Particle Swarm Optimization (VEPSO) algorithm [19] is a swarm intelligence-based iterative approach inspired by the concept and main ideas of the VEGA algorithm. As a co-evolutionary technique, it updates particle velocity and position iteratively to search for optimal solutions, thereby reducing the negative impact of weight settings on optimization results. The core idea of VEPSO is to divide the population into equally sized subgroups according to the number of objective functions. Each subgroup optimizes a single objective independently, while information exchange and mutual influence are realized through velocity updates of particles across subgroups [20].
However, since the model in this paper incorporates both interval uncertainty constraints and fuzzy credibility constraints, and the decision variables exhibit a mixed discrete-continuous nature, conventional VEPSO struggles to be directly applied in particle encoding, constraint handling, and feasibility checking. This may generate invalid solutions during the search process. Therefore, while retaining the multi-subpopulation cooperative search framework of VEPSO, this paper appropriately modifies its constraint handling mechanism to address the structural characteristics of the model’s constraints, thereby constructing a solution strategy suitable for the multi-uncertainty coupled scheduling model. Due to the presence of constraint (23), a dynamic repair strategy guided by feasible solutions is designed and integrated to address the complex feasible domain formed by fuzzy credibility constraints and interval constraints in the model. The core operation of this strategy is as follows: After each generation completes its iteration, the algorithm identifies all particles violating the fuzzy credibility constraints. Based on the positional statistics of feasible solutions within the current population, it applies a directed adjustment to the violating solutions using the average value of existing feasible solutions, enabling them to rapidly return to the feasible region. This repair process is adaptive and iterative. Assuming the first h particles in the swarm satisfy the constraints, if the h+1th member fails to meet the constraints, then:
Where represents the current value of the
th particle in the swarm.
is the repair value.
is the average value of the
th feasible solutions. Repeat the repair process until the
th particle satisfies all the constraints. After the repair process, all the individual particles satisfy the constraints.
Under conditions of multiple coupled uncertainties and constraints, the feasible region of a scheduling problem exhibits nonlinear and contracting characteristics. If traditional penalty function methods are used to handle infeasible solutions, particles may oscillate near the boundary of the feasible region, or the search direction may deviate due to improper setting of the penalty factor, thereby reducing convergence
efficiency. The recovery strategy based on the mean of feasible solutions proposed in this paper can essentially be regarded as a statistical centering mechanism. When a particle generates an infeasible solution after updating, it is adjusted by using the mean vector of the current population’s feasible solutions as a reference point, thereby moving it toward the interior of the feasible region. Let the current set of feasible solutions be , and its mean vector be:
When particle does not satisfy the constraints, Eq. (33) is used to contract the repaired solution toward the statistical center of the feasible region.
The repair strategy based on the mean of feasible solutions employs a convex combination mechanism to perform a contraction mapping on infeasible solutions. This approach reduces constraint violations while enhancing search stability, and avoids the parameter sensitivity issues associated with penalty function methods as well as the boundary effects of traditional repair operators, thereby demonstrating superior overall performance in complex constrained optimization problems.
The velocity and position update equations are as follows:
In the formula, denotes the current iteration number.
denotes the flight speed of particle
.
denotes the position of particle
.
denotes the individual optimal value.
denotes the global optimal value.
denotes the inertia weight coefficients.
and
denote the acceleration factors. And
is the random number that obeys the uniform distribution between
.
For multi-objective optimization problems, the algorithm first divides the population into multiple subgroups, where particles in each subgroup represent a set of relatively good solutions for the corresponding objective. The new generation of particles is generated by merging particles from all subgroups and selecting evolutionary individuals. Particle movement is influenced by the social interaction with particles from other subgroups, guiding them toward directions that simultaneously optimize more objectives. Ultimately, the algorithm converges to the optimal solution [21].
Taking the bi-objective optimization problem as an example, the implementation process of the algorithm is as follows:
Step 1 Set the size of the particle swarm , the dimension
, the maximum number of iterations
, the inertia weight
and the acceleration factors
and
.
Step 2 Generate the initial particles by randomly generating a particle swarm of size in the feasible domain of decision variables. Determine whether the constraints are satisfied, if so, continue to Step 3. If not, repair the infeasible solution.
Step 3 Evaluate all the particles in the particle cluster using the individual evaluation method of the single-objective optimization function, and form two sub-populations based on this: calculate the fitness values of all the particles based on the objective function , and select
better particles from them to form sub-particle cluster 1. Similarly, calculate the fitness values of all the particles based on the objective function
, and select
better particles from them to form sub-particle cluster 2.
Step 4 Determine the individual optimal value based on the fitness values, and determine the best particles in particle cluster 1 and particle cluster 2 respectively, which will be used as the social sharing information in the whole particle cluster.
Step 5 For the particles in different sub-particle clusters, all of them use the social shared information from other particle clusters to adjust their flight speeds, when calculating the flight speeds of all particles in sub-particle cluster 1, the best particle information in sub-particle cluster 2 is used as the global best position Gbest1 obtained by each of the particles. Similarly, when calculating the flight speeds of all particles in sub-particle cluster 2, the best particle information in sub-particle cluster 1 is used as its best position Gbest2 obtained by each of the particles. and update the particle position and velocity information according to Eq. (34), recombine all the particles after updating to form a new particle swarm, and repair infeasible solutions in the swarm
Step 6 Repeat Steps 3–5 until the termination condition (reaching the set accuracy or number of operations) is satisfied, and select a set of optimal solutions from the 2 sub-particle swarms to constitute the optimal solution set, which is output as the optimization result. The algorithm then terminates.
The basic framework of the algorithm is shown in Fig 5.
5. Empirical analysis
5.1. Problem description
China Railway Nanchang Bureau Group Corporation (hereinafter referred to as Nanchang Bureau) is a subsidiary company of China Railway Corporation in East China. Nanchang Bureau mainly operates railway transportation and its related industries in all of Jiangxi and Fujian Provinces and part of Hunan and Hubei Provinces, occupying an extremely important position in the “eight vertical and eight horizontal” road network skeleton of the national railway. In order to cope with railway emergencies and ensure smooth railway transportation, Nanchang Bureau has established 14 rescue bases under its jurisdiction, which are respectively set up in Shangrao, Jiujiang, Yingtan, Pingxiang, Laizhou, Jingdezhen, Ganzhou, Xinyu, Fuzhou, Shaowu, Yongan, Xiamen, Xiangtang, Zhangping, and each of the bases is configured with a rescue train and related rescue materials. Assuming that a natural disaster occurs between Zixi Railway Station and Guangze Railway Station in the area under the jurisdiction of Nanchang Bureau due to the influence of bad weather, the facilities along the line are seriously damaged, and the cars of the passing trains are damaged, with different degrees of casualties and losses, according to the principle of proximity, rescue work can be carried out by the three rescue bases in the vicinity of Shangrao
, Laizhou
, and Xiangtang
, and the emergency response resources are based on the line repairing equipment (e.g., steel rails, sleepers, etc.)
, Medical rescue equipment (e.g., medical supplies, disinfection supplies, etc.)
and railway recovery equipment (e.g., rigging, spreaders, etc.)
as examples for scheduling.
5.2. Definition of deterministic and uncertainty variables
According to the degree of impact of the accident on the personal safety situation, the number of direct economic losses, the number of passenger and freight trains derailed, and the interruption of the busy route travel time, etc., the level of sudden accidents on the railway can be classified into four different levels: especially major accidents, major accidents, relatively major accidents, and general accidents. Since the first time of the sudden accident scenario level cannot be determined, it is assumed that the probability of the appearance of each scenario is 0.1, 0.2, 0.3 and 0.4 respectively. The emergency rescue scheduling time is mainly related to the distance from the emergency rescue base to the accident point , the transportation speed
as well as the response time, and this paper uses the average speed of the rescue on the way to
for the measurement. Table 2 shows the reserve quantity of emergency resources of each rescue base
, and the information between each rescue base and the accident point is shown in Table 3, which includes the transportation distance between each rescue base and the accident point
, transportation time
, unit transportation cost of emergency resources
and start-up base cost of each rescue base
, where the transportation time is the number of intervals.
Due to the difficulty emergency responders face in promptly and accurately obtaining critical information, such as the affected area, casualties, and on-site conditions, during the initial stages of sudden incidents, the demand for various emergency resources at the incident site exhibits significant uncertainty. Based on the analysis in Section 2.2, this paper employs fuzzy-random variables to characterize the emergency resource requirements at the incident site.
Regarding the determination of fuzzy parameters, the emergency resource demand adopted in this study is estimated using fuzzy estimation based on historical incident data. The data construction method draws from the application of Case-Based Reasoning to railway emergency resource demand forecasting, as previously described in [22]. This approach analyzes key attribute features of historical accident cases, such as accident type, severity level, impact scope, and environmental conditions, and calculates their structural similarity to the target accident scenario to identify relevant historical precedents. Based on this, the reasonable range of demand values for various emergency resources at the accident site is determined according to the actual usage of corresponding resources in similar cases. These values are further converted into fuzzy number parameters to characterize the uncertainty level of resource demand under a given accident scenario. The central value of the fuzzy number is determined by the weighted average of demand quantities from similar cases. Upper and lower bounds are reasonably adjusted based on the discrete characteristics of historical cases and guidance from relevant domain experts, thereby constructing a fuzzy demand description that better aligns with real-world conditions. Furthermore, Eqs. (2) to (4) are used to calculate the fuzzy expected values for the demand quantities of various emergency resources at the accident site, with the results shown in Table 4.
5.3. Algorithm Solution
To validate the model’s effectiveness and the robustness of the scheduling schemes, this paper introduces the key parameter , representing the confidence level, into the solution process. The value of
directly reflects the decision-maker’s risk attitude when dealing with uncertainty. A higher value of
(e.g.,
) indicates that the decision-maker tends to be conservative, requiring the scheduling scheme to maintain extremely high feasibility even under extremely adverse conditions; while the results are undoubtedly robust, they are typically accompanied by higher contingency costs. Conversely, a lower value of
(e.g.,
) indicates that the decision-maker is willing to seek solutions that are more optimal in terms of cost and time within an acceptable risk range, which is more aligned with rescue scenarios characterized by resource constraints or strict time constraints.
Following common parameter settings in fuzzy programming research [23–25] and considering the risk preference tiering prevalent in emergency management practice, this study selects three representative levels of : 0.6, 0.8, and 1.0 for calculation. Among these,
represents a balanced risk attitude and is relatively common in practice. The aim is to generate a series of alternative scheduling schemes by simulating different decision-making preferences, thereby providing decision-makers with a more comprehensive decision-making space. Subsequent case studies will compare optimization results under different
values to reveal the patterns of how changes in confidence levels affect scheduling schemes, thereby evaluating the model’s robustness and adaptability under varying risk expectations.
This example simultaneously sets up two sub-particle groups, each targeting the optimization of emergency response time and rescue cost, respectively. The Pareto optimal solution with the minimum value of the first objective function is designated as the global optimal position GBest for the second sub-particle group, while the Pareto optimal solution with the minimum value of the second objective function
is designated as the global optimal position GBest for the first sub-particle group. Each sub-particle swarm has a size of 30, with a maximum iteration count of 1000, an inertia weight of 0.4,
set to 1.2, and an acceleration factor
. Emergency resource scheduling schemes are calculated for three scenarios with confidence levels of
,
and
.
The Pareto optimal solution set is composed of a set of solutions that simultaneously satisfy the multi-objective optimization conditions, where each solution represents a different compromise solution, and each Pareto optimal solution in the Pareto optimal solution set is an optimal solution under different objectives [26]. Applying the VEPSO algorithm to solve the arithmetic example, this solution set is searched efficiently to ensure the diversity and comprehensiveness of the solutions, and the output is obtained as a set of Pareto-optimal solution sets, each of which represents a different scheduling scheme for emergency resources. In the selection of scheduling schemes, for each confidence level, the Pareto optimal solution set obtained from the operation is selected to minimize the rescue cost, and the results of the scheduling scheme are shown in Table 5. Simultaneously, comparisons were made with conventional algorithms such as Particle Swarm Optimisation (PSO), the NSGA-II algorithm and the Vector-Evaluated Genetic Algorithm (VEGA). Furthermore, to enhance the comprehensiveness of the algorithmic comparison, the Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D)—a representative algorithm in the field of multi-objective optimisation in recent years—was introduced for comparative analysis. In the MOEA/D algorithm, the weight vectors are generated using a uniform distribution, the neighbourhood size is set to 10, and a neighbourhood-based update strategy is employed for the evolution of solutions. Each algorithm was run 30 times, with the results are shown in Table 6.
As shown in Table 6, the VEPSO algorithm demonstrates unique optimization characteristics. Compared to the PSO algorithm, VEPSO significantly enhances search efficiency, reducing the number of convergence iterations by 59.7% while increasing the convergence success rate by 26.6%, highlighting the superiority of its algorithmic structure. Furthermore, while maintaining a high convergence success rate, the VEPSO algorithm demonstrates significant efficiency advantages. Its computational time is only 39.8% of NSGA-II, and the obtained solutions exhibit superior performance in satisfying fuzzy constraints, achieving a total demand fulfillment credibility of 0.983, a 57.5% improvement over VEGA.
A comparison with the MOEA/D algorithm indicates that MOEA/D possesses certain advantages in terms of convergence stability and solution diversity. However, in the multi-uncertainty coupled model developed in this paper, due to the complex constraint structure and the contracting nature of the feasible region, MOEA/D is slightly less efficient than VEPSO in the search for feasible solutions; its average number of convergence iterations and computational time are both higher than those of the VEPSO algorithm. In terms of solution quality, the credibility of demand satisfaction for the solutions obtained by VEPSO reached 0.983, which is higher than the 0.962 achieved by MOEA/D, indicating that VEPSO possesses a stronger ability to satisfy constraints when dealing with fuzzy credibility constraints.
These results indicate that through rational algorithmic design, VEPSO achieves a favorable balance between computational complexity and search efficiency, making it well-suited for addressing the multi-uncertainty optimization problems established in this paper. Its unique vector evaluation mechanism demonstrates distinct advantages when handling optimization problems with credibility constraints.
To evaluate the overall performance of each algorithm across multiple experiments, this paper further employs the Friedman test to conduct a multi-group comparative analysis of all algorithms. The Friedman test is a non-parametric statistical method used for comparing multiple algorithms; it ranks the performance of different algorithms across multiple experiments, calculates their average rank, and thereby determines whether there are significant differences between the algorithms.
In this study, based on the results of 30 independent experiments, the performance of each algorithm was ranked in terms of convergence rate and demand satisfaction credibility, and the average rank was calculated; the results are shown in Table 7.
As can be seen from Table 7, the VEPSO algorithm has the lowest average rank, indicating that it exhibits the best overall performance across multiple experiments. Furthermore, the results of the Friedman test indicate that the differences between the algorithms are statistically significant. These findings validate, from an overall perspective, the advantages of the VEPSO algorithm proposed in this paper in terms of solution efficiency and solution quality.
5.4. Analysis of results
5.4.1. Scheduling scheme under different confidence levels.
(1) Analysis of results when
As shown in Table 5, when , the scheduling scheme is as follows: Rescue teams from Shangrao Base
and Xiangtang Base
are dispatched to respond to accident point
. Shangrao Rescue Base
supplied 10, 11, and 12 units of the three emergency resource types, respectively, to accident point
, while Xiangtang Rescue Base
provided 16, 10, and 17 units. Substituting the results into Eqs. (22) and (30), respectively, we get that the target function total scheduling time is 2.1 hours and total scheduling cost is 185917 yuan.
(2) Analysis of results when
when , the scheduling program is as follows: Shangrao Rescue Base
and Xiangtang Rescue Base
will rescue the accident point
. Shangrao Rescue Base
supplied 24, 14, and 10 units of the three types of emergency resources respectively, while Xiangtang Rescue Base
provided 12, 8, and 15 units of the three resource types. The entire emergency rescue process recorded a total scheduling cost of 2.3 hours and incurred a total scheduling cost of 191,740 yuan.
(3) Analysis of results when
when , the scheduling scheme is as follows: Shangrao Rescue Base
, Laizhou Rescue Base
and Xiangtang Rescue Base
rescue the accident point
. Shangrao Rescue Base
supplied 16, 11, and 10 units of the three types of emergency resources respectively. Laizhou Rescue Base
provided 12, 3, and 12 units of the three resource types, while Xiangtang Rescue Base
delivered 10, 10, and 7 units. The entire rescue process required 3 hours, with a total scheduling cost of 273,932 yuan.
In summary, the scheduling optimization model gives a variety of scheduling schemes that meet practical requirements under different confidence levels, which proves its scientific nature and can provide support for the decision maker’s scientific decision making. When , rescue is provided by Shangrao, Laizhou and Xiangtang rescue bases, and the overall cost is the highest. From
to
, as the constraints are relaxed, the scheduling scheme reduces the number of rescue bases, and the rescue is provided by Shangrao Rescue Base
and Xiangtang Rescue Base
, which is consistent with the actual needs and the cost is gradually reduced. From
to
, the constraints are more and more relaxed, and in addition to the above changes, the amount of scheduling resources of Shangrao Rescue Base is reduced, and the amount of scheduling resources of Xiangtang Rescue Base is increased. This proves the effectiveness of using interval fuzzy credibility constrained programming.
5.4.2. Satisfaction analysis of scheduling schemes under different confidence levels.
Since the above scheduling plan is based on the optimization results obtained when the accident scenario rating is still unknown at the time of the accident, using the stochastic uncertainty method and considering the probability of occurrence of the four scenarios in a comprehensive manner, however, there may be differences in the performance under each specific scenario. For this reason, once the accident rating has been assessed, the above scenarios must also be evaluated for fitness and immediate scenario modifications must be made.
The satisfaction function, as an important tool for evaluating the degree of matching between fuzzy numbers, can effectively reflect the degree of satisfaction between the actual resource scheduling quantity and the fuzzy stochastic demand quantity at the accident point. When the satisfaction level is 1, it means that the scheduling plan completely meets the demand of the accident point. When the satisfaction level is between 0 and 1, it means that the plan partially meets the demand, and the larger the value means that it meets the demand to a higher degree. When the satisfaction level is 0, it means that the plan does not meet the demand at all, and a second round of emergency resource scheduling should be carried out. By calculating the resource satisfaction under each scenario, it is possible to carry out the dynamic correction of resource scheduling strategy for the decision maker in the case of gradually determining the accident level. According to Eq. (1), the total amount of all kinds of resources dispatched from each rescue base to the accident point is substituted into the satisfaction function, and the satisfaction levels of all kinds of resources at different confidence levels in different accident level scenarios are obtained, as shown in Table 8.
When , the scheduling strategy completely fails to meet the demand for resources
and
at the accident point in scenario
, and it can partially meet the demand for resource
, which means that secondary emergency resource scheduling should be carried out immediately, and the supply of resources
and
should be increased as a priority. Under scenario
, the plan does not meet the demand for resource
at the accident point at all, and supplementary scheduling of the resource should be carried out immediately; under Scenario
, the plan fully meets the demand for resources
and
, while also achieving a better satisfaction rate for resource
. Consequently, the overall performance is robust, suggesting that suspending the secondary scheduling mechanism could be considered. under scenario
, the satisfaction level of all resources reaches 1.0, indicating that the solution fully meets the demand for all resources, and the scheduling effect has reached an optimal state, so there is no need to carry out the subsequent supplemental scheduling of resources.
When , under scenario
, the program does not satisfy the demand for resources
and
, and can partially satisfy the demand for resource
, which indicates that the subsequent secondary emergency resource scheduling should prioritize increasing the supply of resources
and
. Under scenario
, the program can satisfy the demand for the three types of resources, and the subsequent scheduling can consider appropriately increasing a small amount of resource replenishment. Under scenario
and scenario
, the program can satisfy the demand for resources
and, and
, the scheduling is optimal, and there is no need for subsequent resource supplementation.
When , Under scenario
, the program can fully meet the demand of the accident point for the resource
, and can better meet the demand for the resources
and
, of which the degree of satisfaction for the resource
is relatively low, the subsequent scheduling should prioritize and consider appropriately increasing the supply of the resource
. Under scenario
, the program can better meet the demand of the accident point for the various resources, and can consider the second emergency resource scheduling. Under scenarios
and
, the program can fully meet the demand for the various resources. The scheduling effect has reached the optimal state, so there is no need to carry out subsequent resource supplementation.
5.5 Sensitivity analysis of uncertain parameters
This section conducts sensitivity analysis on the model’s key uncertain parameters, fixing the confidence level , to validate the model’s robustness. In this model, transportation time serves both as an objective function and an interval uncertainty parameter. To avoid conceptual overlap and focus on the impact of external resource environment changes on scheduling decisions, this sensitivity analysis will primarily examine how fluctuations in the critical uncertain parameter, emergency resource demand, affect optimization results. As the response variable of the objective function, changes in transportation time will serve as a key indicator for evaluating the influence of demand.
To investigate how the accuracy of emergency resource demand forecasts affects scheduling plans, the distribution parameters of demand are systematically adjusted to evaluate the responsiveness and robustness of the model’s optimization objectives. Trapezoidal fuzzy numbers are scaled proportionally by a coefficient
, yielding new demand parameters
. During the initial phase of railway emergencies, due to information uncertainty, a 10% to 20% deviation in resource demand estimation is a common and critical risk range. This study sets
and
to simulate demand scales 10% and 20% higher than the baseline scenario (
), respectively. The aim is to analyze the response patterns of decision objectives when actual resource demands systematically exceed expectations. The sensitivity analysis results are shown in Table 9.
Table 9 presents a comparison of optimization results across different demand scales. It is evident that as demand scales increase systematically, both total dispatch costs and total dispatch time exhibit a significant upward trend. When demand increases by 10%, the total dispatching cost rises from 191,740 yuan in the baseline scenario to 204,987 yuan, an increase of 6.9088%. Concurrently, the total dispatching time increases from 2.3 hours to 2.94 hours, an increase of 27.8260%. When demand increases by 20%, total dispatch costs rise to 222,520 yuan, an increase of 16.0529%, while total dispatch time increases to 3.45 hours, an increase of 50%. This change stems primarily from two factors: First, to meet higher resource demands, the model must call upon emergency resource points located farther away, directly increasing transportation costs. Second, the increased total volume of resource allocation heightened the complexity and duration of overall transportation and distribution operations.
The above analysis demonstrates that the model constructed in this paper responds clearly to changes in demand scale. Decision-makers should prioritize estimating resource requirements during the early stages of a disaster. Under conditions involving multiple uncertainties, a relatively accurate scale estimate is crucial for controlling total emergency costs, ensuring timely rescue operations, and developing reliable dispatch plans.
6. Conclusion
This study investigates the optimization of railway emergency resource scheduling under multiple uncertainties and proposes a systematic framework spanning problem analysis, model construction, algorithm design, and case validation.
- 1) The multiple uncertainties faced in the railway emergency resource scheduling system are analyzed, the uncertainty of emergency resource scheduling time is portrayed by using interval numbers, the randomness brought by the scenarios of emergencies is reasonably coupled with the fuzziness brought by the demand of emergency resources, and stochastic parameters are measurably mapped from the probability space to the set of fuzzy variables, thereby forming fuzzy-random parameters. And it is incorporated into the fuzzy credibility constraints, coupling the fuzzy credibility constraints and interval planning into the same planning system, establishing the interval fuzzy credibility constrained programming model under the unified framework, and effectively solving the optimization problem of the model where the objective function and constraints contain multiple uncertainty variables.
- 2) Compared with PSO, NSGA-II, and VEGA algorithms, VEPSO demonstrates superior performance across all three convergence metrics: convergence iterations, runtime, and convergence success rate. Its average convergence iteration count of 385 iterations represents a 59.7% improvement over PSO’s 890 iterations, while its average convergence time of 273 seconds is 60.1% shorter than NSGA-II’s 685 seconds, maintaining a convergence success rate of 93.3%. The algorithm achieves a total demand satisfaction credibility of 0.983, representing an improvement of approximately 4% to 9% over the comparison algorithms. This demonstrates its dual advantages in handling fuzzy constraints: both convergence speed and solution quality. Furthermore, when compared with the MOEA/D algorithm—a typical multi-objective evolutionary algorithm used in recent years—the average number of convergence generations has been reduced from 520 to 385, representing a decrease of approximately 26.0%. Computational time has been reduced by approximately 13.3%, whilst the credibility of demand satisfaction has increased from 0.962 to 0.983, further validating the effectiveness of the proposed algorithm in complex environments with uncertain constraints.
- 3) Regarding scheduling scheme evaluation, the confidence level
and accident scenario
jointly determine the distribution characteristics of resource satisfaction. When
, the scheme effectively satisfies all resources under scenario
but completely fails to meet resource
demand under scenario
. This scenario-dependent distribution of satisfaction provides a quantitative basis for dynamic emergency decision-making, enabling rapid identification of scheme weaknesses based on real-time accident severity assessments.
- 4) The model exhibits strong robustness against fluctuations in the demand scaling factor
. When
increases from 1.0 to 1.2, the variation rate of total dispatch cost remains within 16.0529%, while the variation rate of total dispatch time is 50%. This approximately linear response indicates that the model output remains predictably sensitive to input perturbations, maintaining decision stability even when demand estimates contain biases.
Building upon this static optimization framework, future research should focus on developing dynamic emergency dispatch systems. By integrating real-time disaster data and resource status feedback, a rolling decision mechanism capable of adaptive adjustments throughout incident evolution can be established. This approach will enhance the timeliness and adaptability of emergency resource allocation plans.
Supporting information
S1 File. Supplementary material.
S1 Data. Fuzzy-random resource requirements from incident locations. S1 Table 1. The length of the rescue path from each emergency rescue base to the accident point. S1 Table 2. Nanchang Railway Bureau rescue train service scope.
https://doi.org/10.1371/journal.pone.0349372.s001
(ZIP)
References
- 1. Tang Z, Zou Y, Liu Y, Sun J. Railway emergency resource scheduling based on shapley value allocation principle. J Chongqing Jiaotong Univ Nat Sci. 2023;42(04):139–44.
- 2. Wang F, Qin P, Li Y, Xiong S. Research on model and algorithm for emergency supply scheduling considering supplies damage. J Saf Sci Technol. 2025;21(06):204–11.
- 3. Shuaibao MA, Zhang J, Shen B, Wen Z, Gao X, Zou R. A multi-stage emergency resource dynamic scheduling method for road emergencies in flood season. Highway. 2024;69(11):236–45.
- 4. Zhao X, Wang G. Deep Q networks-based optimization of emergency resource scheduling for urban public health events. Neural Comput Appl. 2023;35(12):8823–32. pmid:36039332
- 5. Bodaghi B, Palaneeswaran E, Abbasi B. Bi-objective multi-resource scheduling problem for emergency relief operations. Prod Plan Control. 2018;29(14):1191–206.
- 6. Li L, Wei P, Bowen D. Emergency resource dispatch method considering subway network vulnerability under sudden disasters. J Railw Sci Eng. 2025;22(01):102–12.
- 7. Chenyuan MA, Wang B. Multi-objective optimization of highway earthquake disaster emergency resource scheduling. Highw Eng. 2023;48(05):181–6.
- 8. Yang L. Research on emergency resource system deployment optimization under uncertainty [dissertation]. Jinan: Shandong University; 2022.
- 9. Kehao HU, Tao LI. A study on fairness-oriented railway emergency material scheduling. Railw Freight Transp. 2020;38(07):27–32.
- 10. Tang Z, Nie X, Wang Z, Sun J. Optimization of high-speed rail emergency resource dispatching considering soft time window in scenario-response mode. J Saf Sci Technol. 2022;18(03):32–8.
- 11. Tan Z, Cao M, Guo F. Research on management strategy of highway emergency rescue resources dispatching. Process Autom Instrum. 2022;43(11):95–8.
- 12. Li J, Xu W, Li Y. Dual-objective planning model for emergency materials dispatching of offshore oil spill. J Saf Sci Technol. 2022;18(01):48–53.
- 13. Wang Y, Sun B. Multiperiod equitable and efficient allocation strategy of emergency resources under uncertainty. Int J Disaster Risk Sci. 2022;13(5):778–92.
- 14.
Boyang Z. Research on dynamic dispatching of offshore oil spill accident handling ship based on bilevel programming model. Liaoning: Dalian Maritime University; 2023.
- 15. Hongmu L, Qingfeng S. Research on emergency resource scheduling model with multi-objective participation. Logist Eng Manag. 2021;43(06):27–9.
- 16. Sun Y, Yu N, Huang B. Green road–rail intermodal routing problem with improved pickup and delivery services integrating truck departure time planning under uncertainty: an interactive fuzzy programming approach. Complex Intell Syst. 2021;8(2):1459–86.
- 17. Yan TU, Hongwei S, Jindong Q, Xiaoyan Z. Bi-level multi-objective regional water resources optimal allocation under hybrid uncertainty. Syst Eng Theory Pract. 2023;43(08):2428–46.
- 18. Gil MÁ, López-Díaz M, Ralescu DA. Overview on the development of fuzzy random variables. Fuzzy Sets Syst. 2006;157(19):2546–57.
- 19.
Parsopoulos KE, Tasoulis DK, Vrahatis MN. Multi-objective optimization using parallel vector evaluated particle swarm optimization. In: Proceedings of the IASTED international conference on artificial intelligence and applications. 2004. pp. 823–8.
- 20. Xin AI, Jingguo R, Kunyu W. Research on the multi-objective optimal power flow approach to MMC-MTDC based on improved VEPSO. J North China Electr Power Univ. 2019;46(03):1–8.
- 21. Zhu Y, Pan X. Production planning method based on credibility programming in fuzzy environments. Comput Integr Manuf Syst. 2011;17(02):344–52.
- 22.
Geng B. Research on railway emergency resource scheduling optimization based on GIS path selection. Jiangxi: East China Jiaotong University; 2017.
- 23. Wang Y, Guo P, Guo S. Fuzzy credibility-constrained quadratic programming model based on fuzzy weighted weights. J Drain Irrig Mach Eng. 2018;36(09):869–73.
- 24.
Baoding L, Ruiqing Z, Gang W. Uncertain programming with applications. Beijing: Tsinghua University Press; 2003.
- 25.
Rongyun L. Fuzzy multi-criteria decision-making: theory and applications. BEIJING: China Science Publishing; 2002.
- 26. Gao D, Zhou X. Research on the application of NSGA-III algorithm multi-objective optimization model for water resources scheduling during drought period. Water Conserv Sci Technol Econ. 2024;30(11):106–10.