Quantum Slime Mould Algorithm and Application to Urgent Transportation

被引:0
|
作者
Khelfa, Celia [1 ]
Drias, Habiba [1 ]
Khennak, Ilyes [1 ]
机构
[1] USTHB, Lab Res Artificial Intelligence, Algiers, Algeria
关键词
Slime Mould Algorithm; Quantum Computing; Grover Algorithm; Quantum Slime Mould Algorithm; COVID-19; Ambulance Dispatching Problem;
D O I
10.1007/978-3-031-59318-5_7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The Slime Mould Algorithm (SMA) is a Swarm Intelligence (SI) technique inspired by the foraging behavior of slime moulds in nature. SMA demonstrates promise as an optimization method and researchers are actively exploring ways to improve its performance, including integrating hybrid strategies. Concurrently, quantum computing (QC) has emerged as a rapidly expanding research area, leveraging quantum mechanics principles for computation. This study presents QSMA, a quantum version of the slime mould algorithm, which combines classical SMA with the quantum Grover's algorithm. We apply this algorithm to the ambulance dispatching problem, a critical challenge in emergency medical services, where the objective is to allocate ambulances to respond to emergency calls efficiently. Our implementation of QSMA using the IBM Qiskit simulator is compared with the classical approach. This evaluation is performed using real-world COVID-19 data from Chicago. The experimental analysis reveals that the proposed quantum algorithm for ambulance dispatching is highly competitive, exhibiting significant improvements and converging to the optimal solution faster than the classical algorithm.
引用
收藏
页码:77 / 90
页数:14
相关论文
共 50 条
  • [41] Boosting slime mould algorithm for parameter identification of photovoltaic models
    Liu, Yun
    Heidari, Ali Asghar
    Ye, Xiaojia
    Liang, Guoxi
    Chen, Huiling
    He, Caitou
    ENERGY, 2021, 234
  • [42] Thick as slime mould
    Adams, G
    NEW SCIENTIST, 2005, 187 (2508) : 22 - 22
  • [43] Slime Mould Memristors
    Gale E.
    Adamatzky A.
    de Lacy Costello B.
    BioNanoScience, 2015, 5 (1) : 1 - 8
  • [44] On creativity of slime mould
    Adamatzky, Andrew
    Armstrong, Rachel
    Jones, Jeff
    Gunji, Yukio-Pegio
    INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 2013, 42 (05) : 441 - 457
  • [45] Slime mould navigation
    不详
    IMA FUNGUS, 2012, 3 (02) : 56 - 56
  • [46] Slime mould computing
    Adamatzky, Andrew
    INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 2015, 44 (03) : 277 - 278
  • [47] Improved slime mould algorithm with elitist strategy and its application to structural optimization with natural frequency constraints
    Kaveh, Ali
    Hamedani, Kiarash Biabani
    Kamalinejad, Mohammad
    COMPUTERS & STRUCTURES, 2022, 264
  • [48] On chirality of slime mould
    Dimonte, Alice
    Adamatzky, Andrew
    Erokhin, Victor
    Levin, Michael
    BIOSYSTEMS, 2016, 140 : 23 - 27
  • [49] Improved slime mould algorithm based on Gompertz dynamic probability and Cauchy mutation with application in FJS']JSP
    Li, Dan
    Gao, Fei
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2023, 44 (06) : 10397 - 10415
  • [50] Multi-Strategy Improved Slime Mould Algorithm and its Application in Optimal Operation of Cascade Reservoirs
    Hong Miao
    Zhongrui Qiu
    Chengbi Zeng
    Water Resources Management, 2022, 36 : 3029 - 3048