Heuristics
We will use the following variants of greedy random in our research.
Steepest Climbing Greedy Random (SCGR)
Essentially this is steepest climbing pretending to be GR. It runs lots of very short mini-cycles and attempts to duplicate what GR does while still optimizing using steepest search.
Greedy Random Multiple Move - (MMGR-n)
Greedy Random doing n random moves rather than just one.
Greedy Random Non-Constrained (GRNC)
A variant of Greedy Random that leaves the moved customer(s) at high.
Greedy Random Low (GRLO)
A variant of Greedy Random that leaves the moved customer(s) at low.