A non-clustered approach to platelet collection routing problem

One of the blood components that can be extracted from whole blood is the platelet, which has a wide range of uses in medical fields. Due to the perishable nature of platelets, it is recommended that the separation occurs within six hours after the donation. Moreover, platelets constitute less than one percent of the whole blood volume, yet they are highly demanded. Given the importance of platelets in healthcare, their perishability, and their limited supply, an effective platelet supply chain leans on well-managed whole blood collection operations. In this study, the authors consider a blood collection problem (BCP) focusing on the collection of whole blood donations from the blood donation sites (BDSs). Different from the basic form of BCP, the authors consider the processing time limit (PTL) of blood and arbitrary donation patterns of donors as well as relaxing the assumption of assigning each blood collection vehicle (BCV) to a set of BDSs. Therefore, the authors define the non-clustered maximum blood collection problem (NCMBCP) as a variant of BCP. In this study, we examine routing decisions for platelet collections while relaxing the clustering requirement from the BDSs, which results in a significant increase in the complexity of the problem. In order to solve the problem, the authors propose a hybrid genetic algorithm (HGA) and an invasive weed optimization (IWO) algorithm that provide considerable improvements over the best solution in the literature for the clustered variant of the problem and outperform it (on average) by 8.68% and 8.16%, respectively.

• Record URL:
  • https://doi.org/10.1016/j.cor.2023.106366
• Record URL:
  • http://www.sciencedirect.com/science/article/pii/S0305054823002307
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/1793974
• Supplemental Notes:
  • © 2023 Elsevier Ltd. All rights reserved. Abstract reprinted with permission of Elsevier.
• Authors:
  • Khameneh, Ramin Talebi
  • 0000-0002-3487-4780
  • Elyasi, Milad
  • 0000-0002-4277-4114
  • Özener, O Örsan
  • Ekici, Ali
  • 0000-0002-9627-4780
• Publication Date: 2023-12

Language

• English

Media Info

• Media Type: Web
• Features: References;
• Pagination: 106366
• Serial:
  • Computers & Operations Research
  • Volume: 160
  • Issue Number: 0
  • Publisher: Elsevier
  • ISSN: 0305-0548
  • Serial URL: https://www.sciencedirect.com/journal/computers-and-operations-research

Subject/Index Terms

• TRT Terms: Biomedical materials; Blood; Genetic algorithms; Optimization; Pickup and delivery service; Routing
• Subject Areas: Freight Transportation; Operations and Traffic Management; Planning and Forecasting;

Filing Info

• Accession Number: 01891753
• Record Type: Publication
• Files: TRIS
• Created Date: Aug 28 2023 5:10PM