TY - JOUR
T1 - Locating a 1-Center on a Manhattan Plane with "Arbitrarily" Shaped Barriers
AU - Nandikonda, Pavankumar
AU - Batta, Rajan
AU - Nagi, Rakesh
N1 - Funding Information:
We gratefully acknowledge the support of National Science Foundation Grant DMI-9800429. Communication with Professor Herbert Edelsbrunner was helpful in proving the complexity of subcells in a plane. We appreciate very much the detailed comments from the referees that helped improve the quality of the work.
PY - 2003/10
Y1 - 2003/10
N2 - Barriers commonly occur in practical location and layout problems and are regions where neither travel through nor location of the new facility is permitted. Along the lines of (Larson and Sadiq, 1983) we divide the feasible location region into cells. To overcome the additional complications introduced by the center objective, we develop new analysis and classify cells based on number of cell comers. A procedure to determine the optimal location is established for each class of cells. The overall complexity of the approach is shown to be polynomially bounded. Also, an analogy is drawn to the center problem on a network and generalizations of the model are discussed.
AB - Barriers commonly occur in practical location and layout problems and are regions where neither travel through nor location of the new facility is permitted. Along the lines of (Larson and Sadiq, 1983) we divide the feasible location region into cells. To overcome the additional complications introduced by the center objective, we develop new analysis and classify cells based on number of cell comers. A procedure to determine the optimal location is established for each class of cells. The overall complexity of the approach is shown to be polynomially bounded. Also, an analogy is drawn to the center problem on a network and generalizations of the model are discussed.
KW - Barrier
KW - Center problem
KW - Location
UR - http://www.scopus.com/inward/record.url?scp=0345865126&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0345865126&partnerID=8YFLogxK
U2 - 10.1023/A:1026175313503
DO - 10.1023/A:1026175313503
M3 - Article
AN - SCOPUS:0345865126
VL - 123
SP - 157
EP - 172
JO - Annals of Operations Research
JF - Annals of Operations Research
SN - 0254-5330
IS - 1-4
ER -