IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v30y1996i2p148-159.html
   My bibliography  Save this article

Composite Regions of Feasibility for Certain Classes of Distance Constrained Network Location Problems

Author

Listed:
  • Barbaros Ç. Tansel

    (Department of Industrial Engineering, Bilkent University, Bilkent 06533 Ankara, Turkey)

  • Gülcan N. Yeşïlkökçen

    (Michael DeGroote School of Business, McMaster University, Hamilton, Ontario, L8S 4M4 Canada)

Abstract

Distance constrained network location involves locating m new facilities on a transport network G so as to satisfy upper bounds on distances between pairs of new facilities and pairs of new and existing facilities. The problem is (N-script)(P-script)-complete in general, but polynomially solvable for certain classes. While it is possible to give a consistency characterization for these classes, it does not seem possible to give a global description of the feasible set. However, substantial geometrical insights can be obtained on the feasible set by studying its projections onto the network. The j -th projection defines the j -th composite region which is the set of all points in G at which new facility j can be feasibly placed without violating consistency. We give efficient methods to construct these regions for solvable classes without having to know the feasible set and discuss implications on consistency characterization, what if analysis, and recursive solution constructions.

Suggested Citation

  • Barbaros Ç. Tansel & Gülcan N. Yeşïlkökçen, 1996. "Composite Regions of Feasibility for Certain Classes of Distance Constrained Network Location Problems," Transportation Science, INFORMS, vol. 30(2), pages 148-159, May.
  • Handle: RePEc:inm:ortrsc:v:30:y:1996:i:2:p:148-159
    DOI: 10.1287/trsc.30.2.148
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.30.2.148
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.30.2.148?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:30:y:1996:i:2:p:148-159. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.