Gamesourcing: an unconventional tool to assist the solution of the traveling salesman problem

Abstract

This paper presents an approach to solve the variant of the well-known Travelling Salesman Problem (TSP) by using a gamesourcing approach. In contemporary literature is TSP solved by wide spectra of modern as well as classical computational methods. We would like to point out the possibility to solve such problems by computer game plying that is called a gamesourcing. Gamesourcing can be understood as a version of game-driven crowdsourcing. The main part and contribution of this paper is a demonstration of gamesourcing use in the game called Labyrinth that reflects TSP structure. The game has a form of a maze-labyrinth that enables players to move through it like the Ant Colony Optimization. The playing of the Labyrinth, thus, by playing, solves the problem. The performance of the "human ant-like system" is then evaluated and compared against some well-known versions of ACO. As we believe, our experiments suggest that this approach can serve as an alternative way that employs gamesourcing to assist a combinatorial optimizer in achieving better results on a well-known NP-hard optimization problem.