Max-min ant system algorithm for dartboard design

Authors:
Aristidis Vlachos;Ioannis Trichas
Affiliations:
University of Piraeus, M. Karaoli & A. Dimitriou 80, 18534 Piraeus, Greece;University of Piraeus, M. Karaoli & A. Dimitriou 80, 18534 Piraeus, Greece
Venue:
International Journal of Computational Intelligence Studies
Year:
2013

Citing 7
Cited 0

Arranging n distinct numbers on a line or a circle to reach extreme total variations

European Journal of Combinatorics
The ant colony optimization meta-heuristic

New ideas in optimization
Ant algorithms for discrete optimization

Artificial Life
MAX-MIN Ant system

Future Generation Computer Systems
Ant Colony Optimization

Ant Colony Optimization
Darts and hoopla board design

Information Processing Letters
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

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.