IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i4p654-d1592658.html
   My bibliography  Save this article

Research on Multi-Center Path Optimization for Emergency Events Based on an Improved Particle Swarm Optimization Algorithm

Author

Listed:
  • Zeyu Zou

    (School of Business, Jiangnan University, Wuxi 214122, China)

  • Hui Zeng

    (School of Design, Jiangnan University, Wuxi 214122, China)

  • Xiaodong Zheng

    (Faculty of Humanities and Arts, Macau University of Science and Technology, Macau 999078, China)

  • Junming Chen

    (Faculty of Humanities and Arts, Macau University of Science and Technology, Macau 999078, China)

Abstract

Emergency events pose critical challenges to national and social stability, requiring efficient and timely responses to mitigate their impact. In the initial stages of an emergency, decision-makers face the dual challenge of minimizing transportation costs while adhering to stringent rescue time constraints. To address these issues, this study proposes a two-stage optimization model aimed at ensuring the equitable distribution of disaster relief materials across multiple distribution centers. The model seeks to minimize the overall cost, encompassing vehicle dispatch expenses, fuel consumption, and time window penalty costs, thereby achieving a balance between efficiency and fairness. To solve this complex optimization problem, a hybrid algorithm combining genetic algorithms and particle swarm optimization was designed. This hybrid approach leverages the global exploration capability of genetic algorithms and the fast convergence of particle swarm optimization to achieve superior performance in solving real-world logistics challenges. Case studies were conducted to evaluate the feasibility and effectiveness of both the proposed model and the algorithm. Results indicate that the model accurately reflects the dynamics of emergency logistics operations, while the hybrid algorithm exhibits strong local optimization capabilities and robust performance in handling diverse and complex scenarios. Experimental findings underscore the potential of the proposed approach in optimizing emergency response logistics. The hybrid algorithm consistently achieves significant reductions in total cost while maintaining fairness in material distribution. These results demonstrate the algorithm’s applicability to a wide range of disaster scenarios, offering a reliable and efficient tool for emergency planners. This study not only contributes to the body of knowledge in emergency logistics optimization but also provides practical insights for policymakers and practitioners striving to improve disaster response strategies.

Suggested Citation

  • Zeyu Zou & Hui Zeng & Xiaodong Zheng & Junming Chen, 2025. "Research on Multi-Center Path Optimization for Emergency Events Based on an Improved Particle Swarm Optimization Algorithm," Mathematics, MDPI, vol. 13(4), pages 1-22, February.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:4:p:654-:d:1592658
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/4/654/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/4/654/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:4:p:654-:d:1592658. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.