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 19 of 19 for “"capacitated facility location problem"”.
-
Robust Contextual Capacitated Facility Location Problem under Spatially Correlated Disruptions
Facility location problems (FLPs) under disruption risk have received significant attention in recent years due to the escalating frequency and severity of natural disasters, global pandemics, and infrastructure failures. We study a capacitated facility location problem under spatial disruptions …
-
LP-based Approximation Algorithms for the Capacitated Facility Location Problem
The capacitated facility location problem is a well known problem in combinatorial optimization and operations research. In it, we are given a set of clients and a set of possible facility locations. Each client has a certain demand that needs to be satisfied from open facilities, without exceeding …
-
Facility Location Using Cross Decomposition
… for military units can be modeled as a capacitated facility location problem with sole sourcing and multiple resource categories. Computational experience suggests that cross decomposition, a unification of Benders Decomposition and Lagrangean relaxation, is superior to other …
-
Benders decomposition: an integer-programming extension with further computational enhancements
… to identify promising solutions to the original problem. IBDA's key contributions are the local-search technique and a novel use of solution-elimination constraints. We prove IBDA's correctness and demonstrate that the algorithm solves certain IPs faster than other available techniques. Slow …
-
Interior Point Cutting Plane Methods in Integer Programming
… The algorithm is tested on two classes of problems: the capacitated facility location problem and the multicommodity capacitated fixed charge network design problem. For the capacitated facility location problem, the proposed approach was on average 2.5 times faster than …
-
A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure
A new methodology to solve the capacitated facility location problem (CFLP) is presented. This optimization problem can be explicitly formulated and solved as a mixed integer program (MIP); however, because binary variables are used, obtaining exact solutions can be computationally intensive. This …
-
Location Problems in Supply Chain Design: Concave Costs, Probabilistic Service Levels, and Omnichannel Distribution
Location of facilities such as plants, distribution centers in a supply chain plays critical role in efficient management of logistics activities. Real-life supply chains are generally large in size with multiple echelons, prone to disruptions and uncertainties, and constantly evolving to meet …
-
Location of inspection stations on flow networks.
This dissertation deals with the problem of locating inspection stations in two different scenarios: (1) in a manufacturing environment, and (2) in a network involving the transportation of hazardous materials. In the manufacturing environment problem, the location of specialized inspection …
-
Stabilizing Column Generation via Dual Optimal Inequalities with Applications in Logistics and Robotics
… of DOI for the general context of set cover problems. We refer to these as Smooth DOI (S-DOI) and Flexible DOI (F-DOI). S-DOI can be interpreted as allowing for the undercovering of items at the cost of overcovering others and incurring an objective penalty. SDOI leverage the fact that dual …
-
Algorithms for Online Advertising Portfolio Optimization and Capacitated Mobile Facility Location
… column generation and heuristic approaches to problems in the domains of online advertising and mobile facility location. First, we study the online advertising portfolio optimization problem (OAPOP) of an advertiser. In the OAPOP, the advertiser has a set of targeting items of interest (in the …
-
Approximation algorithms for new graph partitioning and facility location problems
… the fundamental questions can be abstracted as problems in combinatorial optimization. However, many of these problems are NP-hard, which makes it unlikely that exact polynomial-time algorithms for them exist. Approximation algorithms are designed to circumvent this difficulty, by finding …
-
Large Scale Evacuation of Carless People During Short- and Long-Notice Emergency
… intact and able to walk to a set of designated locations for transportation during an emergency, and we propose using public transit and school buses to evacuate this carless group. A model has been developed to accommodate the use of public transit and school buses to efficiently and …
-
Considering inventory in service parts logistics network design problems with time-based service constraints
… logistics network design and inventory stocking problem as characterized by the interdependency of design and stocking decisions in service parts logistics. These two sets of decisions usually have been considered sequentially in practice, and their associated problems have been tackled …
-
SUBMODULAR OPTIMIZATION AND ITS APPLICATIONS
… observed that cost functions of many general problems, including the well-known Uncapacitated Facility Location Problem, possessed an interesting property which proved to be rather useful in devising algorithms to solve them. Gradually, it became apparent that this interesting property was …
-
Deep Learning Applications in Beyond 5G Mobile Networks
… with each other to solve optimisation problems and provide a satisfactory quality of service (QoS). Further, compared to the baseband unit (BBU), FAPs are equipped with much smaller caches, so algorithms have to proactively cache content that users would like to access. Due to the …
-
Location for Profit Maximization: Applications to On-Demand Warehousing and Pilotless Air Cargo Transportation
… effectively address large-scale network design problems that prioritize profit-oriented objectives. This dissertation develops mathematical models and effective solution methodologies to optimize profitability in on-demand warehousing and pilotless air cargo transportation networks. In …
-
Sampling based progressive hedging algorithms for stochastic programming problems
Many real-world optimization problems have parameter uncertainty. For instances where the uncertainties can be estimated to a certain degree, stochastic programming (SP) methodologies are used to identify robust plans. Despite advances in SP, it is still a challenge to solve real world stochastic …