Back to results list
Please use this identifier to cite or link to this item:
|Title:||A study of network location problems||Authors:||Tang, Huajun||Keywords:||Hong Kong Polytechnic University -- Dissertations
Network analysis (Planning)
|Issue Date:||2009||Publisher:||The Hong Kong Polytechnic University||Abstract:||One of the most important branches of logistics management is to investigate where to locate new facilities such as transportation hubs, air and sea ports, retail outlets, and so on. There is a wide variety of applications of facility location models. These include, but not limited to, locating a given number of ambulances to minimize the maximum response time (the time between a demand point and the nearest ambulance), and locating warehouses within a supply chain to minimize the average transportation time to market. The above two problems have different objective functions: minimax (center) for the former and minisum (median) for the latter. Facility location models differ not only in objective functions (center, median or others), but also in decision space (planar, discrete or networks), the number (singe-facility or multi-facility), capacity limit (uncapacitated or capacitated) and shape (isolated point or connected structure) of the facilities to locate, the nature of the inputs (static or dynamic; demands known with certainty or uncertainty), and other problem parameters.
This thesis focuses on studying the network location problems as follows: Demand points with certainty are taken to be at the nodes of the network, and to be served by their own nearest facilities, which are to be located anywhere in the given network. The facilities may be isolated points, or connected structures such as paths, trees, and so on. The objective is to locate a given number of uncapacitated facilities to minimize the ordered median function (OMf) and its special cases. The cost of satisfying the demand points depends on the distances between demands and facilities, which are measured by the shortest paths through the network. The organization of this thesis is as follows: Chapter 1 introduces a taxonomy of location problems and presents the definition of the ordered median problems (OMP) proposed by Nickel and Puerto (2005), and describes two main methodologies applied in this thesis. Chapter 2 presents a literature review of the network location models, including two main clues on the history and development of the ordered median problems. Chapter 3 deals with the multi-facility ordered median problem in undirected networks, in which multiple isolated facilities are to be located. Multi-facility OMP in general networks are NP-hard, since the p-median and the p-center problems are special cases. In this chapter we use a finite dominating set (FDS) to study some special instances of the OMf in networks. FDS is a finite set of points to which some optimal solutions must belong, and is very useful for solving a variety of optimization problems, which enables one to restrict one's attention to a finite set of possible solutions. We first characterize an FDS for a special convex OMP in general networks, where the convex OMP is an important class in the OMP family. The FDS result generalizes some known results in the literature. Then, based on the FDS result, we obtain a polynomial size FDS and solve the problem confined to tree networks in polynomial time, which extends some results in the literature. Chapter 4 is devoted to the multi-facility OMP in directed networks, since most of the networks in the real world are directed and not symmetric (undirected networks can be viewed as symmetric directed networks). For instance, routes are usually directed in a bus traffic system. In this chapter we again apply FDS to identify some possible solutions for a multi-facility OMP in a strongly connected directed network. We first prove that the OMP has an FDS in the node set, which generalizes the FDS result on the single-facility OMP in the literature. Furthermore, we show that the OMP can be solved efficiently based on the FDS result when the number of facilities is fixed and small. However, if the number of facilities is large, it is not practical for us to obtain an optimal solution in an efficient manner, since the OMP in directed networks is NP-hard. Hence, instead of finding an optimal solution, we resort to some approximation algorithms for some near-optimal solutions. At the end of Chapter 4, we present a 6 2/3-approximation algorithm for the p-median problem in directed networks. Chapter 5 focuses on the OMP in tree networks, in which the facilities to locate are not isolated points but connected structures (e.g., paths, trees, etc). These problems are motivated by specific decision problems related to routing and network design. In this chapter we use the "nestedness property" to investigate subtree OMP in tree networks, where the nestedness property is the property that for any optimal solution x to the point OMP, there exists an optimal subtree to the corresponding subtree OMP including x. The nestedness property provides researchers with a powerful tool to develop some efficient algorithms. First, we prove the nestedness property for a special convex OMP in tree networks. This finding extends some classical results concerning the nestedness property. Second, we solve the problem in polynomial time by applying the nestedness property result. Finally, we provide one counter example to show that the nestedness property does not hold for the non-convex case. Chapter 6, the last chapter, concludes the major findings of the thesis and suggests some directions for future research.
|Description:||viii, 82 p. : ill. ; 30 cm.
PolyU Library Call No.: [THS] LG51 .H577P LMS 2009 Tang
|URI:||http://hdl.handle.net/10397/3959||Rights:||All rights reserved.|
|Appears in Collections:||Thesis|
Show full item record
Files in This Item:
|b22755858_link.htm||For PolyU Users||162 B||HTML||View/Open|
|b22755858_ir.pdf||For All Users (Non-printable)||1.46 MB||Adobe PDF||View/Open|
Citations as of Jun 18, 2018
Citations as of Jun 18, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.