Back to Search

Managing platelet supply through improved routing of blood collection vehicles

Title	Managing platelet supply through improved routing of blood collection vehicles
Author	Özener, Okan Örsan, Ekici, Ali
Publication Date:	2018-10
Publication Place	- Elsevier
Subject	Blood supply chain, Platelet production, Processing time limit, Vehicle routing
Type	Periodical
Language	English
Digital	Yes
Manuscript	No
Library:	Özyeğin University
Library Asset ID	0305-0548
Record ID	e9a4c0b2-4405-4b66-9335-7a835b094374
Library Location	Industrial Engineering
Date	2018-10
Notes	TÜBİTAK
Sample Text	In this paper, we study the routing of blood collection vehicles for improving the platelet supply in the blood supply chain. In order to extract platelets, donated blood has to be processed at a central processing facility within six hours of donation time. Blood collection organizations have to dispatch collection vehicles and schedule pickups from the donation sites so that the donated units can be used in platelet production. Because of the accumulating behavior of donations and the six-hour processing time limit, routing of blood collection vehicles is a time-sensitive routing problem. We analyze the routing decisions in such a setting and propose an integrated clustering and routing framework to collect and process the maximum number of donations for platelet production. In our analysis, motivated by the practices in real-life, we cluster the donation sites so that only a single vehicle serves the donation sites in each cluster. In the proposed framework, we make the clustering and routing decisions in an integrated manner so that we can foresee the impact of adding a donation site to a cluster on the routing decisions. For the routing step, we propose several heuristic algorithms, two of which have a greedy nature and the others are based on a priori tour generation and selection scheme. To evaluate the performances of the proposed heuristics, we develop an upper bound by relaxing the number of vehicles so that one vehicle is available for each donation site. Using the proposed heuristic algorithms, we obtain solutions with around 15% optimality gaps with respect to the upper bound.
DOI	10.1016/j.cor.2018.05.011
Cilt	98

View in source Özyeğin University Özyeğin University - Historical works, archives, and periodicals search engine

Özyeğin University

Managing platelet supply through improved routing of blood collection vehicles

Author Özener, Okan Örsan, Ekici, Ali

Publication Date 2018-10

Publication Place - Elsevier

Subject Blood supply chain, Platelet production, Processing time limit, Vehicle routing

Type Periodical

Language English

Digital Yes

Manuscript No

Library Özyeğin University

Library Asset ID 0305-0548

Record ID e9a4c0b2-4405-4b66-9335-7a835b094374

Library Location Industrial Engineering

Date 2018-10

Notes TÜBİTAK

Sample Text In this paper, we study the routing of blood collection vehicles for improving the platelet supply in the blood supply chain. In order to extract platelets, donated blood has to be processed at a central processing facility within six hours of donation time. Blood collection organizations have to dispatch collection vehicles and schedule pickups from the donation sites so that the donated units can be used in platelet production. Because of the accumulating behavior of donations and the six-hour processing time limit, routing of blood collection vehicles is a time-sensitive routing problem. We analyze the routing decisions in such a setting and propose an integrated clustering and routing framework to collect and process the maximum number of donations for platelet production. In our analysis, motivated by the practices in real-life, we cluster the donation sites so that only a single vehicle serves the donation sites in each cluster. In the proposed framework, we make the clustering and routing decisions in an integrated manner so that we can foresee the impact of adding a donation site to a cluster on the routing decisions. For the routing step, we propose several heuristic algorithms, two of which have a greedy nature and the others are based on a priori tour generation and selection scheme. To evaluate the performances of the proposed heuristics, we develop an upper bound by relaxing the number of vehicles so that one vehicle is available for each donation site. Using the proposed heuristic algorithms, we obtain solutions with around 15% optimality gaps with respect to the upper bound.

DOI 10.1016/j.cor.2018.05.011

Cilt 98