Abstract
In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located.
The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous spaces and network facility location. We will show that the problems presented here have a close connection with continuous dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional facilities location in the continuous case.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Becker, R.I. (1990). “Inductive Algorithms on Finite Trees.” Quaestiones Mathematicae, 131, 65–181.
Becker, R.I., Y. Chiang, I. Lari, A. Scozzari, and G. Storchi. (2002). “Finding the ℓ-Core of a Tree.” Discrete Applied Mathematics, 118, 25–42.
Diaz-Banez, J.M. and J.A. Mesa. (2001). “Fitting Rectilinear Polygonal Curves to a Set of Points in the Plane.” European Journal of Operational Research, 130, 214–222.
Diaz-Banez, J.M., J.A. Mesa, and A. Schöbel. (2004). “Continuous Location of Dimensional Structures.” European Journal of Operational Research 151, 22–44.
Hakimi, S.L., E.F. Schmeichel, and M. Labbé. (1993). “On Locating Path or Tree Shaped Facilities on Network.” Networks, 23, 543–555.
Itai, A., C.H. Papadimitriou, and J.L. Szwarcfiter. (1982). “Hamilton Paths in Grid Graphs.” SIAM Journal of Computing, 4, 676–686.
Lari, I., F. Ricca, and A. Scozzari. (2004). “Comparing Different Metaheuristic Approaches for the Median Path Problem with Bounded Length.” Technical Report, Dip. Statistica, Probabilità e Statistiche Applicate, Serie A-Ricerche n. 13.
Minieka, E. (1985). “The Optimal Location of a Path or Tree in a Tree Network.” Networks, 15, 309–321.
Morgan, C.A. and J.P. Slater. (1980). “A Linear Algorithm for a Core of a Tree.” Journal of Algorithms 1, 247–258.
Peng, S. and W. Lo. (1996). “Efficient Algorithms for Finding a Core of a Tree with a Specified Length.” Journal of Algorithms, 20, 445–458.
Richey, M.B. (1990). “Optimal Location of a Path or Tree on a Network with Cycles.” Networks, 20, 391–407.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Becker, R.I., Lari, I., Scozzari, A. et al. The location of median paths on grid graphs. Ann Oper Res 150, 65–78 (2007). https://doi.org/10.1007/s10479-006-0162-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-006-0162-0