Tourists have the difficult task to schedule their holiday activities in such a way that they enjoy their holiday as much as possible, while keeping the opening times and exact locations of attractions in mind. This task can be formulated as the team orienteering problem with time windows (TOPTW). The TOPTW uses a list of locations as input, together with their opening times and appreciation sc...

In this paper, we introduce a variant of the orienteering problem in which travel and service times are stochastic. If a delivery commitment is made to a customer and is completed by the end of the day, a reward is received, but if a commitment is made and not completed, a penalty is incurred. This problem reflects the challenges of a company who, on a given day, may have more customers than it...

This paper designs a tour recommendation scheme for electric vehicles and analyzes its performance. Aiming at reducing the time waste brought by long charging time, the recommender not just decides a visiting and charging schedule for the given set of userselected tour spots but also integrate additional places, which have chargers and provide tour activities. Genetic operators, such as reprodu...

Given a graph whose nodes and edges are associated with a profit, a visiting (or traversing) time and an admittance time window, the Mixed Team Orienteering Problem with Time Windows (MTOPTW) seeks for a specific number of walks spanning a subset of nodes and edges of the graph so as to maximize the overall collected profit. The visit of the included nodes and edges should take place within the...

The article substantiates the need to introduce sports orienteering as an effective means of physical training future officers Armed Forces in educational process higher education. In introducing officers, there was improvement level special fitness, development physical, psychological, moral and volitional qualities formation applied skills cadets. Sports is a sport that harmoniously combines ...

We consider the rooted orienteering problem in Euclidean space: Given n points P R d , a root point s ∈ and budget B > 0 find path that starts from has total length at most visits as many of possible. This is known to be NP-hard, hence we study ( 1 − δ ) -approximation algorithms. The previous Polynomial-Time Approximation Scheme (PTAS) for this problem, due Chen Har-Peled (2008), runs time O /...

We report on a playful introduction of optimization in high school. The final event this experience has been an orienteering competition, which the decision-making component plays central role. This type very involving, and it boosted interest students toward operations research. After summarizing activities class that preceded we describe detail organization aspects outcome. also provide simpl...

This study investigated the heart rate profiles of 16 experienced, competitive orienteers (aged 15-62 years) during three competitive events. Each competitor was assessed over three different types of course which were classified as: fast run (FR), slow run (SR) and highly physical (HP). The results showed that all subjects recorded heart rates that were between 140 and 180 beats min-1 for the ...