In the Team Orienteering Problem (TOP), a team of vehicles attempts to collect rewards at a given number of stops within a specified time frame. Once a vehicle visits a stop and collects its reward, no other vehicles may collect the reward. Typically, a team cannot visit all stops and therefore has to identify the “best” set of stops to visit in order to maximizes total rewards. We propose a la...

In this paper, we extend techniques developed in the context of Travelling Salesperson Problem for cycle problems. Particularly, study shrinking support graphs and exact algorithms subcycle elimination separation The efficient application considered has proved to be essential when solving large size problems by Branch-and-Cut, been motivation behind work. Regarding graphs, prove validity Padber...

In the context of DigiLab4U international project, this paper describes a simulation-based serious game that can be used as virtual teaching lab in higher education courses, especially Industrial and Systems Engineering, Data Science, Management Science Operations Research, well Computer Science. The learning activity focuses on understanding distribution logistics problems related to transport...

AUDIO ORIENTEERING is a collaborative performance environment in which physical tokens are used to navigate an invisible sonic landscape. In this paper, I describe the hardware and software used to implement a prototype audio terrain with multiple interaction modes and sonic behaviors mapped onto three-dimensional space.

The goal of information gathering is to obtain data from the environment generating an accurate model for the application of interest. In many applications the information gathering process requires to obtain measurement of the phenomena of interest in harsh or dangerous conditions (e.g., environmental monitoring applications of water in a lake or search and rescue operations in disaster respon...

We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, . . . , Sm} where each set Si is a subset of a given ground set X. In the maximum coverage problem the goal is to pick k sets from S to maximize the cardinality of their union. In the MCG problem S is partitioned into ...

The purpose of this study was to test the key predictions of the Processing Efficiency Theory (PET) in the context of a computer based orienteering task. 15 participants were placed into either high or low traitanxiety groups based on trait anxiety scores, and were subjected to two counterbalanced orienteering simulations: high and low pressure. Measures reflecting mental effort and efficiency ...

OBJECTIVES To compare the heart rate responses of women orienteers of different standards and to assess any relation between heart rate responses and age. METHODS Eighteen competitive women orienteers completed the study. They were divided into two groups: eight national standard orienteers (ages 23-67 years); 10 club standard orienteers (ages 24-67 years). Each participant had her heart rate...

Many NASA planning problems are over-subscription problems – that is, there are a large number of possible goals of differing value, and the planning system must choose a subset that can be accomplished within the limited time and resources available. Examples include planning for telescopes like Hubble, SIRTF, and SOFIA; scheduling for the Deep Space Network; and planning science experiments f...