Article ID: | iaor20011348 |
Country: | South Korea |
Volume: | 25 |
Issue: | 2 |
Start Page Number: | 87 |
End Page Number: | 100 |
Publication Date: | Jun 2000 |
Journal: | Journal of the Korean ORMS Society |
Authors: | Yoon Moon-Gil |
Keywords: | programming: integer |
As a result of rapid advances in communication technology, fiber optics have begun to be adopted in most telecommunication systems as an economic choice. Due to the trend of evolution toward broadband communication network with fiber optics and electronic devices, the network design problem for broadband communication has received a great deal of research attention recently. In this paper, we address a topological design problem for broadband local access network with uncertain demands, which has received surprisingly little attention so far. In our problem, we select a set of hubs and links for constructing network topology, and to determine cable installation paths on the network at the minimal total cost, which contains the expected penalty cost for the amount of undersupplied in addition to the usual cost terms of the fixed demand problem. Our problem can be approximated as a mixed 0–1 integer programming problem by using Szwarc's linear approximation technique. Then the problem is transformed successfully into a version of classical network design model. Some computational experiments for the model and concluding remarks are described.