• 산업경영시스템학회지
• /
• 제15권25호
• /
• pp.83-90
• /
• 1992

This paper aims at the problem that design the network of Rig-star type with the minimum cost, which the Ring is composed of the selected nodes(concentrators) among the several candidate nodes on the network and other nodes(terminals) is connected to the Ring by star subnetwork. Especially, we consider the terminal reliability in network design problem. We develop the heuristic algorithm for network design problem to obtain the near optimal(best) solution for problem. We use an add-heuristic method and 2-exchange method in developing the heuristic algorithm.

• 한국경영과학회지
• /
• 제25권2호
• /
• pp.87-100
• /
• 2000

As a result of rapid advances in communication technology, fiber optics have begun to be adopted in most telecommunication systems 3s 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 been 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 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.

• 한국경영과학회지
• /
• 제25권1호
• /
• pp.67-84
• /
• 2000

In this paper, we address a network design problem including the decision of hub facility locatiions which is typically found in a communicatio and a transportation network design studies. Due to the administrative and the geographical restrictions, it is common to assume that each user should be assigned to only one hub facility. To construct such a network, three types of network costs should be considered: the fixed costs of establishing the hubs and the arcs in the network, and the variable costs associated with transversing the network. The complex problem is formulated as a mixed IP embedding a multicommodity flow problem. Exploiting its special structure, a dual-based heuristic is then developed, which yields near-optimal design plans. The test results indicate that the heuristic is an effective way to solve this computationally complex problem.

• Management Science and Financial Engineering
• /
• 제12권2호
• /
• pp.37-62
• /
• 2006

This paper considers the problem of designing logical tunnels in virtual private networks considering QoS guarantee which restricts the number of tunnel hops for each traffic routing. The previous researches focused on the design of logical tunnel itself and Steiner-tree based solution algorithms were proposed. However, we show that for some objective settings it is not sufficient and is necessary to consider both physical and logical connectivity at the same time. Thereupon, the concept of the layered network is applied to the logical tunnel design problem in virtual private networks. The layered network approach considers the design of logical tunnel as well as its physical routing and we propose a modified branch-and-price algorithm which is known to solve layered network design problems effectively. To show the performance of the proposed algorithm, computational experiments have been done and the results show that the proposed algorithm solves the given problem efficiently and effectively.

• 대한교통학회지
• /
• 제27권6호
• /
• pp.157-166
• /
• 2009

교통망설계문제(network design problem, NDP)는 교통체계(transportation system)을 최적화시키는 설계변수(design parameter, design variable)를 구하는 문제이다. 본 연구에서는 교통망설계문제를 조금 변환시킨 목표지향 교통망설계문제(target-oriented network design problem, target-oriented NDP)를 제시하고 이를 풀기 위한 기법도 제시한다. 목표지향 교통망설계는 교통운영자(traffic operator) 또는 관리자(travel manager)가 특정 교통정책 목표(target)를 미리 설정하고 이를 달성하기 위한 최적 설계변수를 찾는 문제이다. 즉, 일반적인 교통망설계문제(general NDP)는 총통행비용이나 순편익 등 특정목적함수를 최적화시키는 설계변수를 찾는데 반해, 목표지향 교통망설계(target NDP)는 사전에 설정된 목표수준(target level)을 달성하기 위한 설계변수를 구하는 문제이다. 본 연구에서 제시된 목표지향 교통망설계모형을 교통수단분담문제에 적용하여 모형을 평가한다.

• Management Science and Financial Engineering
• /
• 제6권2호
• /
• pp.29-45
• /
• 2000

We consider the design of a two-level telecommunication network having logical full-mesh/star topology, with the implementation of conduit systems taken together. The design problem is then viewed as consisting of three subproblems: locating hub facilities, placing a conduit network, and installing cables therein to configure the logical full-mesh/star network. Without partitioning into subproblems as done in the conventional approach, the whole problem is directly dealt with in a single integrated framework, inspired by some recent successes with the approach. We successfully formulate the problem as a variant of the classical multicommodity flow model for the fixed charge network design problem, aided by network augmentation, judicious commodity definition, and some flow restrictions. With our optimal model, we solve some randomly generated sample problems by using CPLEX MIP program. From the computational experiments, it seems that our model can be applied to the practical problem effectively.

• 경영과학
• /
• 제27권3호
• /
• pp.1-14
• /
• 2010

In this paper we study the access network design problem in Universal Mobile Telecommunication Systems (UMTS) networks. Given the location of radio base stations (node-Bs), their traffic demands, and the candidate facility centers for locating radio network controllers (RNCs), the problem is to determine the configuration of access network, including the number and location of facility centers, the number of RNCs in each facility center, and the links between RNCs and node-Bs, with the objective being to design such a network at the minimum cost. We provide a mathematical formulation of the problem with constraints on RNC and node-B capacities, along with a lower bounding method. We develop a heuristic algorithm with two different initial solution methods designed to strengthen the solution quality. The computational efficacy of their procedures is then demonstrated on a number of test problems.

• 대한산업공학회지
• /
• 제34권1호
• /
• pp.13-22
• /
• 2008

This paper gives reviews on current research status in telecommunication network design. Two problems are identified as major research issues. One is the WDM network design problem, where traffic grooming, virtual topology design and routing and wavelength assignment problems are considered. The other is the OSPF weight setting problem which was proposed as a practical method to implement traffic engineering capability in IP networks. After presenting surveys on those problems, we discuss potential challenging research issues in telecommunication network design.

• 한국CDE학회논문집
• /
• 제5권1호
• /
• pp.79-87
• /
• 2000

This paper presents an integrated but open product development environment for distributed and collaborative design. The web-based framework, called DOME, allows designers to build integrated models using both local and distributed resources, and to collaborate by exchanging services in a network-centric product development environment. Thus, an integrated model can be created while each participant focuses on his or her own area of expertise. A design problem model is created by connecting modules, which represent specific system components, analysis capabilities/software, disciplines, or organizations relevant to the problem. The modules interact with each other using service exchanges based upon the CORBA standard communication protocol. The goal of this framework is tall provide the ability to rapidly construct integrated design problem models to facilitate collaborative design work, improve product quality and reduce development time. Ultimately, it should allow specialized engineering applications and design problem models to operate under a common design environment.

• 한국정보시스템학회:학술대회논문집
• /
• 한국정보시스템학회 2004년도 추계학술대회
• /
• pp.37-41
• /
• 2004

The existing network can be expanded with addition of new nodes and multiple choices of link type for each nossible link. In this paper, the design problem of network expansion is defined as finding the network topology minimizing cost subject to reliability constraint. To efficiently solve the problem, an genetic algorithm approach is suggested.