A trail of multi-level intensifying search for optimum of combinatorial optimization problems

摘要

We propose a meta heuristics for combinatorial optimization problems, that is, first we divide feasible solutions into 4 groups using 3 water levels, and then search the optimum more intensively in the higher water level than in the lower one. We showed the meta heuristics could much faster than the tabu search when applied to the resource leveling problems.