Competitive location on a network
Operations Research
An overview of representative problems in location research
Management Science
Analysis of aggregation errors for the p-median problem
Computers and Operations Research - Special issue on aggregation and disaggregation in operations research
On the use of genetic algorithms to solve location problems
Computers and Operations Research - Location analysis
Budget constrained location problem with opening and closing of facilities
Computers and Operations Research
A hybrid spatial data clustering method for site selection: The data driven approach of GIS mining
Expert Systems with Applications: An International Journal
Advances in Engineering Software
Strategic design of competing supply chain networks with foresight
Advances in Engineering Software
GIS enabled service site selection: Environmental analysis and beyond
Information Systems Frontiers
| Hi-index | 0.01 |
We propose a multi-site location-allocation model for selecting locations in competitive service systems. Examples are typical franchise systems or retailers with multiple outlets. The proposed objective function maximizes a measure of spatial utility of users subject to constraints on waiting time of users and budget of the multi-site facility owners. The intent is to provide model support in assisting with decisions by one multi-facility owner about locating new sites or closing current sites in the presence of one or more competitors, each of which control several sites. Algorithms and spatial data necessary for solving the problem are described. The model is described in the context of locating bank branches though it is applicable in many other contexts.