Search results for "Orienteering"
showing 10 items of 13 documents
Perceptual-Cognitive Skills and Performance in Orienteering
2008
The goal was analysis of the perceptual-cognitive skills associated with sport performance in orienteering in a sample of 22 elite and 17 nonelite runners. Variables considered were memory, basic orienteering techniques, map reading, symbol knowledge, map-terrain-map identification, and spatial organisation. A computerised questionnaire was developed to measure the variables. The reliability of the test (agreement between experts) was 90%. Findings suggested that competence in performing basic orienteering techniques efficiently was a key variable differentiating between the elite and the nonelite athletes. The results are discussed in comparison with previous studies.
Graduate of Riga Polytechnic Institute, Engineer, Inventor and Athlete Arno Līcis
2019
The article summarizes the career of a graduate of the Faculty of Mechanics (1964) of Riga Polytechnic Institute Arno Līcis. The article reveals and describes his work while being an engineer at the Riga Electromachine Building Factory (RER), at the Latvian Scientific Research Institute of Trauma- tology and Orthopaedics (LSRITO) and in the printing house «Jāņa sēta», as well as being an inventor. It has been discovered that he had promoted orienteering sports and had significant achievements in competitions of various scale, inclu- ding mass competition named «Magnēts» managed by him, which had been taking place since 1969. This is the first research on the life and professional activities…
Urban Orienteering Competitions – A Unique Activity of Didactic Communication
2014
Abstract The aim of our project was to deepen understanding of the legacy of our predecessors, which are to be found in the historical centre of Sibiu, to develop map reading skills using the techniques and rules of orienteering. Most students participated enthusiastically in the search for historical sights and found the activity extremely attractive. Moreover, both the preparation stage, when the students learnt all together or in groups how to use a map in order to locate the historical sights, and the follow-up stage, when they disseminated the results, contributed to developing team spirit and a sense of belonging. Communication among students and with the form teacher also improved an…
Psychophysiological responses of junior orienteers under competitive pressure
2018
The purpose of the study was to examine psychobiosocial states, cognitive functions, endocrine responses (i.e., salivary cortisol and chromogranin A), and performance under competitive pressure in orienteering athletes. The study was grounded in the individual zones of optimal functioning (IZOF) and biopsychosocial models. Fourteen junior orienteering athletes (7 girls and 7 boys), ranging in age from 15 to 20 years (M = 16.93, SD = 1.77) took part in a two-day competitive event. To enhance competitive pressure, emphasis was placed on the importance of the competition and race outcome. Psychophysiological and performance data were collected at several points before, during, and after the ra…
Mechanical jumping power in young athletes.
1987
Mechanical jumping power was determined for 286 young male athletes representing six sports events and ranging in calendar and skeletal ages from 8.8 to 17.1 and from 7.8 to 18.1 years, respectively. The subjects performed successive maximal vertical jumps on a contact mat for 30 s. The number of jumps and their cumulative flight time after 15 and 30 s were used for calculations of mechanical power. The jumping performances of the young athletes were found to be reproducible from the age of 10-12 years in respect to the angular displacement of the knee and duration of contact. Absolute mechanical power, as well as power related to body weight, increased with calendar and skeletal ages. Of t…
A branch-and-cut algorithm for the Orienteering Arc Routing Problem
2016
[EN] In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified. In the Orienteering Arc Routing Problem (OARP),in addition to a set of regular customers that have to be serviced, a set of potential customers is available. From this latter set, customers have to be chosen on the basis of an associated profit. The objective is to find a route servicing the customers which maximize the total profit collected while satisfying a given time limit on the route.In this paper, we describe large families of facet-inducing inequalities for the OARP and present a branch-and-cut algorithm for its solution. The exact algorithm embeds a procedure which builds…
A matheuristic for the Team Orienteering Arc Routing Problem
2015
In the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed 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 the TOARP and test it on a set of benchmark instances for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances (with up to 27 vertices and 296 arcs). The average error o…
A grid ant colony algorithm for the orienteering problem
2005
In this paper we propose a distributed ant colony algorithm to solve large scale orienteering problem instances. Our approach is based on a multi-colony strategy where each colony works in an independent portion (cluster) in the original graph. This results in no need for communicating pheromones information among colonies and in increasing speedup. We have implemented our algorithm as a .NET Web services infrastructure following a grid computing philosophy and we provide some promising experimental results to show the feasibility and effectiveness of our approach
Multiobjective GRASP with Path Relinking
2015
In this paper we review and propose different adaptations of the GRASP metaheuristic to solve multiobjective combinatorial optimization problems. In particular, we describe several alternatives to specialize the construction and improvement components of GRASP when two or more objectives are considered. GRASP has been successfully coupled with Path Relinking for single-objective optimization. Moreover, we propose different hybridizations of GRASP and Path Relinking for multiobjective optimization. We apply the proposed GRASP with Path Relinking variants to two combinatorial optimization problems, the biobjective orienteering problem and the biobjective path dissimilarity problem. We report …
A branch-and-cut algorithm for the Team Orienteering Problem
2017
The Team Orienteering Problem aims at maximizing the total amount of profit collected by a fleet of vehicles while not exceeding a predefined travel time limit on each vehicle. In the last years, several exact methods based on different mathematical formulations were proposed. In this paper, we present a new two-index formulation with a polynomial number of variables and constraints. This compact formulation, reinforced by connectivity constraints, was solved by means of a branch-and-cut algorithm. The total number of instances solved to optimality is 327 of 387 benchmark instances, 26 more than any previous method. Moreover, 24 not previously solved instances were closed to optimality.