Abstract
Network location theory has traditionally been concerned with the optimal location of a single-point facility at either a vertex or along an arc in the network. Recently, some authors have departed from this traditional problem and have considered the location of extensive facilities, such as paths, trees or cycles. In this paper, we consider the optimal location of paths on trees with regard to two objective functions: the eccentricity and the superior section. We first present methods to find paths with minimal eccentricity and minimal superior section on trees with arbitrary positive lengths. Then, we analyse the biobjective optimization problem and propose an algorithm, based on a progressive reduction of the initial tree, to obtain all efficient paths. Modifications of the proposed algorithm to solve the problem when a general objective function is used instead of the eccentricity function are also given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aneja Y.P. and K.P.K. Nair (1992), Location of a Tree Shaped Facility in a Network,INFOR, 30 (4), 319–324.
Boffey T.B. (1995), Multiobjective Routing Problems,TOP, 3, 167–220.
Chankong V. and Y.Y. Haimes (1983), Multiobjective Decision Making: Theory and Methodology, North-Holland.
Cohon J.L. (1978), Multiobjective Programming and Planning, Academic Press.
Current J.R. and D.A. Schilling (1994), The Median Tour and Maximal Covering Tour Problems: Formulations and Heuristics,European Journal of Operational Research, 73, 114–126.
Hakimi S.L., E.F. Schmeichel and M. Labbé (1993), On Locating Path- or Tree-Shaped Facilities on Networks,NETWORKS, 23, 543–555.
Hansen P. (1980), Bicriterion Path Problems, inMultiple Criteria Decision Making: Theory and Applications, G. Fandel and T. Gal (eds.) Lecture Notes in Economics and Mathematical Systems, 177, 109–127, Springer-Verlag, Berlin.
Hansen, P., J.-F. Thisse and R.E. Wendell (1986), Efficient Points on a Network,NETWORKS, 16, 357–368.
Hedetniemi S.M., E.J. Cockayne and S.T. Hedetniemi (1981), Linear Algorithms for Finding the Jordan Center and Path Center of a Tree,Transportation Science, 15 (2), 98–114.
Kincaid R.K., T.J. Lowe and T.L. Morin (1988), The Location of Central Structures in Trees,Computers and Operations Research, 15 (2), 103–113.
Lopez de los Mozos M.C. and J.A. Mesa (1992), Location of Cent-Dian Paths in Trees Graphs,Proceedings of the VI Meeting of the Euro Working Group on Locational Analysis, Tenerife, 135–144.
Mesa J.A. and T.B. Boffey (1996), A review of Extensive Facility Location in Networks,European Journal of Operational Research, 95, 592–603.
Minieka E. (1985), The Optimal Location of a Path or Tree in a Tree Network,NETWORKS, 15, 309–321.
Morgan C.A. and P.J. Slater (1980), A Linear Algorithm for a Core of a Tree,Journal of Algorithms, 1, 247–258.
Pelegrín B. and P. Fernández (1998), On the SUM-MAX Bicriterion Path Problem,Computers and Operations Research, 25 (12), 1043–1054.
Richey M.B. (1990), Optimal Location of a Path or Tree on a Network with Cycles,NETWORKS, 20, 391–407.
Slater P.J. (1982), Locating Central Paths in a Graph,Transportation Science, 16 (1), 1–18.
Steuer R.E. (1986), Multiple Criteria Optimization: Theory, Computation and Application, Wiley.
Author information
Authors and Affiliations
Additional information
This work has been supported by Fundación Séneca under grant PB/11/FS/97
Rights and permissions
About this article
Cite this article
Fernández, P., Pelegrín, B. & Fernández, J. Location of paths on trees with minimal eccentricity and superior section. Top 6, 223–246 (1998). https://doi.org/10.1007/BF02564789
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02564789