Semi-greedy heuristics: An empirical study (Q1821033)

Given p or c, a semi-greedy heuristic chooses each iteration's decision randomly from among those decisions resulting in objective value improvements either within p\% of the best improvement or among the c best improvements. In the context of vehicle routing, we empirically compare the single use of a greedy heuristic with repeated use of a semi- greedy heuristic.