Replication Data for: Orienteering Problem with Functional Profits for multisource dynamic path construction

Orienteering problem (OP) is a routing problem, where the aim is to generate the path through the set of nodes, which would maximize the total score and would not exceed the budget. OP was adopted for solving a number of important tasks, e.g. mobile crowdsourcing, production and tourist trip design. In this work, we present the generalized process of solving orienteering problems and put it into practice by developing the open-source framework for solving OP tasks. The used dataset combines data from official city guide "Visit Petersburg", TripAdvisor, Foursquare and Instagram and contains 5368 places. Automatic paths were obtained for three OP tasks related to the tourist trip design problem and results were validated by the survey with 104 participants: up to 83% prefer our itinerary to existing one.