네트워크 상에서 일정 반경 범위로 피해를 끼치는 환경 오염 설비의 위치 선정에 관한 연구

학위논문(석사) - 한국과학기술원 : 산업공학과, 1990.2, [ ii, 64 p. ]This thesis considers the problem of locating an obnoxious facility that will inflict damage within a neighborhood λ(λ≥0) of its location point on a given Euclidean network. The objective of the problem is to find a location point that minimizes the sum of weights within a circle of radius λ centered at the location point. In the problem, each weight represents a numerical scale which typically signifies the extent of the undesirability (or the damage cost) due to the facility located near the weighted point. The weights are assumed discretely distributed over all the nodes are continuously uniformly distributed on links of the network. For the problem, the optimal solution properties are analyzed, and ended up with a conclusion that there is at least one optimal location point in a finite set of points in the network. Furthermore, it is shown that such a set can be easily generated. An extension problem of finding such a location point with additional consideration of the customer service costs is also considered. The objective function of this problem is analyzed, and both exact heuristic procedures to find an optimal location point are suggested.한국과학기술원 : 산업공학과

거리에따라 다른 서비스비중을 갖는 네트워크상에서의 시설 위치선정

학위논문(박사) - 한국과학기술원 : 산업공학과, 1994.2, [ v, 127 p. ]This thesis considers four different problems of locating a facility where each location is specified by distance-dependent service weight on network, while the service weight is given in a nonincreasing function of distance. The first problem considers the subject of locating a facility on a Euclidean network that could inflict the equivalent damage within a λ distance of its location point. The second problem considers the subject of locating a facility on a Euclidean network where the damage inflicted on a weighted point within a circle of radius λ centered at the location point decreases linearly as the distance between the location point and the weighted point increases. The third problem considers the subject of locating a facility on a general network that could inflict damage within a λ-boundary along shortest paths from the location point. Finally, this thesis considers the problem of locating a facility on each of a Euclidean network and a general network where an undesirable vehicle is employed for some material transportation between the facility and all the associated customers located on the network. For each of these problems, the optimal solution properties are characterized to develop the associated solution algorithms. All the algorithms are tested for their efficiencies and effectivenesses with various numerical examples.한국과학기술원 : 산업공학과