Bloodmobiles are widely used in healthcare logistics to increase the number of donors, donation frequency, and matching blood demand and collection. Mobile blood collection has the advantage of a greater reach than blood drives at fixed donation sites and are preferable for people with limited time and means of transportation. Thus, several studies have focused on increasing the effectiveness of a bloodmobile donation system. The system consisting of bloodmobiles and shuttles is one of those studies. The bloodmobiles are stationed at pre-determined locations, while the shuttles are assigned to visit a bloodmobile location to collect the donated blood. This problem belongs to a Vehicle Routing Problem (VRP) class called the Selective Vehicle Routing Problem with Integrated Tours (SVRPwIT).
This paper extends SVRPwIT and presents the mathematical optimization model of the Selective Vehicle Routing Problem under the Bloodmobile System (SVRP-BM) by considering: (i) multiple shuttles, (ii) multiple blood types, (iii) multiple trips for the bloodmobiles, and (iv) visiting availability of the donation sites. We also propose the Adaptive Large Neighbourhood Search (ANLS) algorithm to solve the problem. The proposed ALNS is tested on the generated instances adopted from a real-life case of the Surabaya Red Cross. Our proposed ANLS finds 26 optimal solutions and 7 (seven) new best solutions out of 45 test problems. Moreover, a sensitivity analysis is presented to demonstrate the effect of varying the demand, the number of donation sites, the number of planning horizons, and the number of bloodmobiles on the overall cost.

Alfonso, E., Xie, X., Augusto, V., & Garraud, O. (2011). Modeling and simulation of blood collection systems. Health Care Management Science, 15, 63-78.
AlHamdan, N. A., AlMazrou, Y. Y., AlSwaidi, F. M., & Choudhry, A. J. (2007). Premarital screening for thalassemia and sickle cell disease in Saudi Arabia. Genetics in Medicine, 9(6), 372-377.
Archetti, C., Hertz, A., & Speranza, M. G. (2007). Metaheuristics for the team orienteering problem. Journal of Heuristics, 13(1), 49-76.
Balas, E. (1989). The prize collecting traveling salesman problem. Networks, 19, 621-636.
Baran, E. (2019). Optimizing A Route Path For A Mobile Blood Collection System. Computational Intelligence & Wireless Sensor Networks, 1, 37-39.
Beliën, J., & Forcé, H. (2012). Supply chain management of blood products: A literature review. European Journal of Operational Research, 217(1), 1-16.
Bozorgi-Amiri, A., Jabalameli, M. S., & Al-e-Hashem, S. M. J. M. (2013). A multi-objective robust stochastic programming model for disaster relief logistics under uncertainty, OR Spectrum, 35, 905-933.
Brandeau, M. L., Sainfort, F., & Pierskalla, W. P. (2004). Operations research and health care: a handbook of methods and applications (Vol. 70). Springer Science & Business Media.
Brennan, J. E., Golden, B. L., & Rappoport, H. K. (1992). Go with the Flow: Improving Red Cross Bloodmobiles Using Simulation Analysis, Interfaces, 22(5), 1-13.
Chen, L., & Miller-Hooks, E. (2012). Optimal team deployment in urban search and rescue. Transportation Research Part B, 46(8), 984-999.
Defryn, C., Sörensen, K., & Cornelissens, T. (2016). The selective vehicle routing problem in a collaborative environment. European Journal of Operational Research, 250(2), 400-411.
Dell'Amico, M., Mafioli, F., & Varbrand, P. (1995). On Prize-collecting Tours and the Asymmetric Travelling Salesman Problem. Int. Opl Res., 2, 297-308.
Doerner, K. F., & Hartl, R. F. (2008). Health care logistics, emergency preparedness, and disaster relief: new challenges for routing problems with a focus on the Austrian situation. In The vehicle routing problem: latest advances and new challenges (pp. 527-550). Springer.
Fan, Y., Zhang, Q., & Quan, S. (2021). A New Approach to Solve the Vehicle Routing Problem: The Perspective of the Genetic Algorithm Combined with Adaptive Large Neighbour Search. 2021 13th International Conference on Computer Information Science and Artificial Intelligence (CISAI), 79-85.
Gader, A. G. M. A., Osman, A. M. A., Gahtani, F. H. A., Farghali, M. N., Ramadan, A. H., & Al-Momen, A. K. M. (2021). Attitude to blood donation in Saudi Arabia. Asian Journal of Transfusion Science, 5, 121-126.
Glaab, H. (2002). A new variant of a vehicle routing problem: Lower and upper bounds. European Journal of Operational Research, 139(3), 557-577.
Gunpinar, S., & Centeno, G. (2016). An integer programming approach to the bloodmobile routing problem. Transportation research part E: logistics and transportation review, 86, 94-115.
Halawani, A. J. (2022). The impact of blood campaigns using mobile blood collection drives on blood supply management during the COVID-19 pandemic. Transfusion and Apheresis Science, 61(3), 103354.
Hemmelmayr, V., Doerner, K. F., Hartl, R. F., & Savelsbergh, M. W. P. (2008). Delivery strategies for blood products supplies, OR Spectrum, 31, 707-725.
Hemmelmayr, V. C., Cordeau, J.-F., & Crainic, T. G. (2012). An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Computers & operations research, 39(12), 3215-3228.
Hentenryck, P. V., Bent, R., & Coffrin, a. C. (2010). Strategic Planning for Disaster Recovery with Stochastic Last Mile Distribution, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 318-333
Huang, M., Smilowitz, K., & Balcik, B. (2012). Models for relief routing: Equity, efficiency and efficacy. Procedia - Social and Behavioral Sciences 17(1), 416-437
Indonesian Red Cross. (2022). bit.ly/3G9hVi2
Kancharla, S. R., & Ramadurai, G. (2018). An adaptive large neighborhood search approach for electric vehicle routing with load-dependent energy consumption. Transportation in Developing Economies, 4(2), 1-9.
Kara, B. Y., Taner, M. R., & Syahinyazan, F. G. (2015). Selective vehicle routing for a mobile blood donation system. European Journal of Operational Research, 245(1), 22-34.
Kendall, K. E., & Lee, S. M. (1980). Formulating blood rotation policies with multiple objectives. Management Science, 26(11), 1145-1157.
Kirkpatrick, S., Gelatt Jr, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671-680.
Laporte, G., & Martello, S. (1990). The Selective Travelling Salesman Problem. Discrete Applied Mathematics, 26, 193-207.
Lusby, R. M., Schwierz, M., Range, T. M., & Larsen, J. (2016). An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem. Artificial intelligence in medicine, 74, 21-31.
Mehdi, N., Abdelmoutalib, M., & Imad, H. (2021). A modified ALNS algorithm for vehicle routing problems with time windows. Journal of Physics: Conference Series, 1743, 012029.
Ministry of Communication and Information Technology of East Java Province. (2018). bit.ly/3C4B3wj
Ngo, A., Masel, D., Cahill, C., Blumberg, N., & Refaai, M. A. (2020). Blood Banking and. Clin Lab Med 40, 587–601.
Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34, 2405-2435.
Praseeratasang, N., Pitakaso, R., Sethanan, K., Kaewman, S., & Golinska-Dawson, P. (2019). Adaptive large neighborhood search for a production planning problem arising in pig farming. Journal of Open Innovation: Technology, Market, and Complexity, 5(2), 26.
Rabbani, M., Aghabegloo, M., & Farrokhi-Asl, H. (2017). Solving a bi-objective mathematical programming model for bloodmobiles location routing problem. International Journal of Industrial Engineering Computations, 8(1), 19-32.
Ramírez, A. P., Labadie, N., & Rueda, W. J. G. (2018). Vehicle Routing Problem for Blood Mobile Collection System with Stochastic Supply. Proceedings of the International Conference on Industrial Engineering and Operations Management, Paris, France.
Rhône-Alpes, R. (2011). Rapport d’activité 2011.
Rifai, A. P., Nguyen, H.-T., & Dawal, S. Z. M. (2016). Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling. Applied Soft Computing, 40, 42-57.
Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation science, 40(4), 455-472.
Sarasola, B., & Doerner, K. F. (2020). Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location. Networks, 75(1), 64-85.
Science Alert. (2022). bit.ly/3jv7iy7
Shaw, P. (1997). A new local search algorithm prioviding high quality solutions to vehicle routing problems. Working Paper, Department of Computer Science, University of Strathclyde, Glasgow, Scotland.
Sheu, J.-B. (2007). An emergency logistics distribution approach for quick response to urgent relief demand in disasters. Transportation Research Part E, 43, 687–709.
Valle, C. A., Cunha, A. S. d., Aioffi, W. M., & Mateus, G. R. (2008). Algorithms for improving the quality of service in wireless sensor networks with multiple mobile sinks, Proceedings of the 11th International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, 239-243.
Valle, C. A., da Cunha, A. S., Mateus, G. R., & Martinez, L. C. (2009). Exact algorithms for a selective vehicle routing problem where the longest route is minimized. Electronic Notes in Discrete Mathematics, 35, 133-138.
Valle, C. A., Martinez, L. C., Da Cunha, A. S., & Mateus, G. R. (2011). Heuristic and exact algorithms for a min–max selective vehicle routing problem. Computers & Operations Research, 38(7), 1054-1065.
Wen, M., Sun, W., Yu, Y., Tang, J., & Ikou, K. (2022). An adaptive large neighborhood search for the larger-scale multi depot green vehicle routing problem with time windows. Journal of Cleaner Production, 374, 1-14.
World Health Organization. (2010). Towards 100% voluntary blood donation: A global framework for action Geneva.
Yaghoubi, K. S. (2017). Consumption management of products in the blood supply chain by considering the possibility of lateral transfer between hospitals (Case study: Tehran). Journal of Industrial Management Studies, 15(47) 93-119.
Yu, V. F., Jodiawan, P., & Gunawan, A. (2021). An Adaptive Large Neighborhood Search for the green mixed fleet vehicle routing problem with realistic energy consumption and partial recharges. Applied Soft Computing, 105, 1-16.
Yu, V. F., Jodiawan, P., Ming-Lu, H., & Gunawan, A. (2021). Design of a two-echelon freight distribution system in last-mile logistics considering covering locations and occasional drivers. Transportation Research Part E, 154, 1-14.