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 297 for “"location problem"”.

  1. The Facility Location Problem

    The purpose of this study was to analyze the location of an emergency facility location within a town based on given information from the village and to use the results to determine the optimal location for an emergency facility. A model of the problem was developed using a spreadsheet and computer …

    govst Repository record for The Facility Location Problem (opens in a new tab)

  2. The flow-resource facility location problem

    <p>The problem described in this dissertation is the Flow-Resource Facility Location Problem (FRFLP). The FRFLP is the problem of determining a minimum cost distribution of flow-resource facilities at the vertices of a network, and of simultaneously determining a set of paths in the network such …

    utk-theses Repository record for The flow-resource facility location problem (opens in a new tab)

  3. Robust maximum covering location problem (RMCLP)

    The Maximum Covering Location Problem (MCLP) is a widely recognized optimization problem used in facility location planning. The objective of this problem is to minimize costs while maximizing accessibility to customers. In this thesis, the MCLP is being solved as an optimization problem under …

    lethbridge Repository record for Robust maximum covering location problem (RMCLP) (opens in a new tab)

  4. Location problem for manufacturing scrappedwaste materials recycling centers

    … scrapped/waste materials recycling center location problem based on a hypothesis that State of Missouri plans to build a recycling system mainly for the manufacturing industry of Missouri. This paper presents two models whose objectives are to maximize profit; the first model was verified …

    missouri Repository record for Location problem for manufacturing scrappedwaste materials recycling centers (opens in a new tab)

  5. Search algorithms for the simple plant location problem

    … for finding solutions to the simple plant location problem. Theorems are proved which give sufficient conditions for the inclusion of a plant in the optimal solution. The exact algorithm which is developed is similar to the Branch and Bound method. The approximate technique consists of a …

    must-thes Repository record for Search algorithms for the simple plant location problem (opens in a new tab)

  6. A genetic algorithm for the sensor location problem.

    We study a sensor location problem that minimizes the total number of sensors to install at road intersections in a transportation network so that the traffic flows on the entire network are uniquely determined. We employ the concepts of hidden network and incremental flow in analyzing the problem, …

    louisville Repository record for A genetic algorithm for the sensor location problem. (opens in a new tab)

  7. Differentially Private Approximation Algorithms for Facility Location Problem

    We study the facility location problem under the constraints imposed by central and local differential privacy (LDP) models. Recently, proposed lower and upper bounds for the problem on the central differential privacy (DP) model problem, where a trusted curator first collects and processes all …

    buffalo Repository record for Differentially Private Approximation Algorithms for Facility Location Problem (opens in a new tab)

  8. Minmax sink location problem on dynamic cycle networks

    We address both 1 and k sink location problems on dynamic cycle networks. Our 1-sink algorithms run in O(n) and O(nlogn) time for uniform and general edge capacity cases, respectively. We improve the previously best known O(nlogn) time algorithm for single sink introduced by Xu et al. [Xu et al. …

    lethbridge Repository record for Minmax sink location problem on dynamic cycle networks (opens in a new tab)

  9. An information theory approach to a fault location problem

    The fault location model under investigation consists of an n-component series system known to have exactly one failed component. Component positions in the system are taken as fixed. A component is either working or failed. Components work or fail independently of each other, with their a prior …

    nps Repository record for An information theory approach to a fault location problem (opens in a new tab)

  10. A Study on Integrated Transportation and Facility Location Problem

    … this thesis is the development and solution of problems that simultaneously involve the planning of the location of facilities and transportation decisions from such facilities to consumers. This has been termed integrated distribution planning problems with practical application in logistics …

    pretoria Repository record for A Study on Integrated Transportation and Facility Location Problem (opens in a new tab)

  11. Improved approximation guarantees for lower-bounded facility location problem

    We consider the lower-bounded facility location (LBFL) problem (, also known as load-balanced facility location), which is a generalization of uncapacitated facility location (UFL) problem where each open facility is required to serve a minimum number of clients. More formally, in the LBFL problem, …

    waterloo Repository record for Improved approximation guarantees for lower-bounded facility location problem (opens in a new tab)

  12. Mathematical Programming Formulations of the Planar Facility Location Problem

    The facility location problem is the task of optimally placing a given number of facilities in a certain subset of the plane. In this thesis, we present various mathematical programming formulations of the planar facility location problem, where potential facility locations are not specified. We …

    waterloo Repository record for Mathematical Programming Formulations of the Planar Facility Location Problem (opens in a new tab)

  13. From the Location Problem of Normativity to Metaethical Quietism

    … whether there are normative entities (the ‘location problem’ of normativity), and it seeks a satisfying realist response to this question. However, it is shown that mainstream realist approaches to this location problem suffer from various difficulties, and I argue we should take quietist …

    east-anglia Download PDF for From the Location Problem of Normativity to Metaethical Quietism (opens in a new tab)

  14. Planar maximal covering location problem under different block norms

    … a new model for the planar maximal covering location problem (PMCLP) under different block norms. The problem involves locating p facilities anywhere on the plane in order to cover the maximum number of n given demand points. The generalization we introduce is that distance measures assigned …

    mcmaster Repository record for Planar maximal covering location problem under different block norms (opens in a new tab)

  15. GRASP Metaheuristic for Multiple Allocation p-Hub Location Problem

    Hub Location Problems (HLPs), belonging to the field of location theory, have been area of much research over the past two decades. This is due, in large measure, to the applications of hub and spoke networks in practice. Among the most classical versions of HLPs are p-hub location problems …

    concordia Download PDF for GRASP Metaheuristic for Multiple Allocation p-Hub Location Problem (opens in a new tab)

  16. 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

Page 1 of 15