Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane
This paper deals with a single allocation problem in hub-and-spoke networks. We handle the case that all the nodes are embedded in a 2-dimensional plane and a transportation cost (per unit flow) is proportional to Euclidean distance. We propose a randomized (1 + 2/π)-approximation algorithm based on a linear relaxation problem and a dependent rounding procedure.
KeywordsTransportation Cost Mixed Integer Programming Transportation Problem Discrete Apply Mathematic Total Transportation Cost
Unable to display preview. Download preview PDF.
- 7.Ge, D., Ye, Y., Zhang, J.: The Fixed-Hub Single Allocation Problem: A Geometric Rounding Approach (October 2007) (manuscript)Google Scholar
- 14.Saito, H., Matuura, S., Matsui, T.: A linear relaxation for hub network design problems. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E85-A, 1000–1005 (2002)Google Scholar