2025-10-28 カナダ・コンコルディア大学
＜関連情報＞
- https://www.concordia.ca/news/stories/2025/10/28/drones-could-cut-travel-delays-and-reduce-spoilage-of-donated-blood-new-concordia-study-shows.html
- https://www.sciencedirect.com/science/article/abs/pii/S0305054825002825
ドローン支援によるモバイル血液収集問題：ローリングホライズンベースの数学的 Drone-aided mobile blood collection problem: A rolling-horizon-based matheuristic
Amirhossein Abbaszadeh, Hossein Hashemi Doulabi
Computers & Operations Research Available online: 28 August 2025
DOI:https://doi.org/10.1016/j.cor.2025.107253
Highlights
- A MILP model is developed for a novel drone-aided mobile blood collection problem.
- A rolling-horizon-based matheuristic is proposed to efficiently solve the problem.
- The performance of the proposed algorithm is evaluated through a comprehensive computational study.
- The practical relevance of the studied problem is demonstrated using a real-world case study in Quebec City.
Abstract
This study introduces the drone-aided mobile blood collection problem, which integrates mobile blood donation vehicles with drones to improve operations related to the blood collection in urban areas. Each vehicle, carrying multiple drones, travels to several collection sites to conduct blood collection operations within a working day. Drones fly between vehicles to pick up collected blood bags and deliver them to the blood center. This collaborative framework enhances the performances of the collection system and ensures the freshness of collected blood upon arrival to the blood center. We develop a novel mixed-integer linear programming model to optimally synchronize the routes and collection schedules of mobile units and drones to ensure the timely delivery of collected blood to the blood center. We also develop a rolling-horizon-based matheuristic to solve large-scale instances of the problem. This algorithm combines a rolling horizon approach, which divides the problem into manageable subproblems solved sequentially, with a local branching technique that enhances solutions by exploring promising neighborhoods. To evaluate the algorithm’s performance, we conduct a comprehensive computational study. Our results show that the proposed algorithm not only finds better solutions than those obtained by Gurobi but also outperforms other matheuristics, including the rolling horizon, relax-and-fix, and fix-and-optimize algorithms. Finally, we demonstrate the real-life applicability of the problem through a case study in Quebec City, Canada.
