Name
Abstract | ||
|---|---|---|
In this article, we propose a global optimization technique (Big Segment Small Segment) for solving single facility location problems on a network when the location of the facility can either at nodes or along the links of the network. Some multiple facility location problems can be solved by recursively solving single facility problems. The technique is tested on five problems: the mixed weights 1-median problem where the weights are a mix of positive and negative values, the obnoxious facility location problem assuming that the nuisance function declines by the square of the distance, the competitive facility location problem using the gravity model, and minimizing cover by locating two facilities while requiring a minimum distance between them. Computational experiments provided excellent results. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 58(1), 1–11 2011 © 2011 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1002/net.20408 | Networks |
Keywords | Field | DocType |
multiple facility location problem,single facility location problem,obnoxious facility location problem,wiley periodicals,big segment,global optimization algorithm,inc. networks,competitive facility location problem,big segment small segment,1-median problem,global optimization technique,small segment,single facility problem,networks,location,global optimization | Mathematical optimization,Global optimization algorithm,Global optimization,Global optimum,Facility location problem,Gravity model of trade,Network management,1-center problem,Recursion,Mathematics | Journal |
Volume | Issue | ISSN |
58 | 1 | 0028-3045 |
Citations | PageRank | References |
7 | 0.47 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| O. Berman | 1 | 1604 | 231.36 |
| Zvi Drezner | 2 | 1195 | 140.69 |
| Dmitry Krass | 3 | 483 | 82.08 |