Skip to search formSkip to main contentSkip to account menu

Location-allocation

Known as: Allocation, Location allocation 
Location-allocation refers to algorithms used primarily in a geographic information system to determine an optimal location for one or more… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
AlgorithmFacility location problemFactor analysisGeographic information system

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The capacitated multi-facility weber problem with polyhedral barriers: Efficient heuristic methods
Review
2013
Review
2013
UE-based Location Model of Rapid Charging Stations for EVs with Batteries 1 that Have Different States-of-charge 2 3
1 The aim of this research is to develop a location model of rapid charging stations for electric vehicles (EV) 2 in urban areas… 
Review
2011
Review
2011
The Applying ISM/FANP Approach for Appropriate Location Selection of Health Centers
The main purpose of this paper is to present a fuzzy multi-criteria decision making (FMADM) model for appropriate location… 
2009
2009
Planning the Location of Stop Smoking Services at the Local Level: A Geographic Analysis
Smoking is one of the major causes of premature death and its negative effects on a person's health are a global issue. Therefore… 
2006
2006
A Reverse Logistics Network Design Method Using Genetic Algorithm
Driven by ever growing concern to environments, legislative regulation and economic profitability, more and more firms pay… 
2004
2004
Facility Location for Solid Waste Management through Compilation and Multicriterial Ranking of Optimal Decentralised Scenarios: A Case Study for the Region of Peloponesse in Southern Greece
This study consists of the corporate quarterly result of companies taken under research and there relevant share prices. In this… 
1981
1981
The Use of Random-Utility Theory in Building Location-Allocation Models
The most important part of a location-allocation model is the allocation rule, that is, the way clients are assigned to… 
1981
1981
A Tight Bound Drop Exchange Algorithm for Solving the p Median Problem
A drop algorithm is proposed for solving the p median problem. In solving for a fixed value of p, tight bounds on all other… 
1978
1978
Graph theory and computer aided facilities design
1965
1965
An Application of Dynamic Programming to Location—Allocation Problems
Abstract : This memorandum indicates a method for treating the problem of minimizing a type of function that frequently arises in… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)