Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem

DOI10.1155/2012/393890MaRDI QIDQ447561zbMATH OpenOpenAlexWikidataFDO

Authors Amir Salehipour, Mohammad Mehdi Sepehri

Publication date 4 September 2012

Published in Advances in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2012/393890

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Management decision making, including multiple objectives (90B50) Case-oriented studies in operations research (90B90) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: This paper presents a novel application of operations research to support decision making in blood distribution management. The rapid and dynamic increasing demand, criticality of the product, storage, handling, and distribution requirements, and the different geographical locations of hospitals and medical centers have made blood distribution a complex and important problem. In this study, a real blood distribution problem containing 24 hospitals was tackled by the authors, and an exact approach was presented. The objective of the problem is to distribute blood and its products among hospitals and medical centers such that the total waiting time of those requiring the product is minimized. Following the exact solution, a hybrid heuristic algorithm is proposed. Computational experiments showed the optimal solutions could be obtained for medium size instances, while for larger instances the proposed hybrid heuristic is very competitive.

Recommendations

• A blood bank network design problem with integrated facility location, inventory and routing decisions
• Optimization of blood sample collection with timing and quality constraints
• Blood collection management: methodology and application
• Delivery strategies for blood products supplies
• Blood Inventory Management: An Overview of Theory and Practice

Cites work

• A new formulation for the traveling deliveryman problem
• A probabilistic heuristic for a computationally difficult set covering problem
• Blood Inventory Management: An Overview of Theory and Practice
• Delivery strategies for blood products supplies
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 1488097 (Why is no real title available?)
• Optimization by simulated annealing
• P-Complete Approximation Problems
• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• The Delivery Man Problem and Cumulative Matroids
• The traveling salesman problem with cumulative costs
• Using simulation to improve the blood supply chain
• Variable neighborhood search for the p-median
• Variable neighborhood search: Principles and applications

Cited in

(3)

• A survey on the applications of variable neighborhood search algorithm in healthcare management
• Simulated annealing for the blood pickup routing problem
• Bi-objective blood product scheduling under blood shortage and limited supply

This page was built for publication: Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q447561)