Locating facilities with distance-dependent service weight on network

Abstract

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.