Traveling Salesperson Problem Dataset

With our game "Perlentaucher" (in German, but playable for everyone), we observe how players solve different variants of the Traveling Salesperson problem.

The original Perlentaucher 1 replicates some TSP instances from the literature and includes some randomly generated tasks. It also varies whether the starting node is predefined and whether points are visually marked with different colors. It contains 24 levels (= TSP instances).

The sequel Perlentaucher 2 contains levels to validate our model of choosing start nodes, but can also be used for other research questions. It contains 90 levels.

Further Information

• Modeling Human Problem Solving with Data from an Online Game (Tim Rach, Alexandra Kirsch), In Cognitive Processing 17(4), 2016, doi:10.1007/s10339-016-0767-4.

• Poster presented at Dagstuhl Seminar "Resource-bounded Problem Solving", 2014