The planar area location/layout problem

Avijit Sarkar, Rajan Batta, Rakesh Nagi

Research output: Contribution to conferencePaperpeer-review

Abstract

This paper considers the problem of placing a single rectangular generalized congested region (GCR) (closed and bounded region in ℜ2 which prohibits facility location but allows travel through at a penalty) of given area but unknown dimensions in the presence of other rectangular GCRs. Due to the variable dimensions of the new OCR, the unique classification of user-user and user-server flows through gridlines becomes challenging. We overcome this difficulty and provide solution methodologies for two variants of the problem: (i) new GCR's server located on its boundary, or (ii) at its centroid. These are shown to be polynomially bounded in the number of GCRs.

Original languageEnglish (US)
Pages1-6
Number of pages6
StatePublished - Dec 1 2004
Externally publishedYes
EventIIE Annual Conference and Exhibition 2004 - Houston, TX, United States
Duration: May 15 2004May 19 2004

Other

OtherIIE Annual Conference and Exhibition 2004
Country/TerritoryUnited States
CityHouston, TX
Period5/15/045/19/04

Keywords

  • Generalized Congested Regions
  • Rectilinear Distance Metric
  • Single Facility Location/Layout

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'The planar area location/layout problem'. Together they form a unique fingerprint.

Cite this