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 34 for “"Orienteering problem"”.
-
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 …
-
Scheduling underway replenishment as a generalized orienteering problem
… by replenishment. With proper assumptions, 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, …
-
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 …
-
Heuristics for Solving Three Routing Problems: Close-Enough Traveling Salesman Problem, Close-Enough Vehicle Routing Problem, Sequence-Dependent Team Orienteering Problem
… dissertation, we examine three important routing problems. In the second chapter we investigate the Close-Enough Traveling Salesman Problem (CETSP) in which a salesman must get within a specified radius of each node to visit it. The third chapter studies the multi-vehicle extension of the CETSP, …
-
Two-Stage Vehicle Routing Problems with Profits and Buffers
… thesis considers the Two-Stage Vehicle Routing Problem (VRP) with Profits and Buffers, which generalizes various optimization problems that are relevant for practical applications, such as the Two-Machine Flow Shop with Buffers and the Orienteering Problem. Two optimization problems are …
-
Car patrolling problem: models and algorithms for a practical application
This Ph.D. thesis addresses a Car Patrolling Problem derived from a real-world application faced by a large Italian service provider through the development of optimization algorithms. In summary, the car patrolling problem that we face is a generalization of the well-known team orienteering …
-
Optimization models for underway replenishment of a dispersed carrier battle group
… salesman, generalized traveling salesman or orienteering problem. However, several models are further generalizations of these problems which have not been previously considered. Computational experiments using four formations from the literature and commercially available software identify …
-
Vehicle routing models in public safety and health care
… we propose some challenging vehicle routing problems in the public sector through mathematical modeling. To achieve this goal, in this dissertation, we study vehicle routing problems in two fields: i) vehicle routing model in public safety, i.e., how state troopers can patrol more efficiently …
-
Scheduling and routing Tactical Aerial Reconnaissance Vehicles
… Reconnaissance Vehicle routing and scheduling problem. the present method of routing and scheduling is presented, along with possible implications for routing and scheduling when future expansion of vehicle assets becomes available. A review of current literature is given and comparisons are …
-
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 …
-
Algorithmic solutions to orienteering problems and applications
… be described by the same family 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) …
-
UNDERSEA LOGISTICS: ROUTING OPTIMIZATION IN GRAY ZONE ENVIRONMENTS
… time-synchronized systems via a multiple-path orienteering problem. We extend that model to an undersea logistics problem in a contested environment, with heuristics to approximate global solutions. A successful model provides feasible solutions to a simple scenario for proof of concept and …
-
Applications of Genetic Algorithms, Dynamic Programming, and Linear Programming to Combinatorial Optimization Problems
Combinatorial optimization problems are important in operations research and computer science. They include specific, well-known problems such as the bin packing problem, sequencing and scheduling problems, and location and network design problems. Each of these problems has a wide variety of …
-
UAV Search Path Optimization for Recording Emerging Targets
… on an approximation of the target recording problem as an orienteering problem with time windows (OPTW), in which the time window settings for each cell are associated with the type of target-emerging condition that it represents. The second heuristic is based on a Tabu search method. To …
-
Προσωποποιημένο διαδικτυακό σύστημα γεωγραφικών πληροφοριών: εφαρμογή στον αγροτικό τομέα
… applications of ICT, and by presenting the Orienteering Problem (OP) and the Team Orienteering Problem (TOP) and multiobjective variants that could be applied in tourism in rural areas. Moreover, a new framework for the provision of personalized routes in rural areas is proposed. The …
-
Modeling trustworthy behavior and limiting the impact of selfishness
… We introduce the Prize Collecting Multiagent Orienteering Problem (PCMOP), a Game Theoretic version of the Orienteering Problem with applications to ride-sharing. We show it to be part of the class of valid utility games, then propose and analyze three policies for mitigating selfish behavior …
-
Models and algorithms for multi-agent search problems
The problem of searching for objects of interest occurs in important applications ranging from rescue, security, transportation, to medicine. With the increasing use of autonomous vehicles as search platforms, there is a need for fast algorithms that can generate search plans for multiple agents in …
-
Developing Solution Approaches for Multi-Dimensional Assignment and Orienteering Problems
This dissertation investigates two problems in combinatorial optimization: the Multi-dimensional Assignment 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, …
Page 1 of 2