Theory and methodology
A review of extensive facility location in networks

https://doi.org/10.1016/0377-2217(95)00321-5Get rights and content

Abstract

A facility is called ‘extensive’ if, for purposes of location, it is too large in relation to its environment regarding the activities of interest for it to be considered as a point. The literature on location on a network of ordinary and obnoxious extensive facilities is reviewed. Suggestions are made for possible directions of future research.

References (62)

  • S. Kim et al.

    Minisum and minimax paths of a moving facility on a network

    Computers and Operations Research

    (1992)
  • E. Minieka et al.

    On finding the core of a tree with a specified length

    Journal of Algorithms

    (1983)
  • C.A. Morgan et al.

    A linear algorithm for a core of a tree

    Journal of Algorithms

    (1980)
  • S. Peng et al.

    Algorithms for a core and k-tree core of a tree

    Journal of Algorithms

    (1993)
  • R.A. Sivakumar et al.

    A network-based model for transporting extremely hazardous materials

    Operations Research Letters

    (1993)
  • A.B. Wijeratne et al.

    Multiobjective routing of hazardous materials in stochastic networks

    European Journal of Operational Research

    (1993)
  • U. Akinc et al.

    Optimal routing and process scheduling for a mobile service facility

    Networks

    (1992)
  • Y.P. Aneja et al.

    Location of a tree shaped facility in a network

    INFOR

    (1992)
  • R. Batta et al.

    Optimal obnoxious paths on a network: Transportation of hazardous materials

    Operations Research

    (1988)
  • O. Berman et al.

    Optimal minimax path of a single service unit on a network to nonservice destinations

    Transportation Science

    (1987)
  • O. Berman et al.

    Optimal path of a single service unit on a network to a ‘nonemergency’ destination

    Transportation Science

    (1983)
  • T.B. Boffey et al.

    Models and method for location and routing decisions relating to hazardous materials

    Studies in Locational Analysis

    (1993)
  • Bramel, J., and Simchi-Levi, D., “A location based heuristic for general routing problems”, Operations Research, to...
  • F. Buckley et al.

    Distance in Graphs

    (1990)
  • S.-M. Chin et al.

    Bicriterion routing scheme for nuclear spent fuel transportation

    Transportation Research Record

    (1989)
  • R. Church et al.

    Maximal covering tree problems

    Naval Research Logistics

    (1993)
  • J.R. Current

    The design of a hierarchical transportation network with transshipment facilities

    Transportation Science

    (1988)
  • J.R. Current et al.

    Efficient algorithms for solving the shortest covering path problem

    Transportation Science

    (1994)
  • J.R. Current et al.

    The shortest covering path problem: An application of locational constraints to network design

    Journal of Regional Science

    (1984)
  • J.R. Current et al.

    The median shortest path problem: A multiobjective approach in the design of transportation networks

    Transportation Science

    (1987)
  • J.R. Current et al.

    The minimum covering/shortest path problem

    Decision Theory

    (1988)
  • Cited by (61)

    • Efficient algorithms for the minmax regret path center problem with length constraint on trees

      2022, Theoretical Computer Science
      Citation Excerpt :

      The problems of locating extensive facilities have been comprehensively studied in the literature [3,13,26,28,31,35–39]. For excellent surveys of extensive facility location problems, we refer to [25,30]. A network usually involves two types of parameters: weights of nodes and lengths of edges.

    • An improved algorithm for the minmax regret path center problem on trees

      2020, Journal of Computer and System Sciences
      Citation Excerpt :

      The problems of locating points and extensive facilities on the center and median models have been comprehensively studied in the literature [3,12,20,21,25,27,30,34–36]. For excellent surveys of extensive facility location problems on networks, we refer to [24,29]. A network usually involves two types of parameters: weights of nodes and lengths of edges.

    • The bi-objective insular traveling salesman problem with maritime and ground transportation costs

      2018, European Journal of Operational Research
      Citation Excerpt :

      Whereas, in this study, the demands associated to unselected nodes must be served using other selected nodes. Other related works that model the assignment of non-visited nodes to the visited nodes can be named Extended Network Design Problems or known as Extensive Facility Location Problems (Labbé et al., 1998; Mesa and Boffey, 1996; Pop, 2012). The aim of these problems is to search for a main or principal transportation structure such as paths, tours, or trees, by selecting and connecting a subset of nodes, and a secondary transportation component for serving the non-selected nodes to the main structure of the selected nodes.

    View all citing articles on Scopus
    View full text