A comparative study of metaheuristic algorithms for dartboard design

The problem of optimally locating the numbers around a dartboard is a Combinatorial Optimization problem. In this paper, we´re solving this problem using Ant System and Max-Min Ant System (MMAS) algorithm. The algorithm reinforces local search in neighborhood of the best solution found in each iteration while implementing methods to slow convergence and facilitate exploration. Both algorithms have been proved to be very effective in finding optimum solution to hard combinatorial optimization problems.