• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.1
• /
• pp.33-44
• /
• 2001

In this paper, we address a problem of traffic grooming and wavelength routing in all optical WDM ring networks. Given a traffic demand for each node pair, we should aggregate the traffic onto lightpaths between pairs of nodes to transport the demand, and set up the routing path for each lightpath with minimum number of wavelengths to be assigned to lightpaths. In this paper, we formulate our problem as a mixed Integer Programming model. Owing to the problem complexity, it is hard to find an optimal solution for our problem. hence, we develop a heuristic algorithm to solve our problem efficiently. From the computational experiments, we can find the proposed heuristic is very satisfactory in both the computation time and the solution quality generated.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.864-867
• /
• 2003

e-러닝이 세간의 관심을 모으는 이유는 교육의 패러다임이 바뀔 수 있다는 점이다. 교육은 모든 분야에 필수적이고, 교육 방식이 바뀐다는 의미는 새로운 시장이 만들어진다는 것이다. 하지만 온라인 교육이 가질 수 있는 장점들을 제대로 활용하지 못한다면 새로운 시장이 만들어진다 하더라도 쉽게 시들어 갈 것이며, 최근에 나와 있는 e-learning과 관련된 사이트들을 보더라도 전자상거래나 쇼핑몰 혹은 검색, 포털 사이트처럼 빠르게 성장할 수 없다 우리는 학창 시절에 어떠한 친구를 만나느냐, 혹은 어떠한 짝꿍을 만나느냐에 따라서 본인의 학습 성취도는 매우 다르다는 것을 경험해 보았을 것이다. 이에 본 논문에서는 학습자들에게 보다 쉽게 짝 찾는 방법과 짝 짓는 방법을 제공하여 학습자들간의 상호협력을 이루어 문제해결 능력과 새로운 지식을 만들어 갈 수 있도록 하였으며, 짝 프로그래밍을 통해서 학습자는 최적의 짝꿍을 만나 지속적인 상호작용으로 흥미와 집중을 유지하여 적극적이고 완전한 학습이 이루어질 수 있도록 하였다. 끝으로 본 연구가 웹 상의 학습자들에게 서로간의 대화를 통해 에러의 원인을 효과적으로 찾아 바로 잡을 수 있는 짝 프로그래밍을 제공했다는 점에서 새로운 학습 시스템의 개발방법을 제시했다고 결론지을 수 있다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.104.1-104
• /
• 2001

This paper presents a technique to development load control and management system in order to limits a maximum load demand and saves electric energy consumption. The computer programming proper load forecasting algorithm associated with programmable logic control and digital power meter through inform of multidrop network RS 485 over the twisted pair, over all are contained in this system. The digital power meter can measure a load data such as V, I, pf, P, Q, kWh, kVarh, etc., to be collected in statistics data convey to data base system on microcomputer and then analyzed a moving linear regression of load to forecast load demand Eventually, the result by forecasting are used for compost of load management and shedding for demand monitoring, Cycling on/off load control, Timer control, and Direct control. In this case can effectively reduce the electric energy consumption cost for 10% ...

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.1122-1127
• /
• 2003

Typical application of detecting piecewise-linear curves includes vectorizing of scanned drawings whirh is a vital step in installing any geographic information system. This paper considers the problem of optimally approximating a piecewise linear curve to a set of digital points while satisfying given intersection angles between each pair of neighboring lines. The criterion for optimality is to minimize the sum of squared deviations. The problem is formulated as an unconstrained nonlinear programming model. An algorithm which guarantees an optimal solution is then proposed and its validity is tested with both a synthetically generated image and a real image. The test results illustrate the excellent performance of the proposed algorithm.

• IE interfaces
• /
• v.22 no.3
• /
• pp.263-277
• /
• 2009

This research deals with a task assignment problem to worker group which consists of one master and one assistant. Each task must be assigned to only one worker group and it is possible to make a pair of each master and each assistant to organize a worker group. A worker group may have more than one task assigned to it, but the workloads of each worker group must be balanced within the allowable range. This problem can be formulated mathematically using the Mixed Integer Programming(MIP), where the objective function is to minimize the total assignment cost. A two phase heuristic algorithm is suggested in order to find approximate solutions. The first phase is to obtain an initial solution, where the initial assignment is performed to follow the workload adjustment. In the second phase, the solution is improved through the repeated process of the exchange and the assignment adjustment. Numerical experiments have been performed to evaluate the performance of the heuristic algorithm.

• Journal of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.17-28
• /
• 2010

In this paper we deal with linear chance-constrained optimization problems, a class of problems which naturally arise in practical applications in finance, engineering, transportation and scheduling, where decisions are made in presence of uncertainty. After giving the deterministic equivalent formulation of a linear chance-constrained optimization problem we construct a conjugate dual problem to it. Then we provide for this primal-dual pair weak sufficient conditions which ensure strong duality. In this way we generalize some results recently given in the literature. We also apply the general duality scheme to a portfolio optimization problem, a fact that allows us to derive necessary and sufficient optimality conditions for it.

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

This paper deals with an offline routing problem, which can be used as an explicit routing procedure in MPLS(Multiprotocol Label Switching) network, for traffic engineering. This problem is formulated as an MIP(Mixed Integer Programming) with the objective function which is to minimize the sum of the maximum link utilization for load balancing (link utilization) and the routing cost. Constraints arc composed of link capacity restriction and demand requirement that has origin-destination pair, bandwidth requirement and hop restriction. The problem is proved to be NP-hard so that the Lagrangean relaxation method is applied to propose a Lagrangean heuristic. To test the effectiveness & efficiency of the proposed algorithm, computational experiments are performed with numerical instances. The experiment results show that the proposed algorithm solves the problem within a reasonable time.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1395-1408
• /
• 2010

In this paper, a pair of Wolfe type second-order nondifferentiable multiobjective symmetric dual program over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under second-order (F, $\alpha$, $\rho$, d)-convexity assumptions. An illustration is given to show that second-order (F, $\alpha$, $\rho$, d)-convex functions are generalization of second-order F-convex functions. Several known results including many recent works are obtained as special cases.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.25-36
• /
• 1997

The purpose of this paper is to structure a new integrated model that can minimize the total cost for the transportation and inventory systems between m origin points, where origin i has a supply of a commodity, such as distribution centers or warehouses, and n destination points, where destination j requires the commodity. In this case, demands of the destination points are assumed random variables which have a known probability distribution. We will find optimal distribution centers which transport the commodity to the destination points and suggest optimal inventory policy to the selected distribution center which find the optimal pair $$ and safety stock level that minimize total cost with back-ordered case. This new model is formulated as a 0-1 nonlinear integer programming problem. To solve the problem, this paper proposes heuristic computational procedures and program and provides numerical examples.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.6
• /
• pp.77-81
• /
• 2016

This paper deals with the optimization problem that decides the routing of connection between multi-source and multi-sink. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with $O(mn)^2$ time complexity to solve the optimal solution for this problem. This paper suggests the simple method that assigns the possible call flow quantity to augmenting path of ($s_i,t_i$) city pair satisfied with demand of ($s_i,t_i$). The proposed algorithm can be get the same optimal solution as LP for experimental data.