The planar area location/layout problem

Avijit Sarkar; Rajan Batta; Rakesh Nagi

The planar area location/layout problem

Avijit Sarkar
, Rajan Batta
, Rakesh Nagi

Department of Industrial and Systems Engineering

SUNY Buffalo

Research output: Contribution to conference › Paper › peer-review

Abstract

This paper considers the problem of placing a single rectangular generalized congested region (GCR) (closed and bounded region in ℜ₂ 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 language	English
Pages	1-6
Number of pages	6
State	Published - 2004
Event	IIE Annual Conference and Exhibition 2004 - Houston, TX, United States Duration: May 15 2004 → May 19 2004

Conference

Conference	IIE Annual Conference and Exhibition 2004
Country/Territory	United States
City	Houston, TX
Period	05/15/04 → 05/19/04

Keywords

Generalized Congested Regions
Rectilinear Distance Metric
Single Facility Location/Layout

Cite this

@conference{09a30c4db20340b49e90c83a7eaae796,

title = "The planar area location/layout problem",

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.",

keywords = "Generalized Congested Regions, Rectilinear Distance Metric, Single Facility Location/Layout",

author = "Avijit Sarkar and Rajan Batta and Rakesh Nagi",

year = "2004",

language = "English",

pages = "1--6",

note = "IIE Annual Conference and Exhibition 2004 ; Conference date: 15-05-2004 Through 19-05-2004",

}

TY - CONF

T1 - The planar area location/layout problem

AU - Sarkar, Avijit

AU - Batta, Rajan

AU - Nagi, Rakesh

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - Generalized Congested Regions

KW - Rectilinear Distance Metric

KW - Single Facility Location/Layout

UR - https://www.scopus.com/pages/publications/30044440658

M3 - Paper

AN - SCOPUS:30044440658

SP - 1

EP - 6

T2 - IIE Annual Conference and Exhibition 2004

Y2 - 15 May 2004 through 19 May 2004

ER -

The planar area location/layout problem

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this