COMPOSITE REGIONS OF FEASIBILITY FOR CERTAIN CLASSES OF DISTANCE CONSTRAINED NETWORK LOCATION PROBLEMS

The location problem studied in this paper involves locating several new facilities on a network, such as a transport network, so as to satisfy upper bounds on distances between pairs of new and existing facilities and pairs of new facilities. The existing facilities (demand points) are at the nodes of the network. The new facilities can be located anywhere on the network including nodes and interiors of edges. If a distance bound is imposed on a pair of facilities, those facilities are said to interact. Not all facility pairs need to interact, but those that do must be placed so as not to violate the imposed upper bounds. Such constraints are relevant in a wide range of location problems when service quality becomes unacceptable beyond certain critical distances. For example, it is appropriate that emergency service facilities be within a critical driving time of potential demand sites to avoid fatalites, damage to human life, or excessive property losses.

  • Availability:
  • Corporate Authors:

    Institute for Operations Research and the Management Sciences

    901 Elkridge Landing Road, Suite 400
    Linthicum, MD  United States  21090-2909
  • Authors:
    • Tansel, B C
    • Yesilkokcen, G N
  • Publication Date: 1996-5

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00721943
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jun 26 1996 12:00AM