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 28 for “"Arc-Routing"”.

  1. A time buffered arc routing problem

    Arc routing problems are prevalent in our world today. They are important to society and businesses on a daily basis. The purpose of this work is to consider a problem that has not been addressed in the literature. That problem is how to find the maximal weighted tour of an undirected set of arcs …

    missouri Repository record for A time buffered arc routing problem (opens in a new tab)

  2. Solving, Generating, and Modeling Arc Routing Problems

    Arc routing problems are an important class of network optimization problems. In this dissertation, we develop an open source library with solvers that can be applied to several uncapacitated arc routing problems. The library has a flexible architecture and the ability to visualize real-world …

    maryland Repository record for Solving, Generating, and Modeling Arc Routing Problems (opens in a new tab)

  3. Multiple Drone and Truck Arc Routing Problem

    … thesis we introduce the Multiple Drone and Truck Arc Routing Problem (MDTARP) which considers a fleet of drones used in synchronization with a ground vehicle to provide service to edges in a network within a given time-horizon. Drones launch from a ground vehicle to perform services on a set of …

    concordia Download PDF for Multiple Drone and Truck Arc Routing Problem (opens in a new tab)

  4. Exact and Heuristic Approaches to Arc Routing Problems

    … problems, known collectively as Vehicle Routing Problems (VRPs). Due to their importance, VRPs have received a great deal of attention from the Operational Research and Combinatorial Optimisation communities. This thesis, which essentially consists of four papers, makes additional …

    lancaster Download PDF for Exact and Heuristic Approaches to Arc Routing Problems (opens in a new tab)

  5. MULTI-FLIGHT ALGORITHMS FOR MULTI-UAV ARC ROUTING PROBLEM

    … roads and prevent accidents. The problem of routing UAVs optimally to collect visual information regarding icy roads is called Icy Road Vehicle Routing Problem. Vehicle Routing Problem is essentially a path planning problem, where optimal paths need to be determined for one or more vehicles. …

    maryland Repository record for MULTI-FLIGHT ALGORITHMS FOR MULTI-UAV ARC ROUTING PROBLEM (opens in a new tab)

  6. Solving arc routing problems for winter road maintenance operations

    … is formulated as a variation of the capacitated arc routing problem (CARP) to minimize total travel distance. A metaheuristic algorithm, memetic algorithm (MA), is developed to find nearly optimal solutions. This is the first study that developed the model that includes all the constraints …

    iastate Repository record for Solving arc routing problems for winter road maintenance operations (opens in a new tab)

  7. Advancing optimization and evaluation for dynamic capacitated arc routing problems

    The Capacitated Arc Routing Problem (CARP) is a challenging combinatorial optimization problem abstracted from real-world applications, such as waste collection and road gritting. It aims at scheduling a fleet of vehicles, each with a limited capacity, to serve a series of tasks in a graph spending …

    birmingham Download PDF for Advancing optimization and evaluation for dynamic capacitated arc routing problems (opens in a new tab)

  8. Development of Benchmarks and Algorithms for Realistic Arc Routing Problems

    Capacitated Arc Routing Problem (CARP) is a well known combinatorial problem where one aims to identify the minimum total distance traveled by a fleet of vehicles in order to serve a set of roads without violating the vehiclesâ capacity constraints. A number of optimization algorithms have been …

    unsw Repository record for Development of Benchmarks and Algorithms for Realistic Arc Routing Problems (opens in a new tab)

  9. Modeling and Solving Arc Routing Problems in Street Sweeping and Snow Plowing

    In arc routing problems, the goal is to determine an optimal path, or set of paths, that traverse a required subset of arcs on a graph with respect to a set of constraints and objective function. The Chinese Postman Problem (CPP) forms the basis for many arc routing problems. Let graph G =(V,A), …

    maryland Repository record for Modeling and Solving Arc Routing Problems in Street Sweeping and Snow Plowing (opens in a new tab)

  10. A Tabu Search, Augment-Merge Heuristic to Solve the Stochastic Location Arc Routing Problem

    The location arc routing problem (LARP) is a network optimization problem combining strategic facility location decisions and tactical or operational vehicle routing decisions for customer demand located on arcs of a network. The LARP seeks to locate facilities, or depots, and create vehicle …

    arkansas Repository record for A Tabu Search, Augment-Merge Heuristic to Solve the Stochastic Location Arc Routing Problem (opens in a new tab)

  11. RESILIENT AND PREDICTIVE MULTI-DEPOT ARC ROUTING FOR RECHARGEABLE AND CAPACITY-CONSTRAINED VEHICLES WITH UNCERTAIN FAILURES

    … data collection. Beyond the core deterministic routing problem, real-world operational conditions introduce critical layers of disruption and uncertainty. In practice, UAVs operate in harsh environments where prolonged exposure leads to stochastic in-mission vehicle failures. Such disruptions …

    maryland Repository record for RESILIENT AND PREDICTIVE MULTI-DEPOT ARC ROUTING FOR RECHARGEABLE AND CAPACITY-CONSTRAINED VEHICLES WITH UNCERTAIN FAILURES (opens in a new tab)

  12. A spatial decision support system for designing solid waste collection routes in rural counties

    … in rural counties, there has been a lot of research on exploring arc routing problems and their efficient solutions. The complex nature of solving arc routing problems lends itself to a GIS-based spatial decision support system. Such a system could combine user knowledge of a problem with …

    ut-knoxville Repository record for A spatial decision support system for designing solid waste collection routes in rural counties (opens in a new tab)

  13. Computational Methods for Solving the Combinatorial Optimization Problems in Transportation

    … This relocation operation involves a complicated routing problem for a fleet of shuttles to transport the staff drivers who relocate the EVs to proper demand locations. We devise an efficient algorithm, which adapts the Adaptive Large Neighborhood Search framework. The experimental results …

    usf Repository record for Computational Methods for Solving the Combinatorial Optimization Problems in Transportation (opens in a new tab)

  14. Routing Problems Through the Lens of Hybrid Algorithms

    … optimization challenges in transportation and routing scenarios. Three sets of contributions are presented, each encapsulated in a chapter. The first set of contributions introduces a pioneering hybrid genetic algorithm meticulously crafted to address the intricacies of the Traveling Salesman …

    usf Repository record for Routing Problems Through the Lens of Hybrid Algorithms (opens in a new tab)

  15. A Study of Four Network Problems in Transportation, Telecommunications, and Supply Chain Management

    … and supply chain management. The core of our research is to apply heuristic search procedures and combinatorial optimization techniques to various practical problems. In the second chapter we investigate the split delivery vehicle routing problem (SDVRP), where a customer's demand can be split …

    maryland Repository record for A Study of Four Network Problems in Transportation, Telecommunications, and Supply Chain Management (opens in a new tab)

  16. Adaptive operator search for the capacitated arc routine problem

    … plethora of different NP-Hard Problems. This research area has achieved acknowledgeable results and obtained remarkable progresses, and it has ultimately established itself as one of the most studied in AI. Yet, predicting the approximation ability of Evolutionary Algorithms (EAs) on novel problem …

    birmingham Download PDF for Adaptive operator search for the capacitated arc routine problem (opens in a new tab)

  17. A Metaheuristic Genetic Algorithm for Routing Bridge Inspection Robots

    … costs and improve safety. However, optimally routing multiple robots to traverse and inspect each member of a truss bridge remains a challenging NP-hard problem which we represent by the Min-Max k-Chinese Postman Problem. In this thesis we attack this problem by constructing routes with a …

    unr Repository record for A Metaheuristic Genetic Algorithm for Routing Bridge Inspection Robots (opens in a new tab)

  18. Route Optimization for Automated Bridge Inspection with Genetic Algorithm

    … (MM k-CPP), which is part of the family of Arc Routing Problems (ARPs). These represent a broad class of problems wherein the goal is to traverse every edge of a graph in the most optimal fashion, under some set of constraints. Some variants of this problem, including the MM k-CPP, are …

    unr Repository record for Route Optimization for Automated Bridge Inspection with Genetic Algorithm (opens in a new tab)

  19. Optimization of Drone Routing in Humanitarian Applications

    … programming utility so the solutions for UAV routing could be compared with a land vehicle completing the same mission. This report is divided in four main chapters. The first one introduces the drone technology environment and the humanitarian applications with these drones. A …

    liege Repository record for Optimization of Drone Routing in Humanitarian Applications (opens in a new tab) Download PDF for Optimization of Drone Routing in Humanitarian Applications (opens in a new tab)

Page 1 of 2