Di Tore, P.A., Corona, F., & Sibilio, M. (2015). Orienteering: spatial navigation strategies and cognitive processes. J. Hum. Sport Exerc., 9(Proc1), pp.S507-S514. This work argues how the cognitive processes involved in the orienteering peculiar activities (map reading, path finding, and spatial thinking) are also involved in the management of intersubjective relationship. In essence, the skil...

In this paper, we address an optimization problem resulting from the combination of the wellknown traveling salesman and knapsack problems. In particular, we target the orienteering problem, originated in the context of sports, which consists of maximizing the total score associated with the vertices visited in a path within the available time. The problem, also known as the selective travellin...

The Orienteering Problem (OP) is a combinatorial routing problem of which the goal is to find a tour that maximises the total score earned by visiting vertices. A set of vertices is given, determined by their coordinates and a score. The pairwise travel times between the vertices are known. The total travel time should not exceed a predetermined time budget. Each vertex can be visited at most o...

The team orienteering problem (TOP) is a particular vehicle routing problem in which the aim is to maximize the profit gained from visiting customers without exceeding a travel cost/time limit. This paper proposes a new and fast evaluation process for TOP based on an interval graph model and a Particle Swarm Optimization inspired algorithm (PSOiA) to solve the problem. Experiments conducted on ...

This paper introduces a fast solution procedure to solve 100-node instances of the time-dependent orienteering problem (TD-OP) within a few seconds of computation time. Orienteering problems occur in logistic situations were an optimal combination of locations needs to be selected and the routing between the selected locations needs to be optimized. In the time-dependent variant, the travel tim...

When tourists visit a city or region, they usually cannot visit every point of interest available as they are constrained in time and budget. Tourist recommender applications help tourists by facilitating personal selection. Providing adequate tour scheduling support for these kinds of applications is a daunting task for the application developer. The objective of this article is to demonstrate...

In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as being chores one needs to run, and the sizes as the amount of time it takes to do the chore.) The goal is to adaptively decide which nodes to visit to maximize total expected reward, subject to the constraint that the...

In order to overcome the drawbacks of mathematical optimization techniques, soft computing algorithms have been vigorously introduced during the past decade. However, there are still some possibilities of devising new algorithms based on analogies with natural phenomena. A nature-inspired algorithm, mimicking the improvisation process of music players, has been recently developed and named Harm...

Abstract. The Orienteering Problem with Time Windows (OPTW) is a well-known routing problem in which a given positive profit and time interval are associated with each location. The solution to the OPTW finds a route comprising a subset of the locations, with a fixed limit on length or travel time, that maximises the cumulative score of the locations visited in the predefined time intervals. Th...

In the Team Orienteering Arc Routing Problem (TOARP) the potential customers are located on the arcs of a graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for...