Research Article
Exact and Heuristic Solutions to Minimize Total Waiting Time in the Blood Products Distribution Problem
Algorithm 2
Outline of the basic variable neighborhood search.
Input: Initial solution ; | Until the stopping criterion is met do | βInitialize: ; | βUntilββββrepeat | ββShake: Generate randomly from and set it as the incumbent solution; | ββLocal search: Apply some local search method on ; Denote with the so obtained local | ββoptimum; | ββIfββ is better than the then | ββ and set ; | ββElse | ββ (switch to another neighborhood); |
|