Name
Abstract | ||
|---|---|---|
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest supply point. p-Median is polynomially solvable in one dimension but NP-hard in two or more dimensions, when either the Euclidean or the rectilinear distance measure is used. In this paper, we treat the p-median problem under a new distance measure, the directional rectilinear distance, which requires the assigned supply point for a given demand point to lie above and to the right of it. In a previous work, we showed that the directional p-median problem is polynomially solvable in one dimension; we give here an improved solution through reformulating the problem as a special case of the constrained shortest path problem. We have previously proven that the problem is NP-complete in two or more dimensions; we present here an efficient heuristic to solve it. Compared to the robust Teitz and Bart heuristic, our heuristic enjoys substantial speedup while sacrificing little in terms of solution quality, making it an ideal choice for real-world applications with thousands of demand points. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.ejor.2005.06.080 | European Journal of Operational Research |
Keywords | DocType | Volume |
Directional p-median problem,Traffic quantization,Vector quantization | Journal | 179 |
Issue | ISSN | Citations |
3 | 0377-2217 | 1 |
PageRank | References | Authors |
0.35 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laura E. Jackson | 1 | 15 | 2.31 |
| George N. Rouskas | 2 | 990 | 88.88 |
| Matthias F. M. Stallmann | 3 | 166 | 19.38 |