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

<table class="table-group" id="tab8"><tr><td><table class="table"><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr class="thead"><td align="left">Number of vehicle(s)</td><td align="center">Maximum allowed travelling distance </td></tr><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr><td align="left">1</td><td align="center">220 km</td></tr><tr><td align="left">2</td><td align="center">120 km</td></tr><tr><td align="left">3</td><td align="center">80 km</td></tr><tr class="table-tr"><td colspan="2"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

The limit on travelling distances for vehicles.

Advances in Operations Research

tab8

Table 8

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