• 대한산업공학회지
• /
• 제26권4호
• /
• pp.296-305
• /
• 2000

Virtual wavelength path (VWP) is the optical path when a wavelength conversion is possible in a wavelength division multiplexing (WDM) network that is transmission infrastructure for the next generation high speed backbone networks. To achieve efficient design for VWP networks, we must consider VWP routing, wavelength assignment, and wavelength conversion while satisfying many technical constraints of the WDM networks. In this study we propose an integrated model for efficient VWP design in WDM networks. We also develope a 3-phase algorithm, each of which deals with routing, wavelength assignment and route and wavelength reassignment, respectively. In our computational experiments, phase 1 algorithm can solve the problem to the optimality for medium size test networks. Phase 2 algorithm is an efficient heuristic based on a reduced layered network and can give us an effective wavelength assignment. Finally, phase 3 algorithm reconfigure VWP routing and its wavelength assignment to concentrate wavelength conversion nodes in the suggested VWP network.

• Journal of applied mathematics & informatics
• /
• 제40권5_6호
• /
• pp.857-871
• /
• 2022

In this work, we formulated a mathematical model for divorce in marriage and extended in to an optimal control model. Firstly, we qualitatively established the model positivity and boundedness. Also we saw sensitivity analysis of the model and identified the positive and negative indices parameters. An optimal control model were developed by incorporating three time dependent control strategies (couple relationship education, reducing getting married too young & consulting separators to renew their marriage) on the deterministic model. The Pontryagin's maximum principle were used for the derivation of necessary conditions of the optimal control problem. Finally, with Newton's forward and backward sweep method numerical simulation were performed on optimality system by considering four integrated strategies. So that we reached to a result that using all three strategies simultaneously (the strategy D) is an optimal control in order to effectively control marriage divorce over a specified period of time. From this we conclude that, policymakers and stakeholders should use the indicated control strategy at a time in order to fight against Divorce in a population.

• 로봇학회논문지
• /
• 제19권1호
• /
• pp.8-15
• /
• 2024

This paper proposes a linear model predictive control of 6-DOF remotely operated underwater vehicles using nonlinear robust internal-loop compensator (NRIC). First, we design a integrator embedded linear model prediction controller for a linear nominal model, and then let the real model follow the values calculated through forward dynamics. This work is carried out through an NRIC and in this process, modeling errors and external disturbance are compensated. This concept is similar to disturbance observer-based control, but it has the difference that H_∞ optimality is guaranteed. Finally, tracking results at trajectory containing the velocity discontinuity point and the position tracking performance in the disturbance environment is confirmed through the comparative study with a traditional inverse dynamics PD controller.

• 한국분무공학회지
• /
• 제20권4호
• /
• pp.247-253
• /
• 2015

Recently, the engine calibration technique has been much more complicated than that of the past engine case in order to satisfy the strict emission regulations. The current calibration method for the diesel engine which has an increasing market is both costly and time-consuming. New engine calibration method is required to develop for high-quality diesel engines with low cost and release it at the appropriate time. This study provides the optimal calibrating technique for complex engine systems using statistical modeling and numerical optimization. Firstly, it design a test plan based on Design of Experiments, a V-optimality methodology which is suitable looking for set-points, and determine the shape of test engine response. Secondly, it uses functions to make linear regression model for data analysis and optimization to fit the models of engines behavior. Finally, it generates the optimal calibrations obtained directly from empirical engine models using Grey Relational Analysis and compares the calibrations with data. This method can develop a process for systematically identifying the optimal balance of engine emissions.

• 지식경영연구
• /
• 제20권3호
• /
• pp.39-47
• /
• 2019

Response surface methodology (RSM) is a group of statistical modeling and optimization methods to improve the quality of design systematically in the quality engineering field. Its final goal is to identify the optimal setting of input variables optimizing a response. RSM is a kind of knowledge management tool since it studies a manufacturing or service process and extracts an important knowledge about it. In a real problem of RSM, it is a quite frequent situation that considers multiple responses simultaneously. To date, many approaches are proposed for solving (i.e., optimizing) a multi-response problem: process capability function approach, desirability function approach, loss function approach, and so on. The process capability function approach first estimates the mean and standard deviation models of each response. Then, it derives an individual process capability function for each response. The overall process capability function is obtained by aggregating the individual process capability function. The optimal setting is given by maximizing the overall process capability function. The existing process capability function methods usually use the arithmetic mean or geometric mean as an aggregation operator. However, these operators do not guarantee the Pareto optimality of their solution. Moreover, they may bring out an unacceptable result in terms of individual process capability function values. In this paper, we propose a maximin-based process capability function method which uses a maximin criterion as an aggregation operator. The proposed method is illustrated through a well-known multiresponse problem.

• 조명전기설비학회논문지
• /
• 제19권6호
• /
• pp.109-116
• /
• 2005

최근의 통신매체로는 함축적이고 인식이 용이한 영상/비디오가 매우 선호되고 있다. 그러나 이들 데이터는 그 양이 과다해 영상/비디오 데이터의 압축이 큰 연구과제가 되어 왔다. 본 논문에서는 영상압축 시 그 성능을 크게 좌우할 수 있는 데이터 형식의 최적화에 관련되고, 웨이블릿 변환과 이를 이용한 JPEG2000을 기반으로 한다. 본 논문에서는 이산 웨이블릿 변환 시 이용되는 데이터 형식을 결정하는데 있어서의 기준을 주파수 변환 및 양자화 과정에서의 데이터 손실 양으로 설정하였으며, 이를 바탕으로 실험적으로 최적의 데이터 형식을 도출하였다. 그 결과 필터계수는 (1, 9)의 10-비트 고정소수점 형식, 웨이블릿 계수는 (9, 7)의 16-비트 고정소수점 형식이 최적임을 확인하였다.

• 대한전자공학회논문지TE
• /
• 제42권4호
• /
• pp.7-14
• /
• 2005

최근의 통신매체로는 함축적이고 인식이 용이한 영상/비디오가 매우 선호되고 있다. 그러나 이들 데이터는 그 양이 과다해 영상/비디오 데이터의 압축의 큰 연구과제가 되어 왔다. 본 논문에서는 영상압축 시 성능을 크게 좌우할 수 있는 데이터 형식의 최적화에 관련되고, 웨이블릿 변환과 이를 이용한 JPEG2000을 기반으로 한다. 본 논문에서는 이산 웨이블릿 변환 시 이용되는 데이터 형식을 결정하는데 있어서의 기준을 주파수 변환 및 양자화 과정에서의 데이터 손실 양으로 설정하였으며, 이를 바탕으로 실험적으로 최적의 데이터 형식을 도출하였다. 그 결과, 필터계수는 (1, 9)의 10-비트 고정소수점 형식, 웨이블릿 계수는 (9, 7)의 16-비트 고정소수점 형식이 최적임을 확인하였다.

• 한국콘텐츠학회논문지
• /
• 제16권12호
• /
• pp.373-382
• /
• 2016

이산화탄소 포집 및 저장 / 격리 (CCS) 기술은 많은 이산화탄소 저감 방법 중 이상적인 방법으로 주목 받고 있다. 이산화탄소를 포집해서 파이프라인을 통해 저장소까지 수송할 때, 저장소가 가까운 경우 직접 수송할 수도 있지만, 중간 저장의 역할을 하는 허브를 거쳐 수송할 수도 있다. 허브의 수와 위치를 결정하는 것은 중요한 문제이다. 다목적 의사 결정을 위한 수학 모델은 많은 제약식과 목적식을 수반하는데, 문제의 계산 복잡도가 증가하지만 항상 최적을 보장하지 않는다. 본 연구에서는, 이산화탄소 수송망에서 중간 저장 허브의 위치와 수를 결정하는 알고리즘을 제안하고, 이를 활용하여 이산화탄소 발생지의 연결 네트워크 시뮬레이터를 개발한다. 시뮬레이터에서는 또한 이산화탄소의 수송 경로를 제공한다. 사례 연구로 한국에 모델을 적용한다.

• Journal of Electrical Engineering and Technology
• /
• 제13권3호
• /
• pp.1069-1078
• /
• 2018

Demand response (DR) programs give opportunity to consumers to manage their electricity bills. Besides, distribution system operator (DSO) is interested in using DR programs to obtain technical and economic benefits for distribution network. Since small consumers have difficulties to individually take part in the electricity market, an entity named demand response provider (DRP) has been recently defined to aggregate the DR of small consumers. However, implementing DR programs face challenges to fairly allocate benefits and payments between DRP and DSO. This paper presents a procedure for modeling the interaction between DRP and DSO based on a bilevel programming model. Both DSO and DRP behave from their own viewpoint with different objective functions. On the one hand, DRP bids the potential of DR programs, which are load shifting and load curtailment, to maximize its expected profit and on the other hand, DSO purchases electric power from either the electricity market or DRP to supply its consumers by minimizing its overall cost. In the proposed bilevel programming approach, the upper level problem represents the DRP decisions, while the lower level problem represents the DSO behavior. The obtained bilevel programming problem (BPP) is converted into a single level optimizing problem using its Karush-Kuhn-Tucker (KKT) optimality conditions. Furthermore, point estimate method (PEM) is employed to model the uncertainties of the power demands and the electricity market prices. The efficiency of the presented model is verified through the case studies and analysis of the obtained results.

• 산업경영시스템학회지
• /
• 제44권4호
• /
• pp.32-42
• /
• 2021

The printing process can have to print various colors with a limited capacity of printing facility such as ink containers that are needed cleaning to change color. In each container, cleaning time exists to assign corresponding inks, and it is considered as the setup cost required to reduce the increasing productivity. The existing manual method, which is based on the worker's experience or intuition, is difficult to respond to the diversification of color requirements, mathematical modeling and algorithms are suggested for efficient scheduling. In this study, we propose a new type of scheduling problem for the printing process. First, we suggest a mathematical model that optimizes the color assignment and scheduling. Although the suggested model guarantees global optimality, it needs a lot of computational time to solve. Thus, we decompose the original problem into sequencing orders and allocating ink problems. An approximate function is used to compute the job scheduling, and local search heuristic based on 2-opt algorithm is suggested for reducing computational time. In order to verify the effectiveness of our method, we compared the algorithms' performance. The results show that the suggested decomposition structure can find acceptable solutions within a reasonable time. Also, we present schematized results for field application.