Mobile blood collection has the advantage of greater reach compared to blood drives at fixed donation sites and is preferable for individuals with limited time or means of transportation. Bloodmobiles are widely used in healthcare logistics to increase the number of donors and donation frequency and to better match blood demand with collection. Bloodmobiles are stationed at predetermined locations, while shuttles are assigned to visit these locations to collect the donated blood. This problem is formulated as the Selective Vehicle Routing Problem under the Bloodmobile System (SVRP-BM). This research extends the Selective Vehicle Routing Problem with Integrated Tours problem (SVRPwIT) by considering: (i) multiple shuttles, (ii) multiple blood types, (iii) multiple trips for the bloodmobiles, and (iv) the visiting availability of the donation sites. The proposed adaptive large neighborhood search (ALNS) algorithm, with a simulated annealing (SA) acceptance criterion, is tested on generated instances adopted from a real-life case of the Surabaya Red Cross. SVRP-BM provides a strategic solution to Surabaya’s blood shortage by optimizing blood collection.