A Methodology to Determine the Subset of Heuristics for Hyperheuristics through Metalearning for Solving Graph Coloring and Capacitated Vehicle Routing Problems

<table class="algorithm-group"><tr><td><table class="algorithm" id="alg2"><tr><td>(1)</td><td>ls ← IncumbentSolution</td></tr><tr><td>(2)</td><td>while! LocalStopCriteria() do</td></tr><tr><td>(3)</td><td> hi = Perturbate()</td></tr><tr><td>(4)</td><td> ls∗ = apply(hi, ls)</td></tr><tr><td>(5)</td><td> if f(ls∗) &lt; f(ls) then</td></tr><tr><td>(6)</td><td>  ls = ls∗'</td></tr><tr><td>(7)</td><td> end if</td></tr><tr><td>(8)</td><td>end while</td></tr><tr><td>(9)</td><td>return ls</td></tr></table></td></tr></table>

Complexity

alg2

Algorithm 2

Algorithm 2: A Methodology to Determine the Subset of Heuristics for Hyperheuristics through Metalearning for Solving Graph Coloring and Capacitated Vehicle Routing Problems 

Algorithm 2 | A Methodology to Determine the Subset of Heuristics for Hyperheuristics through Metalearning for Solving Graph Coloring and Capacitated Vehicle Routing Problems 