Facility Location Problems on Tree Networks
Date Issued
2008
Date
2008
Author(s)
Wang, Hung-Lung
Abstract
Facility location problems arise in many fields such as operations research, communication, and theoretical computer science. Conventionally, depending on the requirements,acility location problems are categorized into two groups. One is the center problem, and the other is the median problem. Based on these two formulations, we investigaten this dissertation some extensions on tree networks: the backup facility location problems, the facility-centric facility location problems, and the dynamic facility locationroblems. Given that a facility may fail with a given probability, the goal of a backup facility location problem is to find a deployment such that the expected value of a given objective function is optimized. In a facility-centric facility location problem, the goal is to find the orbits and locations of all facilities such that a given objective function assumes its optimal value. In a dynamic facility location problem, the given network changes with time, and the goal is to maintain the facility of each part in the network efficiently.
Subjects
facility location problem
center
median
centdian
tree
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-97-F92922085-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):003003b6f585f38066f5aa267f44f1a9