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 language | English (US) |
|---|---|
| Pages | 1-6 |
| Number of pages | 6 |
| State | Published - 2004 |
| Externally published | Yes |
| Event | IIE Annual Conference and Exhibition 2004 - Houston, TX, United States Duration: May 15 2004 → May 19 2004 |
Other
| Other | IIE Annual Conference and Exhibition 2004 |
|---|---|
| Country/Territory | United States |
| City | Houston, TX |
| Period | 5/15/04 → 5/19/04 |
Keywords
- Generalized Congested Regions
- Rectilinear Distance Metric
- Single Facility Location/Layout
ASJC Scopus subject areas
- General Engineering