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 25 for “"Location Routing Problem"”.
-
Collection-and-Delivery-Points: A Variation on a Location-Routing Problem
… a place, either in an existing business or a new location, where the carrier drops any missed deliveries and the customers can pick the packages at their convenience. To examine the viability of a CDP system in North America, a variation on a location-routing problem (LRP) was created, a …
-
Bi objective multi depot location routing problem with time window for EVs
This thesis addresses a multi-depot, bi-objective Location Routing Problem for electric vehicles (EVs), modeled as a Mixed Integer Linear Programming (MILP) problem. The mathematical model integrates cost minimization with workload fairness under time windows. A custom metaheuristic algorithm, …
-
A Three Echelon Location Routing Problem with Multiple Commodities and Courier Deliveries
Research on location-routing is extensive, providing new variants for numerous applications. It is worth mentioning that most contributions present in the literature of freight distribution are limited to two-echelon, single commodity networks imposing one delivery strategy for all flows. While …
-
Integrated supply chain: multi products location routing problem integrated with inventory under stochastic demand
… logistical decisions of the supply chain namely location (a strategic decision) and routing (a tactical decision) are combined, the location- routing problem (LRP) is formed. LRP deals with simultaneously locating one or more supply facility among a set (or sets) of potential facilities and …
-
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 …
-
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 …
-
Approximation Algorithms Via The Primal-Dual Schema: Applications Of The Simple Dual-Ascent Method To Problems From Logistics
… a large variety of combinatorial optimization problems. This technique relies upon simultaneously constructing a primal integer solution that is feasible for the minimization problem of interest, as well as a dual solution whose objective function value serves as a lower bound. By operating in …
-
Last mile delivery with lockers, formulations and heuristics
… different formulations of the last mile delivery problem with lockers, considering the size of parcels and compartments and the probabilistic characteristic of the problem due to uncertainty about users accepting to use the locker. In all formulations, the objective is to decide the location of …
-
Modeling and Solving Multi-Product Multi-Layer Location-Routing Problems
… of logistics and supply chain management. Location-Routing Problem (LRP) simultaneously takes into consideration location, allocation, and vehicle routing decisions to design an optimal distribution network. Multi-layer and multi-product LRP is even more complex as it deals with the …
-
Heuristic methods for variations of the Vehicle Routing Problem
… This led to the research of the Vehicle Routing Problem (VRP). Due to its large real-world application, many variations of and methodology for the VRP have been studied. This thesis contains three works considering VRP variations. Two of these works study variations where location …
-
Methodologies for predicting and explaining the empirical hardness of graph-based combinatorial optimization problems
… mining (ARM). Applied to 3,287 maximum clique problem (MCP) instances drawn from COLLAB, IMDB-BINARY, and TWITTER benchmarks, the framework achieves a weighted F1 ≈0.992 using features: two adjacency matrix-based spectral statistics and the number of nodes. It then extracts high-support, …
-
INTEGRATING VERTICAL EQUITY IN HAZMAT FACILITY LOCATION AND ROUTING ANALYSIS
Equity is a major concern in the transportation of hazardous materials. There is significant evidence that the negative impacts from these decisions are disproportionately borne by low-income individuals and communities of color leading to increased health risks. Furthermore, few studies have …
-
The Trajectory Optimization & Space Logistics of Asteroid Mining Missions
… customer spacecraft between consecutive trips. A location-routing problem is developed to identify the optimal orbital location of the propellant depot, and the routing of spacecraft throughout the supply chain network to maximize total sellable mass delivered to customers. These methods are then …
-
Optimal site selection and location-routing for a sustainable integrated solid waste management system
… The proposed study focuses on the issues of location selection, routing and waste flow to optimise the system. To address the location selection problem, Multi-Criteria Decision Making (MCDM) methods are utilised in novel frameworks under the Geographic Information System (GIS) environment. …
-
Models and algorithms for hard optimization problems
… programming models. We consider two of these problems, the cutting stock problem and the vehicle routing problem. Both problems have been studied for several decades by researchers and practitioners of the Operations Research eld. Their interest and contribution to real-world applications in …
-
Enhancing the efficiency of multi-drone missions through strategic deployment and path planning optimizations
… metaheuristic optimization, formulating the problem as a Planar Location Routing Problem. The genetic algorithm implementation devised achieves 97-100\% accuracy, compared to exhaustive search methods, while reducing computational requirements by up to four orders of magnitude. Smart …
Page 1 of 2