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

Algorithm 1

Outline of the GRASP for the TRP.

𝑈←{0,𝑣₁,𝑣₂,…,𝑣_𝑛};

𝑣_𝑐←0;

Repeat

  Create RCL with α vertices 𝑣_𝑖∈𝑈 closest to 𝑣_𝑐;

  Select random vertex 𝑣_𝑟∈ RCL;

   𝑈←𝑈{𝑣_𝑟};

   𝑣_𝑐←𝑣_𝑟

Until  𝑈=∅;