On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem
This paper introduces an interesting meta-heuristic called Meta-RaPS (Meta-heuristic for Randomized Priority Search) for solving combinatorial problems . Meta-RaPS incorporates randomness within priority rules to construct a feasible solution at each iteration. In addition, Meta-RaPS includes improvement heuristics for enhancing the feasible solution already obtained. Applications discussed include: Traveling Salesman Problem, Resource Constrained Project Scheduling Problem, and Knapsack Problem.