How to win a trip around the world using C ++

Recently, a team from Faculty of Electrical Engineering (FEE, CTU) won the “Travelling Salesman Challenge 2.0” organized and sponsored by, see The task was to determine the cheapest possible tour between specific areas (set of airports) which is an NP-hard problem. The submitted algorithms have been evaluated on real data of flight ticket costs collected by the organizer. The team, consisting of two Ph.D. students Petr Váňa and Robert Pěnička, and a researcher Vojtěch Vonásek, defeated more than 100 teams from various countries. Come to find out, what was the key to their success.