• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.327-330
• /
• 2007

This article discusses a capacity planning method in QoS-guaranteed IP networks such as BcN (Broadband convergence Network). Since IP based networks have been developed to transport best-effort data traffic, the introduction of multi-service component in BcN requires fundamental modifications in capacity planning and network dimensioning. In this article, we present the key issues of the capacity planning in multi-service IP networks. To provide a foundation for network dimensioning procedure, we describe a systematic approach for classification and modeling of BcN traffic based on the QoS requirements of BcN services. We propose a capacity planning framework considering data traffic and real-time streaming traffic separately. The multi-service Erlang model, an extension of the conventional Erlang B loss model, is introduced to determine required link capacity for the call based real-time streaming traffic. The application of multi-service Erlang model can provide significant improvement in network planning due to sharing of network bandwidth among the different services.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.540-549
• /
• 2018

This paper proposes the method of active distribution network expansion planning considering distributed generation integration and distribution network reconfiguration. The distribution network reconfiguration is taken as the expansion planning alternative with zero investment cost of the branches. During the process of the reconfiguration in expansion planning, all the branches are taken as the alternative branches. The objective is to minimize the total costs of the distribution network in the planning period. The expansion alternatives such as active management, new lines, new substations, substation expansion and Distributed Generation (DG) installation are considered. Distribution network reconfiguration is a complex mixed-integer nonlinear programming problem, with integration of DGs and active managements, the active distribution network expansion planning considering distribution network reconfiguration becomes much more complex. This paper converts the dual-level expansion model to Second-Order Cone Programming (SOCP) model, which can be solved with commercial solver GUROBI. The proposed model and method are tested on the modified IEEE 33-bus system and Portugal 54-bus system.

• Journal of Korean Society of Rural Planning
• /
• v.23 no.3
• /
• pp.37-51
• /
• 2017

There has been a growing concern on ontology especially in recent knowledge-based industry and defining a field-customized semantic word network is essential for building it. In this paper, a word network for ontology is established with 785 publications of Korean Society of Rural Planning(KSRP), from 1995 to 2017. Semantic relationships between words in the publications were quantitatively measured with the 'normalized pointwise mutual information' based on the information theory. Appearance and co-appearance frequencies of nouns and adjectives in phrases are analyzed based on the assumption that a 'noun phrase' represents a single 'concept'. The word network of KSRP was compared with that of $WordNet^{TM}$, a world-wide thesaurus network, for the verification. It is proved that the KSRP's word network, established in this paper, provides words' semantic relationships based on the common concepts of Korean rural planning research field. With the results, it is expecting that the established word network can present more opportunity for preparation of the fourth industrial revolution to the field of the Korean rural planning.

• Korean Management Science Review
• /
• v.19 no.2
• /
• pp.91-124
• /
• 2002

The use of network planning models and tools is essential for effective KII (Korea Information Infrastructure) planning and analysis in that it will significantly reduce the risk and uncertainty embeded in the development and the provision of future broadband services. The purpose of this study is to develop a theoretical framework and a computer tool for modeling the various aspects of the KII topology and architecture and evaluating the techno-economic feasibility of the KII implementation strategy.

• Korean Journal of Social Welfare
• /
• v.59 no.3
• /
• pp.281-304
• /
• 2007

The purpose of this study is to verify the applicability of concept mapping in the process of planning of network outcomes in social welfare. Planning and evaluation of network outcomes involve many stakeholders. Recognizing the value and range of individuals' perspectives in the creation of a common framework is one of the biggest methodological challenges for planning of network outcomes. Concept mapping is a kind of methodology that creates a stakeholder-authored visual geography of ideas from a group. It uses both a quantitative and qualitative approach, including brainstorming, structuring the statement, specific analysis and data interpretation methods to produce maps that can then be used to guide planning and evaluation efforts on the issues that matter to the group. 13 network managers who work in the social welfare centers in Busan are core participants. The 50 statements on network outcomes from brainstorming session fell into six distinct clusters. After the interpretation session these clusters were rated according to the seven rating scales. This paper explores applicability of concept mapping in the process of planning of network outcomes in social welfare. Concept mapping helps stakeholders with different value and ideas about network outcomes to consensus on common conceptual framework. In addition, a multidimensional conceptualization of network outcomes was made. It will assist in designing future outcomes evaluation and guide the evaluators through a selection of key activities and outcomes.

• Industrial Engineering and Management Systems
• /
• v.9 no.3
• /
• pp.227-241
• /
• 2010

A memory module industry's supply chain usually consists of multiple manufacturing sites and multiple distribution centers. In order to fulfill the variety of demands from downstream customers, production planners need not only to decide the order allocation among multiple manufacturing sites but also to consider memory module industrial characteristics and supply chain constraints, such as multiple material substitution relationships, capacity, and transportation lead time, fluctuation of component purchasing prices and available supply quantities of critical materials (e.g., DRAM, chip), based on human experience. In this research, a directed graph-based supply network planning (DGSNP) model is developed for memory module industry. In addition to multi-site order allocation, the DGSNP model explicitly considers production planning for each manufacturing site, and purchasing planning from each supplier. First, the research formulates the supply network's structure and constraints in a directed-graph form. Then, a proposed genetic algorithm (GA) solves the matrix form which is transformed from the directed-graph model. Finally, the final matrix, with a calculated maximum profit, can be transformed back to a directed-graph based supply network plan as a reference for planners. The results of the illustrative experiments show that the DGSNP model, compared to current memory module industry practices, determines a convincing supply network planning solution, as measured by total profit.

• Journal of Computational Design and Engineering
• /
• v.2 no.2
• /
• pp.105-112
• /
• 2015

Product Lifecycle Management (PLM) ranges from design concepts of products to disposal. In this paper, we focus on the production planning phase in PLM, which is related to process planning and production scheduling and so on. In this study, key decisions for the creation of production plans are defined as production-planning attributes. Production-planning attributes correlate complexly in production-planning problems. Traditionally, the production-planning problem splits sub-problems based on experiences, because of the complexity. In addition, the orders in which to solve each sub-problem are determined by priorities between sub-problems. However, such approaches make solution space over-restricted and make it difficult to find a better solution. We have proposed a representation of combinations of alternatives in production-planning attributes by using Zero-Suppressed Binary Decision Diagrams. The ZDD represents only feasible combinations of alternatives that satisfy constraints in the production planning. Moreover, we have developed a solution search method that solves production-planning problems with ZDDs. In this paper, we propose an approach for managing solution candidates by ZDDs' network for addressing larger production-planning problems. The network can be created by linkages of ZDDs that express constraints in individual sub-problems and between sub-problems. The benefit of this approach is that it represents solution space, satisfying whole constraints in the production planning. This case study shows that the validity of the proposed approach.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.5
• /
• pp.593-599
• /
• 1999

A mobile robot in FMS environment should be able to nevigate itself. Therefore, path planning is necessary for the mobile robot to perform its tasks without being lost. Path planning using a network model gives oprimal paths to every pair of nodes but building this model demands accurate information of environments. In this paper, a method to build a network model using sonar sensors is presented. The main idea is to build a quad tree model by using sonar sensors and convert the model to a network model for path planning. The new method has been implemented on a mobile robot. Experimental results show that the mobile robot constructs an accurate network model using inaccurate sonar data.

• Korean Management Science Review
• /
• v.28 no.3
• /
• pp.1-13
• /
• 2011

Hub-and-spoke transportation network is a powerful and useful network structure that takes full advantage of economies of scale on routes between hubs. In recent studies, the network structure is extended to hybrid hub-andspoke that allows direct transportation between spokes. In this study, we considered more extended network structure which is called hybrid multiple hub-and-spoke that has multiple hubs and allows direct transportation between spokes. We developed a mathematical optimization model for automotive service parts transportation planning under hybrid multiple hub-and-spoke network structure. The model suggests a long-term transportation route planning and a short-term vehicle assignment planning. The model is verified by simulation and validated in real world application to Hyundai Mobis automotive service parts transportation planning. From the simulation result, the model reduced the transportation cost about 24.7%, the total distance about 6.8% and the CO2 emissions about 8.8%. In real world application for 6 months from July to December 2010, the model reduced the transportation cost about 9.1% by changing the long-term transportation route without daily vehicle assignment planning.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.709-712
• /
• 1996

Generating a project network of a specific construction project is very time consuming and difficult task in the field. To effectiviely automate and support the planning process, we design a case-based project planning expert system inspired by the fact a human expert project planner uses previous cases for planning a new project. A construction project case consist of its specific characteristics and the corresponding project network (i.e. project plan). Using frame based representation. we represent the project features affecting the progress network and the entities composing the project plan such as the buildings, construction methods, WBS (work breakdown structure), activities, and resources. The project planning process runs through most similar case retrieval, case adaptation, and user requirement satisfaction. We represent the construction domain knowledge for each procedure using constraints and rules. We develop the methodology for constraint-based case adaption. Case adaptation process mainly consist of activity generation/deletion and predecence constraint satisfaction, for which we develop the dynamic constraint generation method and connect user-level requirement representation the system-level network modification knowledge. The methodology is being applied to the prototype for apartment construction project planning.