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 29 for “"capacitated facility location"”.

  1. 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 …

    ttu Repository record for Robust Contextual Capacitated Facility Location Problem under Spatially Correlated Disruptions (opens in a new tab) Embargoed until 2027-08-01

  2. 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 …

    waterloo Repository record for LP-based Approximation Algorithms for the Capacitated Facility Location Problem (opens in a new tab)

  3. Dynamic and Robust Capacitated Facility Location in Time Varying Demand Environments

    … varying demand that motivate the analysis of our location models in terms of total demand and the change in value and location of the demand of each customer. The first part of the dissertation is devoted to the dynamic location model, which determines the optimal time and location for …

    tamu Repository record for Dynamic and Robust Capacitated Facility Location in Time Varying Demand Environments (opens in a new tab)

  4. 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 …

    tamu Repository record for A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure (opens in a new tab)

  5. 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 …

    nps Repository record for Facility Location Using Cross Decomposition (opens in a new tab)

  6. Online And Offline Facility Location And Network Design

    We study a few online and offline facility location and network design problems, including an offline facility location model with submodular opening costs, an online prize-collecting facility location model, an offline singledemand capacitated facility location model and an online prize-collecting …

    cornell Repository record for Online And Offline Facility Location And Network Design (opens in a new tab)

  7. Facility Location Planning Under Disruption

    Facility Location Problems (FLPs) such as the Uncapacitated Facility Location (UFL) and the Capacitated Facility Location (CFL) along with the k-Shortest Path Problem (k-SPP) are important research problems in managing supply chain networks (SCNs) and related operations. In UFL, there is no limit …

    concordia Download PDF for Facility Location Planning Under Disruption (opens in a new tab)

  8. Benders decomposition: an integer-programming extension with further computational enhancements

    … BDEA's performance using a stochastic capacitated facility-location problem. Computational tests show that BDEA can reduce average solution times by up to 74% compared to a standard BDA implementation.

    colo-mines Repository record for Benders decomposition: an integer-programming extension with further computational enhancements (opens in a new tab)

  9. Robust Design of Distribution Networks Considering Worst Case Interdictions

    Multi-echelon facility location models are commonly employed to design transportation systems. While they provide cost-efficient designs, they are prone to severe financial loss in the event of the disruption of any of its facilities. Additionally, the recent crisis in the world motivates OR …

    concordia Download PDF for Robust Design of Distribution Networks Considering Worst Case Interdictions (opens in a new tab)

  10. Interior Point Cutting Plane Methods in Integer Programming

    … 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 Benders-branch-and-cut and 11 …

    waterloo Repository record for Interior Point Cutting Plane Methods in Integer Programming (opens in a new tab)

  11. Location and Location-Routing Problems with Disruption Risks

    … there has been a renewed interest in resilient facility location. Design of reliable logistics networks to avoid disruption can be accomplished by fortification of existing facilities and de�fining backup facilities. In this thesis, we will look at two components of a logistics system that can …

    concordia Download PDF for Location and Location-Routing Problems with Disruption Risks (opens in a new tab)

  12. 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 …

    concordia Download PDF for Location Problems in Supply Chain Design: Concave Costs, Probabilistic Service Levels, and Omnichannel Distribution (opens in a new tab)

  13. Location of inspection stations on flow networks.

    … In the manufacturing environment problem, the location of specialized inspection stations in a serial system and in a serial-parallel system is considered. These location problems have the special characteristic that the demand for the facilities being located is from prespecified link flows …

    arizona-thes Repository record for Location of inspection stations on flow networks. (opens in a new tab)

  14. Ενεργειακά αποδοτικά δίκτυα ασύρματων επικοινωνιών

    … energy aware model into the category of the capacitated facility location problems, which are NP-hard. We applied exhaustive techniques for estimating the upper bound in each of the mobile network’s system models we examined, and we formulated the corresponding power consumption optimization …

    greece Repository record for Ενεργειακά αποδοτικά δίκτυα ασύρματων επικοινωνιών (opens in a new tab)

  15. Stabilizing Column Generation via Dual Optimal Inequalities with Applications in Logistics and Robotics

    … and operations research: the Single Source Capacitated Facility Location Problem, the Capacitated p-Median Problem, and the Capacitated Vehicle Routing Problem. We prove that these DOI are valid and are guaranteed to not alter the optimal solution of CG. We also present techniques for their …

    maryland Repository record for Stabilizing Column Generation via Dual Optimal Inequalities with Applications in Logistics and Robotics (opens in a new tab)

  16. Behaviourally Informed Decision Models for Last-Mile Delivery

    … second study develops a behaviourally informed capacitated facility location model for automated parcel locker deployment. Stated-preference survey data are used to estimate willingness-to-travel functions, which enter the optimization model through distance-ranked allocation constraints, …

    mcmaster Repository record for Behaviourally Informed Decision Models for Last-Mile Delivery (opens in a new tab)

  17. Algorithms for Online Advertising Portfolio Optimization and Capacitated Mobile Facility Location

    … 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 order of tens of millions for large enterprises) and a …

    maryland Repository record for Algorithms for Online Advertising Portfolio Optimization and Capacitated Mobile Facility Location (opens in a new tab)

  18. Approximation algorithms for new graph partitioning and facility location problems

    … into two general areas: graph partitioning and facility location. The first problem that we introduce is the unbalanced graph cut problem. Here the goal is to find a graph cut, minimizing the size of one of the sides, while also respecting an upper bound on the number of edges cut. We develop …

    cornell Repository record for Approximation algorithms for new graph partitioning and facility location problems (opens in a new tab)

Page 1 of 2