A Symbiotic Organisms Search Algorithm for Blood Assignment Problem

被引:5
|
作者
Govender, Prinolan [1 ]
Ezugwu, Absalom E. [2 ]
机构
[1] Univ Kwazulu Natal, Sch Math Stat & Comp Sci, Westville Campus,Private Bag X54001, ZA-4000 Durban, South Africa
[2] Univ KwaZulu Natal, Sch Comp Sci, King Edward Rd,Pietermaritzburg Campus, ZA-3201 Pietermaritzburg, Kwazulu Natal, South Africa
来源
关键词
D O I
10.1007/978-3-030-05983-5_16
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The demand for blood transfusion is considered a real world problem which is needed for various medical emergencies. The blood assignment problem was introduced to address this problem. The formulation of this problem stretches from managing critical blood shortage levels and blood unit expiration, to blood compatibility between donor and patients. Another contributing factor to the blood assignment problem, lies in the blood bank having to import additional blood units from external sources when supply cannot meet the demand. These challenges have serious consequences especially in the case where the demand for blood is very high. Taking these factors into consideration, this study implements a metaheuristic hybrid algorithm that combines symbiotic organisms search algorithm with the blood assignment policy in relation to the blood banks of South Africa. The aim of this study is to minimize blood product wastage with regards to expiration and importation, whilst maximizing product delivery to patients in need. In addition, this study also implements a unique way of generating randomized datasets based on social events relating to South Africa public holidays. The computational results indicate that the proposed hybrid algorithm performed well in minimizing blood importation, and experienced no form of expiration throughout the time period.
引用
收藏
页码:200 / 208
页数:9
相关论文
共 50 条
  • [1] Discrete symbiotic organisms search algorithm for travelling salesman problem
    Ezugwu, Absalom El-Shamir
    Adewumi, Aderemi Oluyinka
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2017, 87 : 70 - 78
  • [2] A Symbiotic Organisms Search Algorithm for Optimal Allocation of Blood Products
    Govender, Prinolan
    Ezugwu, Absalom E.
    [J]. IEEE ACCESS, 2019, 7 : 2567 - 2588
  • [3] Parallel Symbiotic Organisms Search Algorithm
    Ezugwu, Absalom E.
    Els, Rosanne
    Fonou-Dombeu, Jean, V
    Naidoo, Duane
    Pillay, Kimone
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2019, PT V: 19TH INTERNATIONAL CONFERENCE, SAINT PETERSBURG, RUSSIA, JULY 14, 2019, PROCEEDINGS, PART V, 2019, 11623 : 658 - 672
  • [4] Hybrid symbiotic organisms search algorithm for permutation flow shop scheduling problem
    Qin, Xuan
    Fang, Zi-Han
    Zhang, Zhao-Xin
    [J]. Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science), 2020, 54 (04): : 712 - 721
  • [5] A novel improved symbiotic organisms search algorithm
    Nama, Sukanta
    Saha, Apu Kumar
    Sharma, Sushmita
    [J]. COMPUTATIONAL INTELLIGENCE, 2022, 38 (03) : 947 - 977
  • [6] Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem
    Ezugwu, Absalom El-Shamir
    Adewumi, Aderemi Oluyinka
    Frincu, Marc Eduard
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2017, 77 : 189 - 210
  • [7] Symbiotic organisms search optimization algorithm for economic/emission dispatch problem in power systems
    Dosoglu, M. Kenan
    Guvenc, Ugur
    Duman, Serhat
    Sonmez, Yusuf
    Kahraman, H. Tolga
    [J]. NEURAL COMPUTING & APPLICATIONS, 2018, 29 (03): : 721 - 737
  • [9] Hybrid symbiotic organisms search algorithm for solving 0-1 knapsack problem
    Wu, Haizhou
    Zhou, Yongquan
    Luo, Qifang
    [J]. INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2018, 12 (01) : 23 - 53
  • [10] Symbiotic organisms search optimization algorithm for economic/emission dispatch problem in power systems
    M. Kenan Dosoglu
    Ugur Guvenc
    Serhat Duman
    Yusuf Sonmez
    H. Tolga Kahraman
    [J]. Neural Computing and Applications, 2018, 29 : 721 - 737