<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Optimization of Blood Supply Chain Management for Eficient Blood Bank Operations</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Simmera Ndlalane</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Olumuyiwa Otegbeye</string-name>
          <email>olumuyiwa.otegbeye@wits.ac.za</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Absalom E. Ezugwu</string-name>
          <email>abstractomezugwu@nwu.ac.za</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Workshop</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Computer Science and Applied Mathematics, University of the Witwatersrand</institution>
          ,
          <addr-line>Johannesburg</addr-line>
          ,
          <country country="ZA">South Africa</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Unit for Data Science and Computing, North-West University</institution>
          ,
          <addr-line>11 Hofman Street, Potchefstroom, 2520, North-West</addr-line>
          ,
          <country country="ZA">South Africa</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>South Africa faces a critical shortage of blood donors, leading to substantial deficits in the national blood supply. Blood donations are vital for the treatment of life-threatening conditions, making it crucial to develop eficient models for the management of blood stocks. This paper presents a mathematical model to optimize blood donation and ensure suficient supply to meet fluctuating demands. The model captures the complex interactions within the blood banking system, focusing on minimizing costs, reducing waste, and eficiently distributing blood units. Specifically, it addresses daily supply challenges by minimizing the need for emergency imports and reducing blood wastage due to expiration while meeting all demand requirements. The core objective is to minimize blood wastage and reduce the reliance on imported blood banks during emergencies. The proposed objective function incorporates variables such as emergency importation and expiration rates, and robust optimization techniques are applied to identify optimal solutions while satisfying operational constraints. Symbiotic Organism Search (SOS), Genetic Algorithm (GA), and Particle Swarm Optimization (PSO) methods are utilized for optimization. Among these, SOS demonstrated superior performance, achieving the lowest levels of importation and wastage. However, the algorithms were unable to significantly reduce supply levels due to the accumulation of excess stock from the previous day, which carried over into the next day. This paper provides valuable information on blood supply management and highlights the potential for optimization techniques to improve eficiency and sustainability in blood banking. expiration, Blood assignment problems HC@AIxIA 2024: 3rd AIxIA Workshop on Artificial Intelligence For Healthcare ∗Corresponding author. †These authors contributed equally.</p>
      </abstract>
      <kwd-group>
        <kwd>Operations</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Blood is an essential fluid that delivers oxygen and nutrients to cells while removing carbon dioxide
and waste products. The primary constituents of blood consist of red blood cells, responsible for
oxygen and carbon dioxide transport; white blood cells, crucial for combating pathogens and aiding
in immune response; platelets, which facilitate clot formation to prevent blood loss from injuries; and
plasma, the fluid component transporting blood cells and platelets throughout the body [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Plasma
also contains proteins, ions, nutrients, and wastes. Blood donation involves a voluntary process in
which blood is extracted from donors and then transported to blood banks for storage until it is required
for transfusion to patients in hospitals who require blood. Examples of situations where blood might
be needed range from traumatic accidents, surgical procedures, childbirth, chronic disease, severe
infections, blood-related conditions, and excessive blood loss, among others [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Therefore, ensuring an
adequate blood supply is crucial for efective blood donation.
      </p>
      <p>A blood bank is a center where blood collected from blood donation is stored and preserved for later
use in blood transfusion. Key participants and entities within the blood supply chain process include
blood donors, blood banks, hospitals, and patients. Figure 1 outlines the general interactions between
each participant. In addition, it highlights the flow of blood from donation to utilization, emphasizing
the crucial roles played by each entity.</p>
      <p>CEUR</p>
      <p>ceur-ws.org</p>
      <p>The operations in a blood bank include the collection of blood from donors, processing the blood,
testing its health and specific properties, separating blood units based on blood type and other factors,
and finally, storing these operations. As illustrated in Figure 1, the process of blood collection and
distribution begins with the testing and screening phase, where blood collected by the South African
National Blood Service (SANBS) undergoes rigorous testing to ensure its safety and suitability for
transfusion. This includes screening for diseases such as HIV and other potential contaminants.
Following successful screening, the blood collected is transferred to designated blood banks for further
processing. Here, blood is subjected to processing techniques to preserve its quality and extend its
shelf life. Once processed, blood is classified according to its blood type and subjected to additional
screenings to confirm its safety for transfusion. Blood is quickly discarded to avoid potential harm if
abnormalities or contaminants are detected during this stage. However, if the blood passes all necessary
screenings and is deemed safe, it is sent to various hospitals and medical facilities according to their
demands and needs. This ensures that hospitals have a steady blood supply to meet the demands of
patients who require transfusions. The model derived later will focus only on the phases after donor
acceptance and blood collection. It will not consider the initial step of donor evaluation or the risk of
donor rejection, as these factors can vary over time and significantly impact the inflow of blood units
to a hospital.</p>
      <p>
        Alternatively, hospitals can transfer or export surplus blood to other facilities facing emergencies
or experiencing lower demand. This collaborative approach helps optimize the distribution of blood
resources, ensuring that they are used eficiently where they are most needed. Any surplus blood that
remains after transfusion or exportation is stored in designated storage facilities. These blood reserves
serve as a crucial backup to ensure that an adequate blood supply is always available, particularly
during increased demand or emergencies. However, it is essential to note that despite these measures,
blood units have a finite shelf life. If blood expires before it can be utilized, it is discarded to maintain
the integrity and safety of the blood supply. Hospitals can import additional blood units from other
facilities when they face a sudden surge in blood demand. This emergency measure helps to address
immediate needs and ensures that patients receive timely and life-saving transfusions. These blood
products use first-in-first-out (FIFO) and last-in-first-out (LIFO) methods to reach hospitals [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>The demand for blood has increased worldwide, while there are low levels of blood donations. This
means that the demand for blood exceeds the blood supply in hospitals. This poses a threat to patients
in need of blood. Blood is being wasted through expiration when a specific type of blood is not in
demand. There is insuficient blood stored for emergency events such as car accidents.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>This section presents a brief overview of preliminary studies and related works to further emphasise
the current study’s relevance.</p>
      <p>
        According to Charpin et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], blood is continuously required daily in hospitals for blood transfusion,
emergencies, and treating diseases. Addressing shortages, handling limited shelf life, and navigating
blood type mismatches present challenges in managing ongoing transfusion demands, as Govender and
Ezugwu [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] highlighted in their research. An adequate blood supply is critical to ensure that lifesaving
measures can be implemented when needed.
      </p>
      <p>
        Blood compatibility is one of the most important factors in blood transfusions. Additionally, natural
blood grouping restricts transfusion options due to blood compatibility. Karl Landsteiner’s 1901
discovery identified the human blood system, the ABO system, comprising four primary groups. In 1940,
Reid et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] discovered that in total, there exist eight blood group classifications for white blood cells,
including  +,  −,  +,  −,  +,  −,  + and  −. Table 1 illustrates the compatibility pairs among the
eight blood groups, with blood type  represented as  . The first row of the table represents the blood
donor’s blood type, and the first column represents the recipient’s blood type. ”+” entries in the table
indicate compatibility, signifying that the donor’s blood type matches that of the recipient, allowing for
a successful blood transfusion. The ”-” entries in the table indicate an incompatibility between the donor
and recipient. This concept forms the basis of the model formulation in this study. As is evident,  −
serves as the universal donor, while  + acts as the universal recipient. During emergencies, patients
are given blood type  − since it can be administered to anyone, as noted by Charpin et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        The shelf life of blood depends on the type of blood product and the temperature conditions. Whole
blood lasts 30 days, red blood cells 24 days, plasma 12 months, and platelets 5 days. This study focuses
on whole blood cells; thus, we will use 30 days for the expiration period in accordance with the study
conducted in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The assignment aims to allocate blood products to hospitals while minimizing the
need for imports and mitigating the risk of expiration, as outlined by Charpin et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and Ezugwu et
al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] in their investigation into optimal distribution strategies.
      </p>
      <p>
        A model that describes the inflow and outflow processes of blood units is necessary to enhance the
blood supply chain. In 1976, a planning model was developed by Cumming et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] for donation
collection and a basic model for distributing blood units to hospitals. Subsequently, a model was
devised by Charpin et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] that simplifies the blood assignment problem, focusing solely on red
blood cells and excluding the Rhesus factor (with potential future inclusion). Govender and Ezugwu
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] later formulated an optimization objective function to eficiently allocate blood units to hospital
patients while minimizing wastage due to expiry and reducing importation from external sources. Blood
allocation for daily demand and the available supply follows the FIFO process, prioritizing the oldest
blood units first and the newest last. The goal was to enhance the eficiency of the blood allocation
procedure using the SANBS and demographic data.
      </p>
      <p>
        The study by Dufourq et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] addressed blood assignment problems; the study endeavours to
optimize blood allocations to patients while minimizing blood importation without considering the
expiration and emergency factors. The findings suggest that GA facilitated a more eficient distribution
of blood importation, prioritizing fewer imports of more valuable types. According to the research
undertaken by Govender and Ezugwu [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], which tried solving the blood assignment problem by
minimising blood unit wastage importation while eficiently distributing blood units. The authors
investigated six algorithms, including PSO, but the SOS algorithm slightly lowered the importation
levels.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology</title>
      <p>and  −
To enhance the mathematical model introduced in prior research, which omitted considerations such
as blood expiration and emergency demand, this study aims to refine it. Thus, the expanded model
incorporates factors including the rate of blood expiration, the volume of blood expiring per unit
time, the quantity of blood imported from other blood banks for each blood group, and the volume of
blood exported to other blood banks for each blood group. The mathematical model maintains eight
diferential equations, each corresponding to a distinct blood type:  +,  −,  +,  −, 
+, 
−,  +,
. Each equation denotes the rate of change of the total blood units for the respective blood
type, determined by subtracting the total available blood for transfusion from the total units transfused,
adjusted for expired blood and accounting for both imported and exported blood units for emergency
purposes at other hospitals.</p>
      <p>Figure 2 shows the interactions between blood types  +,  −,  +,  −, 
+, 
−,  +, and  −, with</p>
      <p>simplified as  . The flowcharts depict how each type evolves through expiration, importation,
exportation, and donations. Each blood type is color-coded, representing the system of diferential
equations governing changes in blood units. Inputs are added, and outputs are subtracted from the
equations.</p>
      <p>This study addresses the removal of expired units after transfusions or transfers and importation
during emergencies. Importation increases blood availability, while exportation decreases it. The model
represented by Equation 1, 2, 3, 4, 5, 6, 7, and 8 serves as a mathematical representation of the problem,
accounting for the complexities of diferent blood types.
3.1. Mathematical Model
  − =  − − (  − − +   − + +   − − +   − + +   − − +   − + +   − − +   − +) +   −−</p>
      <p>1  − −   −,
  + =  + − (  + + +   + + +   + + +   + +) +  + −  2  + −   +,
  − =  − − (  − − +   − + +   − − +   − +) +   − −  3  − −   −,
  + =  + − (  + + +   + +) +   + −  4  + −   +,
  − =  − − (  − − +   − + +   − − +   − +) +   − −  5  − −   −,
  + =  + − (  + + +   + +) +   − −  6  + −   +,
  − =  − − (  − − +   − +) +   − −  7  − −   −,
  + =  + −   + + +   + −  8  + −   +.
(1)
(2)
(3)
(4)
(5)
(6)
(7)
(8)
For  representing an element of  +,  −,  +,  −, 
+, 
−,  +, and  −, where 
is denoted as  ,
and for  as an element of {1, 2, 3, 4, 5, 6, 7, 8}, the explanation of each term in this model is as follows:
  denotes the amount of blood available for donation, while   represents the rate of change of the
blood type   over time.   indicates a source of blood from donations, and the terms  
refer to

various difusion rates between diferent blood types. The term
  represents an external blood input
from other hospitals, often in emergencies.   stands for the expiration rate of blood units for each
blood type, and     accounts for the degradation or removal process due to expiration, proportional
to the concentration of   . Finally,   represents the exportation of blood to other hospitals to meet
their emergency demands. The number of blood units of a particular blood type imported ( ) and

exported (  ) on any given day will depend on the number of emergencies in the hospital. The blood
units indicated by   will be imported into the hospital to address emergencies, while those represented
by   will be exported to other hospitals to meet their emergency needs. Additionally, the volume of
blood transfused during emergencies is critical in determining the net inflow and outflow of blood units
within the healthcare system.</p>
      <sec id="sec-3-1">
        <title>3.2. Objective Function</title>
        <p>The equation

=1

=1
 = min (∑ () +
∑  () ) ,
(9)
subject to</p>
        <sec id="sec-3-1-1">
          <title>3.2.1. Expiration</title>
          <p>denotes the formulation of the model objective function and aims to minimize the amount of blood
imported and expired for each blood type. It will be tested with the dataset, and its results will be
compared to those reported in previous studies.</p>
          <p>Equation 10 calculates the remaining amount of blood after it expires 30 days post-issuance, rendering
it unsuitable for hospital use due to health reasons:
subject to  &gt; 30 . Where   () determines the amount of blood that remains after it has been issued.</p>
          <p>If the demand over the period after 30 days is less than the supply before the 30-day expiration, the
expired amount will be the diference between this supply and the demand, as the blood will surpass
the 30-day expiration period. This can be mathematically represented as follows:
subject to
When  &gt; 30 , if
then,
where 1 ≤  ≤ 365 .
3.2.2. Importation
  () =
∑   (),
∞
=31
  () =   () −   (),
  () ≥   (), 1 ≤  ≤ 365.</p>
          <p>=30
( ∑   ()) &lt;   ( − 30),
  () =   ( − 30) − ( ∑   ()) ,</p>
          <p>=30
Hospitals frequently encounter situations where there is an urgent need for blood due to emergencies.
In such cases, hospitals can initially import blood from other compatible blood types and then resort
to importing blood from other hospitals when needed. Equation 12 calculates the amount of blood
imported for each type.</p>
          <p>() =  +() +   −() +   +() +   −()+

 +() +   −() +   +() +   −()</p>
          <p>Blood banks and hospitals can import blood from other compatible blood types when there is a
shortage of a particular blood type, which can be represented as:</p>
          <p>If
then</p>
          <p>() &gt;   (),
  () =   () −   ().
represents a distinct value derived from the blood data set, facilitating individual manipulation in
subsequent calculations.
(10)
(11)
(12)
(13)
(14)</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>3.3. Methods</title>
        <p>
          In this research, Metaheuristic Algorithms such as Symbiotic Organism Search (SOS) [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], Genetic
Algorithm (GA) [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], and Particle Swarm Optimization (PSO) [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] have been selected based on their
proven performance and suitability for the problem at hand. The decision to use SOS and PSO is
supported by the study conducted by Govender and Ezugwu [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], which focused on the Blood Assignment
Problem and concluded that SOS outperformed other metaheuristic implementations, while PSO was
the fastest in producing results. Additionally, the GA algorithm has been chosen based on the findings
by Dufourq et al. [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], where GA not only outperformed other algorithms under investigation but also
provided a more eficient distribution of blood importation with fewer imports from high-value blood
types. These algorithms were selected for their eficiency, speed, and ability to achieve superior results
in similar problem domains.
        </p>
        <sec id="sec-3-2-1">
          <title>3.3.1. Symbiotic Organism Search</title>
          <p>The SOS and GA algorithms have demonstrated superior performance compared to other algorithms
examined in each study. The algorithm incorporates three phases inspired by real-world biological
interactions: mutualism, commensalism, and parasitism phases.</p>
          <p>Mutualism Phase: An organism   is selected to pair with organism   . Together, these organisms
engage in mutation to enhance the survival probabilities of organisms within the ecosystem. The
ofspring solutions   new and   new are computed based on the mutualistic symbiosis between the
parent organisms   and   . The calculations are defined as:
(15)
(16)
(17)
(18)
  new =   + rand(0, 1) ∗ ( best − Mutualism_Vector ∗ BF1),
  new =   + rand(0, 1) ∗ ( best − Mutualism_Vector ∗ BF2),</p>
          <p>Mutualism_Vector =
  +</p>
          <p>.
2</p>
          <p>Commensalism Phase: Randomly selecting two organisms,   and   , from the ecosystem, we
modify organism   with the assistance of organism   . The resulting child solution, derived from this
modification through commensal symbiosis between organisms   and   , is expressed as:
  new =   + rand(−1, 1) ∗ ( best −   ).</p>
          <p>Parasitism Phase: Organism   is randomly selected, and a Parasite Vector is created by duplicating
  and modifying some dimensions. Then, another organism   is chosen as the host and is replaced by
the parasite vector, which usually has a better fitness value than   . However, if   has a higher fitness,
it becomes immune to the Parasite Vector, preventing it from surviving in the ecosystem.</p>
        </sec>
        <sec id="sec-3-2-2">
          <title>3.3.2. Genetic Algorithm</title>
          <p>This algorithm utilizes recombination and mutation to generate new chromosomes, akin to biological
reproduction. The mutation alters genes within the chromosome. GA aims to evolve the optimal
chromosome for solving a given problem. The algorithm comprises three main components: natural
selection, mutation, and crossover.</p>
          <p>Natural Selection: In nature, individuals with superior survival traits survive for longer periods.
Consequently, over time, the population becomes dominated by genes from these superior individuals,
while genes from inferior individuals diminish. Species with high survival rates thrive, whereas those
with low survival rates perish. This is the theory of natural selection.</p>
          <p>Crossover: During the crossover operation, two individuals combine genetic material to create diverse
ofspring. The parent strings yield children strings based on a chosen crossover point. With a crossover
probability   , 100 ⋅   % of the population undergoes crossover, while 100 ⋅ (1 −   )%remains unchanged.
Common methods include single-point and double-point crossovers.</p>
          <p>Mutation: Mutation introduces random variations into the genetic search process, thereby preventing
the population from becoming stuck in local optima. It enhances diversity within the population by
operating at the bit level: during reproduction, each bit in the ofspring has a small probability of
mutation, typically denoted as mutation probability   .</p>
        </sec>
        <sec id="sec-3-2-3">
          <title>3.3.3. Particle Swarm Optimization</title>
          <p>
            The PSO algorithm creates global memory for the whole population of particles by recording the
bestever position and the corresponding fitness value. This is computed on every iteration of the algorithm.
In a PSO system, particles traverse a multi-dimensional search space by ”flying” around until they reach
a relatively stable state or until computational constraints are met [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ]. In a multi-dimensional space,
let  represent the positions of  particles, expressed as  = [ 1, … ,   , … ,   ]. At time step  , the
position of the  -th particle,    , is determined by its previous position and current velocity, denoted as
   =   (  −1 ,    ). The neighborhood of a particle   ,  (  ), includes all particles   that are “near”   .
The best previous position of   is defined as    ∗, satisfying  (   ∗) &gt;  (   ). Each particle   updates
its state according to the equations:
(19)
(20)
(21)
          </p>
          <p>The global best position found by the swarm from the beginning of the search up to the current
iteration  is represented by the term   is calculated using the equation:</p>
        </sec>
      </sec>
      <sec id="sec-3-3">
        <title>3.4. Dataset Summary</title>
        <p>The study uses real-world blood datasets to implement state-of-the-art metaheuristic algorithms that
include SOS, GA, and PSO. Data sourced from the Enugu National Blood Transfusion Service in
Nigeria, spanning from 2010 to 2018, was adapted from the Nigerian Enugu blood bank’s records over a
decade (2009-2019). These datasets detail monthly distributions of blood units across various blood
types. Ethical concerns have been carefully considered throughout the process of collecting data. The
confidentiality and anonymity of the individuals in the data set have been strictly maintained.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experiment, Results and Discussion</title>
      <p>In this section, we describe a series of experiments conducted to evaluate the practicality of the
proposed mathematical model and the eficiency of the GA, SOS, and PSO optimization algorithms. The
experiments were performed on a computing platform equipped with an Intel Core i3 CPU running at
1.20 GHz, 8 GB of RAM, and the Windows 11 operating system. All three algorithms were implemented
using Python.</p>
      <p>
        Diferent population sizes of 50, 100, and 150 were tested during the experiments. These population
sizes were chosen to maintain consistency with a study in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which used the same population sizes. By
adhering to these values, we ensure a fair comparison with existing research, enabling a more accurate
evaluation of our results relative to the established findings. The supply values were set within constant
percentage bounds ranging from 0 to 100%, with the initial blood volume capped at 300 units. The
  +1 =     +  1 1(   ∗ −    ) +  2 2(  −    ),
      </p>
      <p>+1 =   +1 +    .
  =</p>
      <p>
        , {   ,  = 1, 2, .., ,  = 1, 2, .., }.
selection of parameters for the SOS, PSO, and GA algorithms is consistent with the implementation
used in study [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which worked with the same dataset. Table 4 shows the parameters used to apply the
algorithms.
      </p>
      <p>The discrepancy between demand and supply must be zero for an optimal solution, but no such
solution was found due to the excess supply. This occurred because leftover blood units from the
previous day were carried over, increasing the total supply. As a result, the algorithms couldn’t meet
the required optimal supply. Additionally, import values should be minimal, but this condition wasn’t
satisfied due to high import quantities. However, the expiration values, which should approach zero,
were met. All supply, import, and expiration conditions must be satisfied for a valid solution.</p>
      <p>The SOS algorithm achieved the lowest importation levels compared to GA and PSO, as shown in
Tables 3 and 5, which aligns with our goal to minimize imports. Additionally, from Tables 3, 4, and 5,
the PSO algorithm consistently minimized blood expiration, with values very close to zero across all
population sizes. In contrast, other algorithms still had blood units expiring after 30 days. The diferent
population sizes investigated show trends in monthly blood volume (imported versus expired) for a
population of 50 monitored over a108 months(2010–2018).
 −
 −
 +
 +
 −
 −
 +
 +
 −
 −
 +
 +
 −
 −</p>
      <p>The comparison of the SOS, GA, and PSO algorithms in managing blood supply, import, and expiration
across all months (Tables 3, 4, and 5) reveals distinct performance patterns. For a population size of 50,
the SOS algorithm delivers the highest supply for  −, with minimal import and near-zero expiration,
 −
 +
 −
 +
 −
 +
 −</p>
      <p>+, making it the most eficient. The GA algorithm shows good supply for

+, lower import for  −, but struggles with expiration rates for  +,  −, and 
−. The PSO algorithm
minimises import and expiration, particularly for  +, though zero importation is impractical. For a
population size of 100, SOS ofers a high supply for most blood types with low imports and expirations
but struggles slightly with  +. GA performs well for  −, with low import for 
−, though expiration
for</p>
      <p>needs improvement. PSO achieves high supply for  + and  −, while minimizing import and
expiration rates, making it the most efective at maintaining supply with minimal waste. At a population
size of 150, SOS maintains a high supply for  − with low import and expiration rates. GA provides a
strong supply for  + and  −, but shows less eficient management for expiration, especially for 
+
and</p>
      <p>−. PSO delivers the highest supply for  −, maintaining minimal import and expiration across
all blood types.
rates.</p>
      <p>In summary, SOS demonstrates the most consistent performance in supply management, while PSO
excels in minimizing import and expiration. GA shows room for improvement in managing expiration</p>
      <p>When the population is initially set to 50, Figures 4, 5, and 6 reveal that imported blood volume
exhibits high variability with occasional spikes, while expired volume remains consistently low. Notably,
the PSO model shows the highest peak in imported blood, followed by GA, with SOS exhibiting lower
peaks. Despite the algorithmic diferences, trends indicate that imported blood volume fluctuates
significantly over time, whereas PSO maintains a zero expired volume, indicating SOS’s eficiency in
this scenario.</p>
      <p>As the population increases to 100, a correlation between importation and expiration is anticipated.
In Figure 7, SOS shows significant fluctuations in importation and more minor variations in expired
blood. Conversely, Figure 8 depicts both volumes experiencing frequent volatility, yet the expired
volume remains low. The PSO model in Figure 9 illustrates more significant import variability while the
expired volume remains near zero. Overall, GA proves to be the most eficient at this population size.</p>
      <p>With a population size of 150, blood imports display similar fluctuations to those seen in populations
of 50 and 100, but with slightly lower peaks. In Figure 10, the SOS algorithm shows that expired blood
remains low relative to imports, suggesting a negative correlation between expired units and population
size. Figure 11 shows more frequent, less pronounced peaks in imports for GA, while expired units
occur more frequently than in SOS, indicating less eficient usage. The PSO model in Figure 12 reflects
a slight decrease in imports compared to smaller populations, with expired units remaining low. In this
case, SOS again emerges as the most eficient.</p>
      <p>Overall, across varying population sizes, the SOS algorithm consistently demonstrates superior
eficiency in managing blood imports and minimizing expired units.</p>
      <p>The computation times for the SOS, GA, and PSO algorithms at diferent population sizes (  ∈
{50, 100, 150}) reveal distinct trends. Additionally, Figure 13 shows that SOS is always higher compared
to GA and PSO, and there is a positive relationship between population size and computational time.
Its time significantly increases with larger populations, indicating its sensitivity to dataset size, which
suggests it may not be the most eficient for higher populations. The GA algorithm also shows a rise in
computation time with increasing population size, but this increase is more moderate than that of SOS.
While GA requires more time than PSO, it remains faster than SOS, making it a better balance between
accuracy and eficiency. In contrast, the PSO algorithm consistently exhibits the lowest computation
times at each population size, scaling eficiently with a relatively linear increase in time. Thus, PSO is
highly suited for managing larger populations while maintaining computational eficiency. In summary,
all algorithms show increased computation times as population size grows. However, SOS has the most
MA
SOS
GA
PSO
MA
SOS
GA
PSO
MA
SOS
GA</p>
      <p>PSO
substantial rise, GA exhibits moderate scaling, and PSO is the most scalable and eficient for larger
datasets.</p>
      <p>Additionally, diferent iteration counts of 1000, 1500, 2000, and 3000 were investigated to analyze how
increasing the number of iterations would impact the results. Most prior studies utilized 1000 iterations
as a standard, providing a baseline for comparison. The selection of these four specific iteration counts
was deliberate, following a systematic progression that allows for a thorough examination of the efects
of increased iterations on convergence and solution quality. Starting with 1000 iterations, a commonly
accepted threshold in the literature, ensures consistency with existing studies. The increments of 500
allow for a gradual exploration of the efects of increased computational efort on the results. The results
for iteration 1000 are represented by Table 3 which was used initially before changing the iteration
sizes.</p>
      <p>Increasing the number of iterations from 1000 to 1500, 2000, and 3000 significantly improved the
results across the algorithms used (SOS, GA, and PSO) in terms of importation and expiration metrics.
Both the SOS and PSO algorithms exhibited a marked reduction in importation values, achieving
nearzero expiration rates, particularly at higher iterations, which aligns with the goal of minimizing non-zero
importation and eliminating expiration. In contrast, the GA algorithm showed less sensitivity to iteration
increases, maintaining low importation levels but failing to reach zero expiration consistently. Overall,
the findings suggest that higher iterations enhance the performance of most algorithms, particularly
SOS and PSO, in optimizing blood supply management. Table 6 and 8 show that the SOS algorithm
outperformed the other algorithm as it has the smallest values for both importation and expiration. But
for Table 7, the PSO algorithm has the smallest values for both factors.</p>
      <p>The analysis of blood unit trends across diferent algorithms and iterations (Figures 14–22) suggests
that the SOS algorithm may be the most efective in balancing blood imports and minimizing expirations
over time. At iterations 1500, 2000, and 3000, SOS (Figures 14, 17, and 20) shows relatively stable import
rates with consistently low expiration levels, indicating an eficient management of blood inventory. In
contrast, the GA (Figures 15, 18, and 21) exhibits high and frequent import peaks across all iterations,
which could lead to unnecessary over-importation without a proportional decrease in expirations.
Similarly, the PSO algorithm (Figures 16, 19, and 22) maintains high import levels but with fewer
expirations, indicating limited success in minimizing imports. Overall, the SOS algorithm emerges as
the most suitable for minimizing both blood imports and expirations as iterations increase, demonstrating
more excellent stability and eficiency in blood unit management compared to GA and PSO.</p>
      <p>
        These results are quite similar to those obtained in the study by Ezugwu et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which used the same
dataset and parameters. The results in this study are improved because expiration was also included
in the objective function, and diferent rhesus factors were considered. Lower levels were reported
compared to their study, with significantly lower supply levels, even though an optimal solution was not
found. This discrepancy between blood supply and demand arose from updating the supply with the
remainder of the previous day. Additionally, the algorithms in this study required less computational
time than the earlier study. However, both studies suggest that the SOS algorithm outperformed all
tested algorithms.
The optimal assignment of the blood problem presented in this paper aims to find the best solution to the
global supply and demand of blood by considering factors such as blood expiration and the importation
of blood during emergencies. Notably, blood is constantly in high demand worldwide, making a reliable
supply essential. The heuristic algorithms used in this study efectively optimised certain critical choice
variables relevant to the developed model. Overall, these algorithms made significant progress in
addressing the problem.
      </p>
      <p>To enhance their efectiveness, it is essential to introduce variables that account for the remaining
blood from the previous day, as carrying over the remainder did not yield satisfactory results. Future
work should focus on minimizing the remainder to reduce or eliminate carryover. Additionally, factors
such as seasonal variations, patient demographics by supplying blood based on the demographics of
the patient population, and the investigation of other algorithms should also be considered.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Charpin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Adewumi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bashe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hirpa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Okeke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Tchamga</surname>
          </string-name>
          , E. Ujeneza,
          <article-title>Optimal assignment of blood in a blood banking system</article-title>
          , Mathematics in Industry Study Group, University of University of KwaZulu-Natal, Westville, South Africa (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Ekaputri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. D.</given-names>
            <surname>Kusumastuti</surname>
          </string-name>
          ,
          <article-title>Simulation of blood inventory management: Case of the indonesian red cross jakarta branch</article-title>
          , SIMULATION, Department of Management,
          <source>Faculty of Economics and Business, Universitas Indonesia</source>
          <volume>12</volume>
          (
          <year>2022</year>
          )
          <fpage>31</fpage>
          -
          <lpage>2022</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>P.</given-names>
            <surname>Govender</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. E.</given-names>
            <surname>Ezugwu</surname>
          </string-name>
          ,
          <article-title>A comparative study of metaheuristics for blood assignment problem</article-title>
          ,
          <source>in: Proceedings of the 2018 International Conference on Algorithms, Computing and Artificial Intelligence</source>
          , School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Westville, South Africa,
          <year>2018</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M. E.</given-names>
            <surname>Reid</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lomas-Francis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Olsson</surname>
          </string-name>
          , The blood group antigen factsbook, Academic press,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A. E.</given-names>
            <surname>Ezugwu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Otegbeye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Govender</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. O.</given-names>
            <surname>Odo</surname>
          </string-name>
          ,
          <article-title>computational intelligence approach to dynamic blood allocation with abo-rhesus factor compatibility under real-world scenario</article-title>
          , IEEE access, School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Westville,
          <source>South Africa</source>
          <volume>8</volume>
          (
          <year>2020</year>
          )
          <fpage>97576</fpage>
          -
          <lpage>97603</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>P. D.</given-names>
            <surname>Cumming</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. E.</given-names>
            <surname>Kendall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. C.</given-names>
            <surname>Pegels</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. P.</given-names>
            <surname>Seagle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. F.</given-names>
            <surname>Shubsda</surname>
          </string-name>
          ,
          <article-title>A collections planning model for regional blood suppliers: description and validation</article-title>
          ,
          <source>Management Science</source>
          <volume>22</volume>
          (
          <year>1976</year>
          )
          <fpage>962</fpage>
          -
          <lpage>971</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>E.</given-names>
            <surname>Dufourq</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Olusanya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Adewumi</surname>
          </string-name>
          ,
          <article-title>Studies in metaheuristics for the blood assignment problem</article-title>
          ,
          <source>Proceedings of the Operation Research Society of South Africa (ORSSA'12)</source>
          , School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Westville, South Africa (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8] M.-Y. Cheng, D. Prayogo,
          <article-title>Symbiotic organisms search: a new metaheuristic optimization algorithm</article-title>
          ,
          <source>Computers &amp; Structures</source>
          <volume>139</volume>
          (
          <year>2014</year>
          )
          <fpage>98</fpage>
          -
          <lpage>112</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J. H.</given-names>
            <surname>Holland</surname>
          </string-name>
          ,
          <article-title>Genetic algorithms</article-title>
          ,
          <source>Scientific american 267</source>
          (
          <year>1992</year>
          )
          <fpage>66</fpage>
          -
          <lpage>73</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>E.</given-names>
            <surname>Ozcan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. K.</given-names>
            <surname>Mohan</surname>
          </string-name>
          ,
          <article-title>Particle swarm optimization: surfing the waves</article-title>
          ,
          <source>in: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)</source>
          , volume
          <volume>3</volume>
          , IEEE,
          <year>1999</year>
          , pp.
          <fpage>1939</fpage>
          -
          <lpage>1944</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>