Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 80 for “"Orienteering"”.

  1. Abordagens heurísticas aplicadas ao Thief Orienteering Problem

    Este trabalho aborda o Thief Orienteering Problem, um problema multicomponente que combina dois problemas combinatórios conhecidos: o problema da mochila e o problema de orientação. Nesse problema, uma pessoa (denominada de ladrão) carrega uma mochila capacitada e possui um limite de tempo para …

    brazil-ufv Repository record for Abordagens heurísticas aplicadas ao Thief Orienteering Problem (opens in a new tab)

  2. EXPLOITING FLOWS FOR ORIENTEERING AND PLANNING PROBLEMS

    … is in the formulation of new variants of the Orienteering Problem to address task planning in flows. We begin by first examining a problem that focuses on the high level problem of task planning, but abstracts away the environment and assumes that the low-level path planning is solved …

    penn Repository record for EXPLOITING FLOWS FOR ORIENTEERING AND PLANNING PROBLEMS (opens in a new tab)

  3. Algorithmic solutions to orienteering problems and applications

    … of algorithmic problems, variations of the Orienteering Problem (OP).The OP is an algorithmic problem which is described as follows: Given (a) a graph where all nodes are tagged with a profit and a visiting time, and edges are tagged with a travelling time, (b) the initial and final node, as …

    greece Repository record for Algorithmic solutions to orienteering problems and applications (opens in a new tab)

  4. Approximation Algorithms for Network Design and Orienteering

    Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-07-16T16:48:21Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Korula_Nitish_Source.zip: 227797 bytes, checksum: 09732975f85c1988e787abe3e1a23600 (MD5) Korula_Nitish.pdf: 1461228 bytes, …

    uiuc Repository record for Approximation Algorithms for Network Design and Orienteering (opens in a new tab)

  5. Scheduling underway replenishment as a generalized orienteering problem

    … this problem in analogous to the Generalized Orienteering Problem. A dynamic programming algorithm is developed using this approach and tested against a set of test problems. The algorithm is capable of scheduling replenishment using both Delivery Boy, or Circuit Rider tactics. The results …

    nps Repository record for Scheduling underway replenishment as a generalized orienteering problem (opens in a new tab)

  6. Algorithms on Clustering, Orienteering, and Conflict -Free Coloring

    In the last part, we present randomized algorithms for online conflict-free coloring of points in the plane, with respect to intervals, halfplanes, congruent disks, and nearly-equal axis-parallel rectangles. In all these cases, the coloring algorithms use O(log n) colors, with high probability. We …

    uiuc Repository record for Algorithms on Clustering, Orienteering, and Conflict -Free Coloring (opens in a new tab)

  7. Developing Solution Approaches for Multi-Dimensional Assignment and Orienteering Problems

    … Problem (MAP) with decomposable costs and the Orienteering Problem with Stochastic Profits (OPSP). Both problems have crucial real-world applications in areas such as inventory management, logistics, manufacturing, network design, and rescue missions. The MAP extends the classical assignment …

    buffalo Repository record for Developing Solution Approaches for Multi-Dimensional Assignment and Orienteering Problems (opens in a new tab)

  8. A generalized orienteering problem for optimal search and interdiction planning

    … operations, we introduce a generalized Orienteering Problem (OP) where transit on arcs in a network and reward collection at nodes both consume a variable amount of the same limited resource. We exploit this resource trade-o_ through a specialized branch-and-bound algorithm that relies …

    nps Repository record for A generalized orienteering problem for optimal search and interdiction planning (opens in a new tab)

  9. Rendering the Unseen - Utilizing Visualization for Establishing Key Factors for Understandability of Orienteering on TV

    Orienteering broadcasts have lately been in the forefront of taking use of different mediums to create exciting broadcasts. But with a large, remote playing fields compared to other sports it suffers from its consequences. With only small fractions of orienteering races being caught on camera, …

    chalmers Repository record for Rendering the Unseen - Utilizing Visualization for Establishing Key Factors for Understandability of Orienteering on TV (opens in a new tab)

  10. Ryšio mažame lauke panaudojimas orientavimosi sporte /

    … utilized. The aim of this thesis is to improve orienteering sports using NFC technology. Firstly, in this final work orienteering sport is analysed. It is identified how punching happens at control points and what are the main problems of orienteering sports. Secondly, operating principles of …

    vilnius Repository record for Ryšio mažame lauke panaudojimas orientavimosi sporte / (opens in a new tab)

  11. Using Orienteering to Examine the Interactions of Exercise and Cognitive Training on Human Cognition and Brain-Derived Neurotrophic Factor

    … combined with cognitive training. The sport of orienteering simultaneously combines exercise with spatial navigation and therefore may result in greater cognitive benefits than exercising only, especially when performed at a vigorous intensity. Therefore, the aim of the present study was to …

    mcmaster Repository record for Using Orienteering to Examine the Interactions of Exercise and Cognitive Training on Human Cognition and Brain-Derived Neurotrophic Factor (opens in a new tab)

  12. Heuristics for Solving Three Routing Problems: Close-Enough Traveling Salesman Problem, Close-Enough Vehicle Routing Problem, Sequence-Dependent Team Orienteering Problem

    … chapter, we solve the Sequence-Dependent Team Orienteering Problem (SDTOP) in which the profit received for each node visited is dependent on the sequence in which all the nodes are visited. We summarize the dissertation in the final chapter. The CETSP, CEVRP, and SDTOP have application in …

    maryland Repository record for Heuristics for Solving Three Routing Problems: Close-Enough Traveling Salesman Problem, Close-Enough Vehicle Routing Problem, Sequence-Dependent Team Orienteering Problem (opens in a new tab)

  13. Map position finding accuracy in a computer simulated environment

    … is also the basic skill required for successful orienteering. At Virginia Polytechnic Institute and State University orienteering exercises aid in building students map position finding skills. Unfortunately, the outdoor nature of orienteering limits classroom use. Bad weather, lack of suitable …

    vt Repository record for Map position finding accuracy in a computer simulated environment (opens in a new tab)

  14. Measuring an orienteer's performance: a method based on lower rank approximation of asymmetric matrices

    … measures the performance of competitors in an orienteering course. The measures proposed will allow the comparison of the orienteer’s performance with other competitors running the same course, and with his/her performance in different courses. This thesis presents two main contributions, the …

    the-open-u Download PDF for Measuring an orienteer's performance: a method based on lower rank approximation of asymmetric matrices (opens in a new tab)

  15. UAV Search Optimization for Recording Emerging Targets with Random View Times

    … selecting time windows for each node, the Orienteering and the Team Orienteering Problem with Time Windows, (OPTW) and (TOPTW) respectively, are proposed as heuristics to obtain routes for a UAV to maximize the expected number of recorded targets. To investigate the effectiveness of the …

    buffalo Repository record for UAV Search Optimization for Recording Emerging Targets with Random View Times (opens in a new tab)

Page 1 of 4