Skip to content
naulon
Not checkedNot checked for notices yet.

A Symbiotic Organisms Search Algorithm for Optimal Allocation of Blood Products

Prinolan Govender, Absalom E. Ezugwu

IEEE Access · 2019

doi:10.1109/access.2018.2886408 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

The blood assignment problem is an important real-world optimization problem because of the continuous demand for blood transfusion during medical emergencies. 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 the blood is very high. Therefore, there is the need to minimize blood product wastage with regards to expiration and importation, whilst maximizing product delivery to patients in need. To solve this problem, existing studies used fixed percentage bounds to generate values for demand and supply of whole blood units. However, in this paper, a different approach is considered when generating such values, which involves allocating a unique percentage bound to each month. The bounds conform to statistics taken from South African social behavior with the attempt at generating values which mimic real-life monthly demand and supply of whole blood units. Furthermore, this study implements a hybrid metaheuristic algorithm that combines symbiotic organisms search algorithm with the blood assignment policy in relation to the blood banks of South Africa to effectively minimize the operational costs of the blood transfusion centers. The computational results indicate that the proposed algorithm performed quite satisfactorily from the computational time, stock-piling, and low importation level points of view.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.