IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0349372.html

Research on railway emergency resource scheduling strategy under multiple uncertainty coupling

Author

Listed:
  • Jianping Sun
  • Yuyang Wan
  • Guangle Lu
  • Zhaoping Tang

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.

Suggested Citation

  • Jianping Sun & Yuyang Wan & Guangle Lu & Zhaoping Tang, 2026. "Research on railway emergency resource scheduling strategy under multiple uncertainty coupling," PLOS ONE, Public Library of Science, vol. 21(5), pages 1-26, May.
  • Handle: RePEc:plo:pone00:0349372
    DOI: 10.1371/journal.pone.0349372
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0349372
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0349372&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0349372?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0349372. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.