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

Barbaros Ç. Tansel and Gülcan N. Yeşïlkökçen
Additional contact information
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

Transportation Science, 1996, vol. 30, issue 2, 148-159

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.

Date: 1996
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.30.2.148 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:30:y:1996:i:2:p:148-159

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().