Determination of a Fair Price for Blood Transportation by Applying the Vehicle Routing Problem: A Case for National Blood Center, Thailand
The National Blood Center, Thai Red Cross Society is
responsible for providing blood to hospitals all over the country.
When any hospital needs blood, it will have to send the vehicle to
pick up at the NBC. There are a lot of vehicles to pick up blood at the
NBC every day. Each vehicle is usually empty for inbound trip and a
little loaded for outbound. The NBC realized such waste or loss and
there have been the third party offered to distribute blood and charge
for fee. This paper proposes to apply the vehicle routing problem
(VRP) for estimating the fair price. The idea is tested with the real
data during seven-day period of 6 – 12 July 2010 to estimate the fair
price for transporting blood in Bangkok Metropolitan Region.
[1] S.L. Sime, "Strengthening the service continuum between transfusion
providers and suppliers: enhancing the blood services network,"
Transfusion 45, October, 2005, 206 - 223.
[2] Y. Jinxin, "Vehicle routing with time windows and time-dependent
reward: A problem from the American Red Cross," Manufacturing and
Service Operations Management 5(1), 2003, 74-77.
[3] G. Clarke, J. Wright, "Scheduling of vehicles from a central depot to a
number of delivery point," Operation Reseach 4, 1964, Volume 12.
[4] C. R. Larson, R. A. Odini, "Urban Operations Research," Prentice-Hall,
1981, Chapter 6.
[5] S. Zanakis, J. Evans, A. Vazacopoulos, "Heuristic methods and
applications: A categorized survey," European Journal of Operational
Research 43, 1981, 88-110.
[6] G. Laporte, M. Gendreau, J. Potvin, F. Semet, "Classical and modern
heuristics for the vehicle routing problem," International Transactions in
Operational Research 7, 2000, 285-300.
[7] B.G. Danzig, H.I. Ramser, "The truck dispatching problem,"
Management Science, 6(1), 1959, 80-91.
[1] S.L. Sime, "Strengthening the service continuum between transfusion
providers and suppliers: enhancing the blood services network,"
Transfusion 45, October, 2005, 206 - 223.
[2] Y. Jinxin, "Vehicle routing with time windows and time-dependent
reward: A problem from the American Red Cross," Manufacturing and
Service Operations Management 5(1), 2003, 74-77.
[3] G. Clarke, J. Wright, "Scheduling of vehicles from a central depot to a
number of delivery point," Operation Reseach 4, 1964, Volume 12.
[4] C. R. Larson, R. A. Odini, "Urban Operations Research," Prentice-Hall,
1981, Chapter 6.
[5] S. Zanakis, J. Evans, A. Vazacopoulos, "Heuristic methods and
applications: A categorized survey," European Journal of Operational
Research 43, 1981, 88-110.
[6] G. Laporte, M. Gendreau, J. Potvin, F. Semet, "Classical and modern
heuristics for the vehicle routing problem," International Transactions in
Operational Research 7, 2000, 285-300.
[7] B.G. Danzig, H.I. Ramser, "The truck dispatching problem,"
Management Science, 6(1), 1959, 80-91.
@article{"International Journal of Business, Human and Social Sciences:55833", author = "S. Pathomsiri and P. Sukaboon", title = "Determination of a Fair Price for Blood Transportation by Applying the Vehicle Routing Problem: A Case for National Blood Center, Thailand", abstract = "The National Blood Center, Thai Red Cross Society is
responsible for providing blood to hospitals all over the country.
When any hospital needs blood, it will have to send the vehicle to
pick up at the NBC. There are a lot of vehicles to pick up blood at the
NBC every day. Each vehicle is usually empty for inbound trip and a
little loaded for outbound. The NBC realized such waste or loss and
there have been the third party offered to distribute blood and charge
for fee. This paper proposes to apply the vehicle routing problem
(VRP) for estimating the fair price. The idea is tested with the real
data during seven-day period of 6 – 12 July 2010 to estimate the fair
price for transporting blood in Bangkok Metropolitan Region.", keywords = "Blood Supply Chain, Vehicle Routing Problem,
Heuristic, Saving Algorithm, Fair Price.", volume = "7", number = "2", pages = "382-6", }