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 274 for “"Routing Problems"”.
-
Vehicle Routing Problems
… dissertation we consider variants of the vehicle routing problem applied to two problem areas. First, we consider the problem of scheduling deliveries from a central depot to clients in a metric space using a single delivery vehicle. Although this problem involves only a single vehicle rather than …
-
Exact algorithms for routing problems
The study of routing problems has given rise to major developments in the fields of Operations Research (OR). In particular, the Vehicle Routing Problem (VRP) has motivated the development of many exact algorithms and heuristics. In the VRP, a planner designs minimum-cost-delivery routes from a …
-
Online vehicle routing problems and analysis
… distribution. However, in many real life problems, it is unrealistic to assume that problem parameters are known a priori. A problem is called online when all of the problem data is not immediately available and revealed incrementally. Hence, online optimization models help make decisions …
-
Heterogeneous location- and pollution-routing problems
… and studies new classes of heterogeneous vehicle routing problems with or without location and pollution considerations. It develops powerful evolutionary and adaptive large neighborhood search based metaheuristics capable of solving a wide variety of such problems with suitable enhancements, and …
-
Solving continuous replenishment inventory routing problems
This research investigates the problem of resupplying points of dispensing (PODs), which will dispense medications to millions of people in case of a bioterrorist attack such as anthrax. After receiving an initial but limited supply of medication, the PODs will operate continuously. Vehicles will …
-
Algorithms for Multiple Vehicle Routing Problems
… This dissertation considers three fundamental routing problems involving multiple vehicles that arise in these applications. The main objective of this dissertation is to develop novel approximation algorithms for these routing problems that find feasible solutions and also provide a bound on …
-
LOCATION AND ROUTING PROBLEMS: A UNIFIED APPROACH
This thesis is about location and routing problems. We propose a unified algorithmic approach, based on the branch-and-cut-and-price paradigm, for the exact solution of general location and routing problems involving both costs and profits. In particular three different types of N P -hard problems …
-
Partitioning methods for NP-hard routing problems
Routing plays an essential role in modern life. As our civilization grows more reliant upon the efficient movement of goods and people, the mathematical problems underlying routing decisions also grow in complexity. Given their structure, partitioning provides one option for solving routing …
-
Network routing problems in stochastic-state networks
Network Routing problems focus on exploiting the network-based struc- ture of a mathematical optimization problem to establish e cient solutions that are tailored to the problem at hand. The topic of this dissertation relates to a speci c class of network routing problems, those in which the …
-
Polyhedral studies on scheduling and routing problems
… real world combinatorial optimization problems. Such problems are formulated as Travelling Salesman Problems (TSP), some involving up to thousands of cities. These achievements, mainly due to the use of so called polyhedral techniques, have established the importance of the polyhedral …
-
Location-Routing Problems with Economies of Scale
The purpose of the location-routing problem is to select facility locations, assign customers to facilities, and design routes between facilities and customers. The most common objective is to achieve minimal cost. In general, for the standard location-routing problem, the total cost includes xed …
-
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 …
-
QOS routing source routing problems and solutions
… that satisfy given QoS requirements, namely QoS routing. The challenging issue in this area is to route packets subjected to multiple uncorrelated constraints because the problem is inherently NP-complete. This thesis studies the source routing heuristic approaches that bring the time complexity …
-
Vehicle routing problems in signalized traffic networks
This dissertation studied various path search problems when traffic signal information and traffic state is explicitly considered. The research is motivated by the increasing availability of high-resolution traffic data including signal information, which is seldom available in the past. In order …
-
Using Metaheuristics to solve Dynamic Vehicle Routing Problems
The Vehicle Routing Problem (VRP) is considered to be a complex and high-level set of various routing problems. One of its important variants is the Dynamic Vehicle Routing Problem (DVRP), in which not all customers are known in advance, but are revealed as the system progresses. Consequently, DVRP …
-
DEEP REINFORCEMENT LEARNING FOR SOLVING VEHICLE ROUTING PROBLEMS
… methods for effectively solving the vehicle routing problems (VRP). This thesis presents three DRL methods for solving the VRP variants. Firstly, a DRL method based on the attention mechanism is proposed to construct routes for HVRP with both min-max and min-sum objectives by iteratively …
-
Approaches for solving some scheduling and routing problems
… for three difficult combinatorial optimisation problems.<br/>The supply ship travelling salesman problem is a simplification of a situation faced by a naval logistics coordinator who must direct a support vessel tasked with resupplying ships in a fleet. It is a generalisation of the travelling …
-
Multi-Objective evolutionary algorithms for vehicle routing problems
The Vehicle Routing Problem, which main objective is to find the lowest-cost set of routes to deliver goods to customers, has many applications in transportation services. In the past, costs have been mainly associated to the number of routes and the travel distance, however, in real-world problems …
Page 1 of 14