||Design and Analysis of ACO‐algorithms for edge‐matching problems
||Dissing Söderlind, Carl Martin
||Witt, Carsten (Algorithms and Logic, Department of Informatics and Mathematical Modeling, Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark)
||Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark
||Ant colony optimization algorithms are getting more and more accepted as
optimization algorithms since the first version was introduced in 1991. Back
then it did not perform very well but several improvements changed that and
the ACO algorithms are now seen as very well performing algorithms on a
number of problems.
The edge matching puzzle is an old but interesting problem which has gained
extra attention by mathematicians by the Eternity II release in 2007 with a
first price of $2.000.000 for the first to solve a very hard edge matching puzzle.
The purpose of this thesis is to try to create an ACO algorithm to work on
edge matching puzzles.
The problem will be studied in order to see what makes one puzzle harder to
solve than another.
||Technical University of Denmark (DTU) : Kgs. Lyngby, Denmark
Creation date: 2010-03-22
Update date: 2011-01-20