Title: Max-min ant system algorithm for dartboard design

Authors: Aristidis Vlachos; Ioannis Trichas

Addresses: University of Piraeus, M. Karaoli & A. Dimitriou 80, 18534 Piraeus, Greece ' University of Piraeus, M. Karaoli & A. Dimitriou 80, 18534 Piraeus, Greece

Abstract: The problem of optimally locating the numbers around a dartboard is a combinatorial optimisation problem. In this paper, we are solving this problem using max-min ant system (MMAS) algorithm. The algorithm reinforces local search in neighbourhood of the best solution found in each iteration while implementing methods to slow convergence and facilitate exploration. MMAS algorithm has been proved to be very effective in finding optimum solution to hard combinatorial optimisation problems.

Keywords: combinatorial optimisation; max-min ant system; MMAS; algorithm; darts; dartboard design; ACO; ant colony optimisation; local search.

DOI: 10.1504/IJCISTUDIES.2013.057640

International Journal of Computational Intelligence Studies, 2013 Vol.2 No.3/4, pp.367 - 378

Received: 14 Feb 2013
Accepted: 14 Feb 2013
Published online: 19 Jul 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article