• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.3
• /
• pp.250-259
• /
• 2001

Given a tree structured network in which each node has its own demand and also stands for a candidate location of a potential facility, such as plant or warehouse, a capacitated facility location problem on the network (CFLPOT) is to decide capacitated facility locations so that the total demand occurred on the network can be satisfied from those facilities with the minimum cost. In this paper, we first introduce a mixed integer programming formulation for CFLPOT with two additional assumptions, the indivisible demand assumption and the contiguity assumption and then show that it can be reformulated as a tree partitioning problem with an exponential number of variables. We then show that it can be solved in O($n^2b$) time by utilizing the limited column generation method developed by Shaw (1993), where n is the total number of nodes in the network and b is the maximum facility capacity. We also develop a depth-first dynamic programming algorithm with a running time of O(nb) for finding the locally maximal reduced cost which plays an important role in the limited column generation method. Finally, we implement our algorithms on a set of randomly generated problems and report the computational results.

• IE interfaces
• /
• v.20 no.3
• /
• pp.395-406
• /
• 2007

In the telecommunication industry, estimation of the cost of network facilities is very important since depreciation cost of the facilities accounts for a large portion of the product cost. Moreover, cost estimation in the industry becomes more difficult because of increasing indirect cost upon digital convergence, expanding multi-purpose facilities, complexity of service product, etc. Nevertheless, not much seem to have been done in improving estimation methodology of the cost of network facilities. As a result, the quality of cost information on network facilities has deteriorated, and now even decision-makers in the industry dismiss the information. Recently, two major telecommunication companies adopted a new network cost estimation method to deal with the issue. In this paper, we study the concept of new cost estimation method and the procedure to develop and apply it. We also suggest the method to carry out the cost allocation using Matlab which is more efficient and time-saving than other commercial cost calculation packages.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.332-335
• /
• 2006

This paper considers a facility location problem, which is concerned with locating facilities on a supply chain network and installing the associated equipments at the facilities to meet a given set of demands. The objective function is to minimize the sum of setup cost (facility opening cost and equipment installation cost), operation cost, and distribution cost. For the equipments, various choices of equipment modes need to be determined. Moreover, in the problem, overwork is allowed each facility but at expensive operation cost. The proposed problem is characterized as being NP-hard problem, so that a heuristic algorithm is derived. In order to evaluate the performance of the proposed algorithm, computational experiments with various numerical instances are conducted.

• Korean Management Science Review
• /
• v.27 no.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.

• Korean Journal of Construction Engineering and Management
• /
• v.7 no.4 s.32
• /
• pp.91-99
• /
• 2006

The purpose of this study is propose an Artificial Neural Network(ANN) model for the construction estimate of the public educational facility at conceptual stage. The current method for the preliminary cost estimate of the public educational facility uses a single-parameter which is based on basic criteria such as a gross floor area. However, its accuracy is low due to the nature of the method. When the difference between the conceptual estimate and detailed estimate is huge, the project has to be modified to meet the established budget. Thus, the ANN model is developed by using multi-parameters in order to estimate the project budget cost more accurately. The result of the research shows 6.82% of the testing error rates when the developed model was tested. The error rates and the error range of the developed model are smaller than those of the general preliminary estimating model at conceptual stage. Since the proposed ANN model was trained using the detailed estimate information of the past 5 years' school construction data, it is expected to forecast the school project cost accurately.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.1
• /
• pp.57-70
• /
• 2004

Given a tree network on which each node has its own demand and also stands for a candidate location of a potential facility. such as plant or warehouse, the f-median problem on the network (PMPOT) is to select less than or equal to P number of facility locations so that the whole demand on a node is satisfied from only one facility and the total demand occurred on the network can be satisfied from those facilities with the minimum total cost, where the total cost Is the sum of transportation costs and the fixed costs of establishing facilities. Tamir(1996) developed an O(p n$^2$) algorithm for PMPOT which is known to be the best algorithm In terms of the time complexity, where n is the number of nodes in the network, but he didn't make any comments or explanation about implementation details for finding the optimal solution. In contrast to Tamir's work, Kariv and Hakimi(1979) developed O(p$^2$n$^2$) algorithm for PMPOT and presented O(n$^2$) algorithm for finding the optimal solution in detail. In this paper, we not only develop another O(p n$^2$) dynamic programming algorithm for PMPOT that is competitive to Tamir's algorithm in terms of the time complexity, but also present O(n) algorithm that is more efficient than kariv and Hakimi's algorithm in finding the optimal solution. finally, we implement our algorithm on a set of randomly generated problems and report the computational results.

• Industrial Engineering and Management Systems
• /
• v.15 no.4
• /
• pp.374-384
• /
• 2016

The efficiency of a supply chain can be extremely affected by its design which includes determining the flow pattern of material from suppliers to costumers, selecting the suppliers, and defining the opened facilities in network. In this paper, a multi-objective multi-echelon multi-product supply chain design model is proposed in which several suppliers, several manufacturers, several distribution centers as different stages of supply chain cooperate with each other to satisfy various costumers' demands. The multi-objectives of this model which considered simultaneously are 1-minimize the total cost of supply chain including production cost, transportation cost, shortage cost, and costs of opening a facility, 2-minimize the transportation time from suppliers to costumers, and 3-maximize the service level of the system by minimizing the maximum level of shortages. To configure this model a graph theoretic approach is used by considering channels among each two facilities as links and each facility as the nodes in this configuration. Based on complexity of the proposed model a multi-objective Pareto-based vibration damping optimization (VDO) algorithm is applied to solve the model and finally non-dominated sorting genetic algorithm (NSGA-II) is also applied to evaluate the performance of MOVDO. The results indicated the effectiveness of the proposed MOVDO to solve the model.

• IE interfaces
• /
• v.14 no.1
• /
• pp.30-38
• /
• 2001

Logistics network management has become one of the most important sources of competitive advantage regarding logistics cost and customer service in numerous business segments. Logistics network simulation is a powerful analysis method for designing and planning the logistics network optimally in an integrated way. This paper introduces a logistics network simulator, LONSIM, developed by author. LONSIM deploys a mix of simulation and optimization functions to model and analysis logistics network issues such as facility location, inventory policy, manufacturing policy, transportation mode, warehouse assignment, supplier assignment, order processing priority rule, and vehicle routes. LONSIM is built with AweSim 2.1 and Visual Basic 6.0, and executed in windows environment.

• ETRI Journal
• /
• v.30 no.4
• /
• pp.587-596
• /
• 2008

Facility-based competition (FBC) in the telecommunications market is considered to have lower static efficiency in the short term and higher dynamic efficiency in the long term. Under service-based competition (SBC), the entrant can reduce its setup costs by leasing network facilities from the incumbent, which makes the entrant viable, pushes the market price down and promotes static efficiency. This paper attempts to measure static efficiency by comparing the profits of the incumbent and entrant in terms of consumer surplus and social welfare under each competition type by extending the Stackelberg model. The results, assuming a linear demand function and variation in regulatory level, show that FBC results in higher social welfare than SBC on the whole. However, SBC accompanied by strong regulation is also shown to have the potential to be superior over FBC. It is also revealed that FBC exhibits a higher producer surplus (particularly, the incumbent's producer surplus) and is, therefore, more desirable in terms of dynamic efficiency. When the entrant's cost is high in FBC, social welfare is shown to be lowered, implying that cost competitiveness is a necessary condition for social welfare.

• The Journal of the Korea Contents Association
• /
• v.18 no.8
• /
• pp.102-108
• /
• 2018

The existing data transmission technology applied between the non-secure external internet and the secure internal business network has various problems when applied to the building facility management SCADA system control network. Traditional inter-network data transfer technologies involve high complexity and high costs because blacklist-based security techniques are applied to all data. However, whitelist-based security techniques can be applied to data distributed in Building Facility Management SCADA control systems because a small number of structured control data are repeatable and periodic. This simplifies the security technology applied to inter-network data transmission, enabling building facility management SCADA system control network deployment at low cost. In this paper, we proposed building control networks specialized in building facility management SCADA control systems by providing solutions to address and address these problems.