Exact and Heuristic Solutions to Minimize Total Waiting Time in the Blood Products Distribution Problem

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="393890.fig.001a" src="https://static.hindawi.com/articles/aor/volume-2012/393890/figures/393890.fig.001a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b> The geographical location of 50 hospitals</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="393890.fig.001b" src="https://static.hindawi.com/articles/aor/volume-2012/393890/figures/393890.fig.001b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b> A set of 15 hospitals covered by vehicle 1 (the visiting route is not shown)</td></tr></table></td></tr><tr class="fig-image" id="c"><td><img alt="393890.fig.001c" src="https://static.hindawi.com/articles/aor/volume-2012/393890/figures/393890.fig.001c.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(c) </b> A set of 35 hospitals covered by vehicle 2 (the visiting route is not shown)</td></tr></table></td></tr></table>

<table>An illustration of the problem where 50 hospitals are covered by two vehicles.</table>

Advances in Operations Research

fig1

Figure 1

Figure 1: Exact and Heuristic Solutions to Minimize Total Waiting Time in the Blood Products Distribution Problem 