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 35 for “"Location-Allocation"”.

  1. Bi-objective multi-assignment capacitated location-allocation problem

    Optimization problems of location-assignment correspond to a wide range of real situations, such as factory network design. However most of the previous works seek in most cases at minimizing a cost function. Traffic incidents routinely impact the performance and the safety of the supply. These …

    vt Repository record for Bi-objective multi-assignment capacitated location-allocation problem (opens in a new tab)

  2. Public Bike Stations in Indianapolis: A Location Allocation Study

    Location Allocation, rooted in Operations Research and Mathematical programming, allows real world problems to be solved using optimization (based on mathematics and science) and equity principles (based on ethics). Finding nearest facilities for everyone simultaneously is a task solved by …

    iupui Repository record for Public Bike Stations in Indianapolis: A Location Allocation Study (opens in a new tab)

  3. Medical Imaging Centers in Central Indiana: Optimal Location Allocation Analyses

    … a point and a line, it wasn’t until 1966 that location optimization was first applied to a problem in healthcare. Location optimization techniques are capable of increasing efficiency and equity in the placement of many types of services, including those within the healthcare industry, thus …

    iupui Repository record for Medical Imaging Centers in Central Indiana: Optimal Location Allocation Analyses (opens in a new tab)

  4. Algorithmic Approaches for Solving the Euclidean Distance Location and Location-Allocation Problems

    … algorithmic approaches for solving the minisum location and location-allocation problems in which the Euclidean metric is used to measure distances. To overcome the nondifferentiability difficulty associated with the Euclidean norm function, specialized solution procedures are developed for both …

    vt Repository record for Algorithmic Approaches for Solving the Euclidean Distance Location and Location-Allocation Problems (opens in a new tab)

  5. Balanced, capacitated, location-allocation problems on networks with a continuum of demand

    Location-allocation problems can be described generically as follows: Given the location or distribution (perhaps, probabilistic) of a set of customers and their associated demands for a given product or service, determine the optimum location of a number of service facilities and the allocation of …

    vt Repository record for Balanced, capacitated, location-allocation problems on networks with a continuum of demand (opens in a new tab)

  6. Network Design and Analysis Problems in Telecommunication, Location-Allocation, and Intelligent Transportation Systems

    … and analysis of telecommunication networks, location-allocation distribution contexts, and intelligent transportation networks. Specifically, the corresponding problems addressed in these areas are a local access and transport area (LATA) network design problem, the discrete equal-capacity …

    vt Repository record for Network Design and Analysis Problems in Telecommunication, Location-Allocation, and Intelligent Transportation Systems (opens in a new tab)

  7. Static and sequential location-allocation problems on networks and areas with probabilistic demands

    Location-allocation problems arise in many practical settings and may be generically stated as follows: Given the location or distribution of a set of customers and their associated demands, simultaneously determine an optimal location of a number of supply facilities and their allocation of …

    vt Repository record for Static and sequential location-allocation problems on networks and areas with probabilistic demands (opens in a new tab)

  8. A location-allocation model and algorithm for optimally locating shelters to minimize evacuation times

    Location â allocation models are designed to seek the concurrent location of a set of service facilities and an allocation scheme to satisfy the demands of a set of customers or users of a given system. If the location-allocation model is based on a graph-theoretic formulation, then the …

    vt Repository record for A location-allocation model and algorithm for optimally locating shelters to minimize evacuation times (opens in a new tab)

  9. A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem

    … with the analysis of a Rectilinear Distance Location Allocation Problem, where the costs are directly proportional to rectilinear distances and the amount shipped. The problem is formulated as a Mixed Integer Bilinear Programming Problem and as a Discrete Location Allocation Problem. Using …

    vt Repository record for A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem (opens in a new tab)

  10. Investigating the Role of Location-Allocation Models in Planning the Locations of Dry Fire Hydrants

    … This thesis investigates the role of GIS location-allocation model (LAMs) as a tool to aid fire managers in planning the locations of numerous dry hydrants. LAMs are designed to place central service facilities in a configuration that optimally serves geographically dispersed demand. One …

    vt Repository record for Investigating the Role of Location-Allocation Models in Planning the Locations of Dry Fire Hydrants (opens in a new tab)

  11. Generation and optimisation of real-world static and dynamic location-allocation problems with application to the telecommunications industry.

    The location-allocation (LA) problem concerns the location of facilities and the allocation of demand, to minimise or maximise a particular function such as cost, profit or a measure of distance. Many formulations of LA problems have been presented in the literature to capture and study the unique …

    rgu Repository record for Generation and optimisation of real-world static and dynamic location-allocation problems with application to the telecommunications industry. (opens in a new tab)

  12. A Location - Allocation Model For Pedestrian Footbridge infrastructure: A Case Study on the South Africa's National Roads Agency Limited (SANRAL) Network in Gauteng

    … geo-spatial model to determine the most suitable location to allocate pedestrian footbridge infrastructure along the South African National Road Agency Limited (SANRAL) network in Gauteng Province. Previously road planning and design in South Africa followed international best practices, with …

    cape-town Repository record for A Location - Allocation Model For Pedestrian Footbridge infrastructure: A Case Study on the South Africa's National Roads Agency Limited (SANRAL) Network in Gauteng (opens in a new tab)

  13. Preparing for out of hospital cardiac arrests (OHCA) in Riyadh, Saudi Arabia: A GIS scenario-modeling approach

    <p>This study employed location-allocation modeling and a geographic information system (GIS) to study the current placement of automated external defibrillators (AEDs) in relationship to neighborhoods in Riyadh City, Saudi Arabia, and to determine the optimal locations for additional AEDs in the …

    emich Repository record for Preparing for out of hospital cardiac arrests (OHCA) in Riyadh, Saudi Arabia: A GIS scenario-modeling approach (opens in a new tab)

  14. An evolutionary AI-based decision support system for urban regeneration planning

    … factors, decision support for an optimal allocation of residential and service lots within such districts is regarded as a complex task. Pre-assessment of various neighbourhood factors before the commencement of actual location allocation of various public services is considered paramount …

    wlv Repository record for An evolutionary AI-based decision support system for urban regeneration planning (opens in a new tab)

  15. A study into Healthcare Service Location Problems, Location and Allocation in the Inanda area

    … aimed at investigating the problem in service location planning. This was done by investigating level of accessibility to existing healthcare facilities available to the residents of Inanda. Following the classification of accessibility problems, recommendations were made on where the facility …

    cape-town Repository record for A study into Healthcare Service Location Problems, Location and Allocation in the Inanda area (opens in a new tab)

  16. BUBLS : a mixed integer program for transit centre location in the Lower Mainland

    … model is developed to determine both the optimal location of transit centres to serve BC Transit's Lower Mainland route network and the optimal allocation of buses to those centres. The existing five transit centres are explored as well as five candidate facilities. The model considers nonrevenue …

    ubc Repository record for BUBLS : a mixed integer program for transit centre location in the Lower Mainland (opens in a new tab)

  17. Planning and optimisation of 4G/5G mobile networks and beyond

    … two novel algorithms (Collaborative Resource Allocation Algorithm and Memetic-Bee-Swarm Site Location-Allocation Algorithm) are proposed to solve these problems. The Collaborative Resource Allocation Algorithm (CRAA) is inspired by lending and welfare system from the field of political economy …

    salford Repository record for Planning and optimisation of 4G/5G mobile networks and beyond (opens in a new tab)

  18. Capacitated, unbalanced p-median problems on a chain graph with a continuum of link demands

    … chain graph, and simultaneously determining the allocation of their supplies in order to satisfy a continuum of demand which is characterized by some weighted probability density function defined on the chain graph. The objective is to minimize the total (expected) transportation cost. This …

    vt Repository record for Capacitated, unbalanced p-median problems on a chain graph with a continuum of link demands (opens in a new tab)

  19. ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΧΩΡΟΘΕΤΗΣΗΣ ΚΕΝΤΡΩΝ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ ΣΕ ΔΙΚΤΥΟ

    … OF THIS THESIS IS THE SOLUTION OF THE FACILITY LOCATION PROBLEM (FLP) IN SUCH WAY THAT ANY DEMAND POINT CAN BE SERVICED BY A FLP IN A TIME-DISTANCE LESS THAN A GIVEN T (PROBLEM (F)). PROBLEM (F) BELONGS TO THE WELL KNOWN CATEGORY OF NP-HARD PROBLEMS AND UNTIL NOW IT IS TACKLED UNDER THE …

    greece Repository record for ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΧΩΡΟΘΕΤΗΣΗΣ ΚΕΝΤΡΩΝ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ ΣΕ ΔΙΚΤΥΟ (opens in a new tab)

Page 1 of 2