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 130 for “"Vehicle Routing Problems"”.
-
Vehicle Routing Problems
In this 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 …
-
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 …
-
Algorithms for Multiple Vehicle Routing Problems
… require a collection of heterogeneous vehicles to visit a set of targets. 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 …
-
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
… in heuristic 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 …
-
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 …
-
Integer Programming-Based Heuristics for Vehicle Routing Problems
The vehicle routing problem (VRP) has been an active field of study by operations researchers for over 50 years. Many practical applications have been presented in the literature, and many solution techniques have been developed. We discuss, develop, and computationally test integer …
-
Parallel and Serial Algorithms for Vehicle Routing Problems
The vehicle routing problem (VRP) is a widely studied combinatorial optimization problem that has many applications. Due to its intrinsic difficulty and the size of problems encountered in practice, most solution methods for the VRP are heuristic in nature and lead to high quality, yet probably not …
-
Mixed Integer Programming Approaches to Novel Vehicle Routing Problems
… to use network flows, resource allocation, and vehicle routing mixed integer programming approaches to be able to incorporate all of these data in a winter road maintenance framework. We also show that solution approaches which have proved useful in network flows and vehicle routing problems can …
-
Two-Echelon Vehicle Routing Problems Using Unmanned Autonomous Vehicles
In this thesis, we investigate new multi-echelon vehicle routing problems for logistics operations using unmanned autonomous vehicles. This can provide immediate tangible outcomes, especially in high-demand areas that are otherwise difficult or costly to serve. This type of problem differs from the …
-
Exact and Heuristic Methods for Emerging Vehicle Routing Problems
… within the transportation domain. We consider problems presented, verbally, by companies representing three distinct segments of the industry: freight routing, last-mile delivery, and on-demand passenger transport. Each problem is centered around an innovative strategy with the potential to …
-
Hybridisation Search for A Class of Vehicle Routing Problems
… metaheuristic approaches to tackle the classical vehicle routing problem (VRP) and its adaptation to other useful and practical routing problems including the cumulative capacitated VRP (CCVRP) and the dynamic VRP (DVRP). Due to the limited success of the exact methods in handling large size …
-
Two-Stage Vehicle Routing Problems with Profits and Buffers
This 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 …
-
Three-Dimensional Capacitated Vehicle Routing Problems with Loading Constraints
… out by logistics operators. The loading and routing of goods are critical components of these operations. Efficient utilization of vehicle space and limiting number of empty vehicle movements can strongly impact the nuisances created by goods delivery vehicles in urban areas. We consider an …
-
Distribution planning with slective traveling salesman and vehicle routing problems
… selective traveling salesman problem (TSP) and vehicle routing problem (VRP) in which the goal is to maximize the served demand. Using solution frameworks developed for these selective TSPs and VRPs, the decision-maker has the opportunity to implement efficient planning tools to schedule vehicle …
Page 1 of 7