Applying Copeland Voting to Design an Agent-Based Hyper-Heuristic

Meta-heuristics are algorithms which are applied to solve problems when conventional algorithms can not find good solutions in reasonable time; evolutionary algorithms are perhaps the most well-known examples of meta-heuristics. As there are many possible meta-heuristics, finding the most suitable meta-heuristic for a given problem is not a trivial task. In order to make this choice, one can design hyperheuristics. In the literature, one can find some agent-based research whose focus is to propose a framework where metaheuristics are considered as agents, that solve a given problem in a collaborative or competitive way. Most of these works focus on mono-objective meta-heuristics. Other works focus on how to select multi-objective meta-heuristics, but not using an agent-based approach. We present in this work an agent-based hyper-heuristic for choosing the most suitable evolutionary meta-heuristic for a given problem. Our approach performs a cooperative Copeland voting procedure, considering five different metrics, to define which one of three competitive evolutionary meta-heuristics should execute during a certain processing time. We use the Walking Fish Problem (WFG) suite with two and three objectives to analyse the proposed approach performance. The obtained results showed that in all cases our strategy found the most indicated evolutionary algorithm and gets competitive results against the state of art. CCS Concepts •Computing methodologies → Multi-agent systems;