Discrete OptimizationSelective vehicle routing for a mobile blood donation system
Introduction
Blood donation logistics can be classified under the medical supply transportation problems as a healthcare logistics problem. Although blood transfusion is one of the most critical operations in various medical interventions, blood is a very limited resource. Since blood cannot be produced synthetically, donations constitute the only source. Worldwide average demand for blood is reported by WHO (World Health Organization, 2013) as 92 million units per year whereas the regular blood donors make up only 5 percent of the world population. Effective use of bloodmobiles may be helpful in raising the number of donors and their donation frequencies. Since bloodmobiles can also reach potential donors who have limited time and limited means of transportation, these vehicles can attract more donors than fixed donation points. Red Crescent and Red Cross Societies all over the world share virtually the same organizational structure for their blood collection units. These units consist of mainly fixed points (such as blood centers, hospitals and clinics) and bloodmobiles. Bloodmobiles are motor vehicles (usually bus or large van) containing necessary equipment for the blood donation procedure. Blood drives involving bloodmobiles usually take place in public places such as colleges and churches. These drives aim to reach at many donors that may not be planning to make a blood donation otherwise.
In this study, we propose a new cost efficient and easy-to-implement mobile blood collection system based on the practices of Turkish Red Crescent (TRC). Since TRC is a member of the International Federation of Red Cross and Red Crescent Societies (IFRC), these practices can easily be extrapolated to other national Red Cross and Red Crescent organizations due to IFRC's guidelines. The application of guidelines can differ from organization to organization, but a well-designed global model can be adopted by any organization.
There is a continuous demand for blood that needs to be met through donations. However, mobile blood collection is not the major part of blood collection in the world (including Turkey). In fact, most donations are taken at fixed locations. The structures and operational mechanisms of fixed locations and mobile systems used by TRC for its blood collection activities can be summarized as follows:
- •
Fixed locations: Regional Blood Centers (RBC), less developed Blood Centers (BC) and supporting facilities known as Blood Stations (BS) are the three types of fixed locations. RBCs are capable of performing every blood related action, such as collection, analysis, storage, and distribution. The coordination of activities in BCs and BSs are also among the responsibilities of RBCs. BCs, which are more common, can also perform basic analysis and storage whereas, BSs support only the collection and temporary storage of blood. Each mobile unit is assigned to either a RBC or BC, thus mobile blood tours are originated from these centers. In the system that is described by Sahin, Sural, and Meral (2007) there are 7 RBCs, 23 BCs and 34 BSs in Turkey.
- •
Bloodmobiles: In Turkey, bloodmobiles provide service at pre-arranged temporary locations such as governmental organizations, municipalities and certain public events, where the potential number of donors is large. Pre-determined locations are visited by bloodmobiles according to a weekly schedule. Locations and dates for mobile blood collection are usually determined by the host organizations and TRC. TRC assigns collector teams to these host organizations on the designated days. Blood collection at a designated point is a whole day activity including traveling, set-up and collection times. That is, a blood mobile cannot visit multiple locations on any given day. Due to the perishable nature of whole blood, the collected blood needs to be sent to the closest RBC/BC for analysis and storage within a maximum of 24 hours after its collection. To prevent spoilage, bloodmobiles return the collected blood to their assigned RBC/BC (depot) at the end of each day.
With our system, both the bloodmobiles and shuttles can be mobilized in the sense that, we decide on the points to be visited by the bloodmobiles, and durations of these visits as part of the solution output. As another example, American Red Cross (2012) performs same dedicated bloodmobile tours periodically and announces them in their website, expecting donors will visit these vehicles. This is very similar to what TRC does in its current practice, before the introduction of the new system suggested by the authors. Therefore, American Red Cross can update its tours using the structure that is going to be described in this paper, in order to achieve higher blood collection amounts by visiting the local activities with high expected number of visitors and employing shuttles to collect the blood. In brief, the system and the results reported in this paper can easily be adopted by other blood collecting organizations around the world including Austrian and American Red Cross organizations.
New system requires determining stops of bloodmobiles, the duration of stay for the bloodmobiles at each stop along their respective routes and finally the sequence of visiting these stops (i.e. tours) for both bloodmobiles and the shuttles. To the best knowledge of the authors', there is no study in the literature that simultaneously considers all these issues. The most closely related problem in the literature is the Selective Vehicle Routing Problem (SVRP) suggested by Chao, Golden, and Wasil (1996). The node selection and route determination tasks in SVRP correspond to the selection of the stops and routes of the bloodmobiles. However, our problem also requires deciding on the length of stay of each bloodmobile at the nodes along its route, and the daily routes of the shuttle to transfer the collected blood at the bloodmobiles in the field to the depot. Since SVRP does not include a mechanism that would simultaneously optimize the bloodmobile and shuttle tours, our model stands out as a new problem that can be considered as an extension of SVRP. Thus, we name it as the Selective Vehicle Routing Problem with Integrated Tours (SVRPwIT).
The rest of the paper is organized as follows: Section 2 presents a formal definition of the research problem followed by a review of the related literature. Section 3 proposes a mathematical model for this problem. In Section 4, the performance of the mathematical model is tested first on a real data set obtained from past blood donation activities in Ankara, and then on a constructed data set based on GIS (Geographical Information System) data of the European part of Istanbul. Section 5 proposes a 2-stage IP based algorithm as a more efficient technique to solve larger problems. Computational times and optimality gaps of this algorithm are compared with the exact solutions also in this section. Finally, the paper is concluded in Section 6, with a summary of the study and possible future research directions.
Section snippets
Problem definition
We design a new mobile blood collection system motivated from the current Red Cross and Red Crescent applications. In addition to the daily bloodmobile visits, the new system also allows 2- or 3-day stay-overs at any given point, while still conveying the collected blood to the depot in a timely manner to avoid its spoilage. The new system also proposes more frequent and better utilized bloodmobile tours over a weekly schedule. The routes are not limited to special, large-scale events. Quite
Model development
Let G = (N, A) be a geographical network, where N\{1} is the set of potential stops of the bloodmobile and node {1} is the given location of the depot. Set A represents the roads between these nodes. In order to model the possible stay-overs of bloodmobiles, we will use a time-extended version of G. Let G′ be the extended version of the geographical network for modeling the stay-overs at nodes. For each actual potential location, G' has three nodes, the first one is the original node v and the
Data sets
Computational experiments are based on two different data sets. Since, we take the blood collection activities of TRC Ankara as a benchmark scenario reflecting the current practices, real donation data of past activities in Ankara is gathered as a first set. The second set is composed of GIS data belonging to the municipal districts in the European Part of Istanbul, where each district is considered as a potential point with a blood potential that is assumed to be equal to the district's
Two-stage IP-based heuristic algorithm
Since our problem is defined on a time expanded network and it contains typical vehicle routing constraints, as the number of potential points or the stay-over period grows, the underlying network gets larger. Hence, for large instances (with long stay-over periods or many potential points) computational times may be considerably long. In view of the proposed 7-day planning period, long computational times may not be desirable. Thus, we design a two-stage IP based heuristic approach that yields
Conclusion and future research directions
In this research, we focused on the problem of designing a new bloodmobile system in the context of a TRC application. The proposed system consists of original bloodmobiles in addition to a shuttle. With the implementation of this new system, bloodmobiles do not need to make daily returns to the depot to bring the collected blood, but instead, the shuttle visits the bloodmobiles in the field and transports the collected blood to the analysis center. As a result, the selective vehicle routing
Acknowledgements
The authors sincerely thank the two anonymous referees for contributing to the improvement of this paper. The corresponding author gratefully acknowledges support from the Turkish Academy of Sciences.
References (30)
- et al.
Supply chain management of blood products: A literature review
European Journal of Operational Research
(2012) - et al.
The team orienteering problem
European Journal of Operational Research
(1996) - et al.
On prize‐collecting tours and the asymmetric travelling salesman problem
International Transactions in Operational Research
(1995) - et al.
Multicriteria tour planning for mobile healthcare facilities in a developing country
European Journal of Operational Research
(2007) - et al.
Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
Computers & Operations Research
(2008) - et al.
Multi-objective vehicle routing problems
European Journal of Operational Research
(2008) - et al.
The selective travelling salesman problem
Discrete Applied Mathematics
(1990) - et al.
Locational analysis for regionalization of Turkish Red Crescent blood services
Computers & Operations Research
(2007) - et al.
Heuristic and exact algorithms for a min-max selective vehicle routing problem
Computers & Operations Research
(2011) - et al.
The orienteering problem: A survey
European Journal of Operational Research
(2011)
Optimizing specimen collection for processing in clinical testing laboratories
European Journal of Operational Research
Blood facts and statistics.
Customer selection and profit maximization in vehicle routing problems
Modeling and simulation of blood collection systems
Health Care Management Science
The capacitated team orienteering and profitable tour problems
Journal of the Operational Research Society
Cited by (68)
Blood supply chain network design with lateral freight: A robust possibilistic optimization model
2024, Engineering Applications of Artificial IntelligenceA Bi-objective stochastic blood type supply chain configuration and optimization considering time-dependent routing in post-disaster relief logistics
2024, Computers and Industrial EngineeringA unifying framework for selective routing problems
2024, European Journal of Operational ResearchA non-clustered approach to platelet collection routing problem
2023, Computers and Operations ResearchDesigning blood supply chain networks with disruption considerations by a new interval-valued fuzzy mathematical model: M/M/C queueing approach
2023, Computers and Industrial Engineering