Abstract The Orienteering Problem (OP) has received a lot of attention in the past few
decades. The OP is a routing problem in which the goal is to determine a subset of nodes to …

Abstract The Orienteering Problem with Time Windows (OPTW) is a combinatorial
optimization problem where the goal is to maximize the total score collected from different …

This study investigates the team orienteering problem with time windows and mandatory
visits (TOPTW-MV), a new variant of the well-known team orienteering problem with time …

Abstract The Team Orienteering Problem with Time Windows (TOPTW) is the extension of
the Orienteering Problem (OP) where each node is limited by a predefined time window …

Automatic itinerary planning is a crucial and challenging issue in tourism. This paper
proposes a novel automatic planning method to suggest multiple itineraries that satisfy the …

Experiencing local food while making a trip has a significant impact on the overall tourist
experience. No wonder that visiting local restaurants has become an integral part of a tourist …

Abstract The Team Orienteering Problem with Time Windows (TOPTW) is an extension of
the well-known Orienteering Problem. Given a set of locations, each one associated with a …

The tourism industry is witnessing high growth in recent years leading to a large number of
options for a tourist. Personalised tourist trip design is faced with many places of interests …

Hyper-heuristics are widely used for solving numerous complex computational search
problems because of their intrinsic capability to generalize across problem domains. The fair …

The orienteering problem with time windows and synchronisation constraints, known as the
Cooperative Orienteering Problem with Time Windows (COPTW), is a class of problems with …