An effective algorithm for the two-stage location problem on a tree-like network
- 39 Downloads
A two-stage facility location problem on a tree-like network is considered under the restriction that the transportation costs for a unit of production from one node to another is equal to the sum of the edges in the path connecting these nodes. Some exact algorithm with time complexity O(nm 3) is suggested for this problem, where n is the number of the production demand points and, m is an upper bound on the number of possible facility location sites of each stage.
Keywordstwo-stage facility location problem polynomial algorithm tree-like network
Unable to display preview. Download preview PDF.
- 1.V. L. Beresnev, E. Kh. Gimadi, and V. T. Dementiev, Extremal Standardization Problem (Nauka, Novosibirsk, 1978) [in Russian].Google Scholar
- 5.Discrete Location Theory (Wiley & Sons, New York, 1990).Google Scholar
- 6.J. Zhang, “Approximating the Two-Level Facility Location Problem via a Quasi-Greedy Approach,” in Proceedings of 15th ACM-SIAM Symposium on Discrete Algorithms SODA (New Orleans, Louisiana, USA, January 11–14, 2004) (SIAM, Philadelphia, 2004), pp. 808–817.Google Scholar
- 7.A. F. Bumb and W. Kern, “A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem,” in Lecture Notes in Computer Science, Vol. 2129: Proceedings of APPROX-RANDOM2001 (Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques) (Berkeley, CA, USA, August 18–20, 2001) (London, Springer, 2001), pp. 55–62.Google Scholar