Finding efficient solutions for rectilinear distance location problems efficiently |
| |
Authors: | Luc G Chalmet Richard L Francis Antoon Kolen |
| |
Institution: | University of Florida, Gainesville, FL, U.S.A.;Stichting Mathematisch Centrum, Amsterdam, Netherlands |
| |
Abstract: | Given n planar existing facility locations, a planar new facility location X is called efficient if there is no other location Y for which the rectilinear distance between Y and each existing facility is at least as small as between X and each existing facility, and strictly less for at least one existing facility. Rectilinear distances are typically used to measure travel distances between points via rectilinear aisles or street networks. We first present a simple arrow algorithm, based entirely on geometrical analysis, that constructs all efficient locations. We then present a row algorithm which is of order n(log n) that constructs all efficient locations, and establish that no alternative algorithm can be of a lower order. |
| |
Keywords: | Planar efficient locations rectilinear distance |
本文献已被 ScienceDirect 等数据库收录! |
|