DocumentCode
1784759
Title
A comparative study of metaheuristic algorithms for dartboard design
Author
Trichas, Ioannis ; Drosos, Christos ; Vlachos, Aristidis
Author_Institution
Dept. of Inf., Univ. of Piraeus, Piraeus, Greece
fYear
2014
fDate
7-9 July 2014
Firstpage
403
Lastpage
408
Abstract
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.
Keywords
combinatorial mathematics; game theory; minimax techniques; search problems; MMAS algorithm; convergence; dartboard design; hard combinatorial optimization problems; local search; max-min ant system algorithm; metaheuristic algorithms; Ant System (AS); Combinatorial optimization problems; Max-Min Ant System (MMAS); algorithm; game of darts;
fLanguage
English
Publisher
ieee
Conference_Titel
Information, Intelligence, Systems and Applications, IISA 2014, The 5th International Conference on
Conference_Location
Chania
Type
conf
DOI
10.1109/IISA.2014.6878759
Filename
6878759
Link To Document