• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.29-39
• /
• 2009

In an environment of global competition, the success of a manufacturing corporation is directly related to how it plans and executes production in particular as well as to the optimization level of its process in general. This paper proposes a production planning algorithm for the Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP) in supply chain network considering back-order. MLCLSP corresponds to a mixed integer programming (MIP) problem and is NP-hard. Therefore, this paper proposes an effective algorithm, GRHS (GRASP-based Rolling Horizon Search) that solves this problem within reasonable computational time and evaluates its performance under a variety of problem scenarios.

• Journal of Communications and Networks
• /
• v.18 no.6
• /
• pp.884-891
• /
• 2016

The wireless mesh network (WMN) has attracted significant interests as a broadband wireless network to provide ubiquitous wireless access for broadband services. Especially with incorporating multiple orthogonal channels and multiple directional antennas into the WMN, each node can communicate with its neighbor nodes simultaneously without interference between them. However, as we allow more freedom, we need a more sophisticated algorithm to fully utilize it and developing such an algorithm is not easy in general. In this paper, we study a joint channel assignment, link scheduling, routing, and rate control problem for the WMN with multiple orthogonal channels and multiple directional antennas. This problem is inherently hard to solve, since the problem is formulated as a mixed integer nonlinear problem (MINLP). However, despite of its inherent difficulty, we develop an algorithm to solve the problem by using the generalized Benders decomposition approach [2]. The simulation results show the proposed algorithm provides the optimal solution to maximize the network utility, which is defined as the sum of utilities of all sessions.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.572-574
• /
• 1998

This paper describes design method of control system with a pre-compensator using a neural network to compensate a error signal between a reference' signal and system response. The neural network which is used here is the mixed structure and it's algorithm is a back propagation that modify coupling coefficients. Applying this method to the position control system using DC servo motor as a driver, we verify the usefulness of this method with simulation.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.734-741
• /
• 2002

The importance of efficient Supply Chain Management is increasing in accordance with recent industrial environment, such as globalization of business, complexity and diversity of company's management structure, and variety of customer's demand. In a rapidly changed environment of business, quick and efficient decision making is the important matter to the survival of the company. The purpose of this study supports decision making for efficient supply chain management. In this study, we consider simultaneously and mutually reflecting the preference of each constituent (Supplier, Manufacturing plant, Distribution center, Customer) on supply chain network, and decide company's strategic choice and coordinated production/distribution models of company. The Analytical Hierarchy Process is used for decision making of qualitative and quantitative elements. We use the results of AHP as inputs and propose mathematical models thru Mixed Integer Programming.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.381-385
• /
• 2004

In this paper, We consider various service models and mechanisms as a part of study for offering QoS with the requirement of user and discuss genetic algorithm and hybrid genetic algorithm for routing optimization in broa㏈and convergence network. If routing optimization based on OSPF is not sufficient, a number of MPLS paths can be set up to further improve QoS. We propose two mixed-integer programming models for the complementary MPLS problem, and consider the maximum link utilization within the network as the relevant network QoS measure

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.1007-1017
• /
• 1997

The existing survivability measure is defined as the only ratio of survival traffic volume on the given traffic demand. In this paper we suggest a new network survivability evaluation model. Sinceit depends on the importance of traffic, we can evaluatethe affect of telecommunication disaster. With the suggested evaluation model we formulate optimization models for restoration paths and traffic assinment on them. The optimization models are represented as mixed integer programming problems, which are difficult to find exact solutions. We develop heuristic algorithms according to the optimization models and apply them to an example network with 10 nodes and 17 links.

• Journal of the Korea Society for Simulation
• /
• v.22 no.4
• /
• pp.149-156
• /
• 2013

In this research, we dealt with an optimization problem which aims to minimize total cost of resources usage and network routing in a smart node environment. Toward this, we briefly introduced technology trends in smart nodes, methods in resource optimization fields, economic effects of smart network and content delivery (or distribution) network (CDN). Moreover, based on CDN we proposed and implemented a mathematical (mixed integer) programming model to combine replica placement and requests distribution problem (RPRDP) and routing problem. Computational result of an example on RPRDP+Routing problem is also provided.

• 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.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.2 no.4
• /
• pp.215-221
• /
• 2007

IPv6 is a protocol to solve the address space limitation of IPv4 by IETF. Many transition mechanism to communicate between IPv4 and IPv6 in mixed IPv4/IPv6 network are proposed. DSTM tunneling is a mechanism that dual stack in IPv6 network is able to communicate with node in IPv4 network by dynamic allocating the IPv4 address. This mechanism supports the execution of IPv4 dependent application without modification at IPv6 network. In this paper, we explain the security vulnerability at DSTM network for DHCP attack, TEP attack, and source spoofing attack then describe the result of attacks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.422-434
• /
• 2002

We propose 3-layered hierarchical fiber-optic backbone transmission network composed of B-DCS, Backbone ring, Edge ring for efficient transmission of high capacity traffic and consider design method to ensure network survivability of each layer at affordable cost. Mathematical ring-construction cost minimization using MIP(Mixed Integer Programming) models results in NP-complete problem. So, it is hard to solve it within reasonable computing time. on a large-scale network. Therefore we develop heuristic algorithms solving WSCAP(Working and Spared Channel Assignment Problem) for B-DCS, MRLB(Multi-Ring Load Balancing) problem for Backbone ring, and ORLB(Overlayed Ring Load Balancing) problem for Edge ring and show their usefulness through case study.