ADVERTISEMENT

Home|Journals|Articles by Year|Audio Abstracts
 

Research Article

JEAS. 2025; 12(2): 101-106


A Mixed Integer Linear Programming Approach to Optimize the Capacitated Warehouse Location: a case study of blood donation and distribution in Saudi Arabia

Abdulhadi A. Altherwi.



Abstract
Download PDF Post

This paper discusses the optimization of the Capacitated Warehouse Location Problem (CWLP) under uncertain demand and supply. We propose an optimization framework that addresses the CWLP by considering blood distribution to identify optimal blood center locations. The objective is to meet all blood orders at the lowest possible cost, subject to warehouse capacity constraints. This study applies the framework to cities in the Kingdom of Saudi Arabia with high demand for blood delivery. We utilized census data from selected cities, with a representative sample of each city designated as a customer base. A novel mixed-integer linear programming (MILP) model was developed and solved using Python to determine the minimum total transportation and fixed costs for blood center construction. The proposed warehouse locations are presented on a map, showing each city connected to its optimal blood center warehouse.

Key words: Keywords: Mixed Integer Linear Programming; Capacitated Warehouse Location Problem; Optimization.







Bibliomed Article Statistics

4
69
31
R
E
A
D
S

3

97

57
D
O
W
N
L
O
A
D
S
120102
20252026

Full-text options


Share this Article


Online Article Submission
• ejmanager.com




ejPort - eJManager.com
Author Tools
About BiblioMed
License Information
Terms & Conditions
Privacy Policy
Contact Us

The articles in Bibliomed are open access articles licensed under Creative Commons Attribution 4.0 International License (CC BY), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.