• 한국CDE학회논문집
• /
• 제2권4호
• /
• pp.215-221
• /
• 1997

A new approach in solving design centering problem is presented. Like most stochastic optimization problems, optimal design centering problems have intrinsic difficulties in multivariate intergration of probability density functions. In order to avoid to avoid those difficulties, genetic algorithm and very coarse Monte Carlo simulation are used in this research. The new algorithm performs robustly while producing improved yields. This result implies that the combination of robust optimization methods and approximated simulation schemes would give promising ways for many stochastic optimizations which are inappropriate for mathematical programming.

• Journal of Communications and Networks
• /
• 제11권3호
• /
• pp.297-305
• /
• 2009

Multiprotocol label switching (MPLS) networks require dynamic flow admission control to guarantee end-to-end quality of service (QoS) for each Internet protocol (IP) traffic flow. In this paper, we propose to tackle the joint routing and admission control problem for the IP traffic flows in MPLS networks without rerouting already admitted flows. We propose two mathematical programming models for this problem. The first model includes end-to-end delay constraints and the second one, end-to-end packet loss constraints. These end-to-end QoS constraints are imposed not only for the new traffic flow, but also for all already admitted flows in the network. The objective function of both models is to minimize the end-to-end delay for the new flow. Numerical results show that considering end-to-end delay (or packet loss) constraints for all flows has a small impact on the flow blocking rate. Moreover, we reduces significantly the mean end-to-end delay (or the mean packet loss rate) and the proposed approach is able to make its decision within 250 msec.

• 농촌계획
• /
• 제26권3호
• /
• pp.25-38
• /
• 2020

The purpose of this study is constructing a regional-level crop acreage choice model incorporating the impacts of producer risk aversion, and applying the constructed model to the Korean policy that promotes rice paddy conversion into non-rice crop fields. The study adopts the approach of Paris (2018) which estimates the absolute risk aversion coefficient inside of a positive mathematical programming model. A panel data set of 143 cities/counties is used for the empirical study where agricultural land in each region is allocated to 8 crops. Our estimated absolute risk aversion coefficients are smaller than those of Paris (2018), but are a little bit larger than those of the existing Korea studies based on survey or econometric methods. We found that there are close relationships among the estimated risk aversion, regional characteristics, and farming patterns. We also found that incorporating the estimated risk attitudes results in substantial differences in the impacts of the rice paddy conversion policy.

• 한국컴퓨터정보학회논문지
• /
• 제15권11호
• /
• pp.143-156
• /
• 2010

근거리통신망과 인터넷으로부터 유입되는 정보보호 위협이 증가하는 상황에 대처하기 위하여, 많은 기업들이 정보보호 시스템 구축을 고려하고 있다. 기업 내 의사결정자의 정보보호 도구 선택을 지원하기 위하여, 본 논문은 선형퍼지회귀분석 및 physical programming을 이용하는 세 가지 단계로 구성된 통합 프레임워크를 제안하였다. 첫째, 정보보호도구 선정 기준 및 평가 기준에 대한 전문가들의 상대평가 의견을 바탕으로, 각 정보보호 기준들 간의 관계를 정량화시키기 위하여 analytic hierarchy process 및 quality function deployment 방법을 적용하였다. 그리고, 선형퍼지회귀분석법을 활용하여 각 기준별 평가값을 산출하였다. 마지막으로, 정보보호 시스템의 품질, 정보보호 수준, 비용 등의 다수 목적함수를 효과적으로 고려하기 위하여, physical programming weights 알고리즘을 통하여 도출된 가중치에 기반한 목표계획법을 활용하여 가장 적절한 정보보호 도구를 선정하였다. 이와 같은 과정은 구체적인 예제를 통해 단계별로 설명하고 그 장점을 가시적으로 제시하였다. 본 연구에서 제안한 방법은 전문가 제공 정보에서 발생 가능한 노이즈를 효과적으로 제거함으로써, 전문가의 경험을 통한 표준 정보보호 기준의 확보와 수학적 최적화 방법을 통한 정확성 확보의 장점을 의사결정자에게 제공할 것으로 기대된다.

• 산업공학
• /
• 제17권3호
• /
• pp.282-293
• /
• 2004

Line Balancing is the problem to assign tasks to stations while satisfying some managerial viewpoints. Most researches about the Mixed-Model Line Balancing problems are focused on the minimizing the total processing time or the number of workstations. Independently, some research reports consider the balance issues of the physical workloads on the assembly line. In this paper, we are presenting a new mathematical model to accomplish the line balance considering both the processing time and the workloads at the same time. To this, end, we propose an zero-one integer program problem, and we use the Chebyshev Goal Programming approach as the solution method. Some computational test runs are performed to compare the pay-offs between the processing time and the workloads. And, the test results show us that the reliable balanced work schedules can be obtained through the proposed model.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• pp.409-413
• /
• 2005

The logical analysis of data(LAD) is an effective Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a new optimization-based pattern generation methodology and propose two mathematical programming medels, a mixed 0-1 integer and linear programming(MILP) formulation and a well-studied set covering problem(SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with much ease patterns of high complexity that cannot be generated with the conventional approach.

• 제어로봇시스템학회논문지
• /
• 제4권4호
• /
• pp.534-542
• /
• 1998

In this paper a simulation model for the powertrain control of gasoline engines with automatic transmission is presented. A modular programming approach has been pursued and the MATLAB/SIMULINK has been utilized as the programming environment. The engine/transmission system is analyzed in the object-oriented fashion whereby easy transferal of the modules, which represent physical parts or analysis subsystems, is guaranteed. Some mathematical models are adopted from the literature to compare the simulation results with the model and the experimental results in the literature. It is expected that the whole program or individual module constructed in this paper are useful for the automotive engineers in designing a new engine/transmission system and/or in modifying parts of existing systems.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 C
• /
• pp.1085-1087
• /
• 1998

A distribution systems loss minimum reconfiguration method by simulated annealing is proposed. The problem is a complex mixed integer programming problem and is very difficult to solve by a mathematical programming approach. Simulated annealing generates feasible solutions randomly and moves among these solutions using a strategy leading to a global minimum with high probabilities. The solution algorithm has been implemented in developed software package and tested on 32-bus system.

• 한국국방경영분석학회지
• /
• 제29권2호
• /
• pp.61-80
• /
• 2003

A fire sequencing problem is considered. Fire sequencing problem is a kind of scheduling problem that seeks to minimize the overall time span under a result of weapon­target allocation problem. The assigned weapons should impact a target simultaneously and a weapon cannot transfer the firing against another target before all planned rounds are consumed. The computational complexity of the fire sequencing problem is strongly NP­complete even if the number of weapons is two, so it is difficult to get the optimal solution in a reasonable time by the mathematical programming approach. Therefore, a genetic algorithm is adopted as a solution method, in which the representation of the solution, crossover and mutation strategies are applied on a specific condition. Computational results using randomly generated data are presented. We compared the solutions given by CPLEX and the genetic algorithm. Above $7(weapon){\times}15(target)$ size problems, CPLEX could not solve the problem even if we take enough time to solve the problem since the required memory size increases dramatically as the number of nodes expands. On the other hand, genetic algorithm approach solves all experimental problems very quickly and gives good solution quality.

• 한국철도학회논문집
• /
• 제12권6호
• /
• pp.1018-1023
• /
• 2009

본 연구는 도시철도 시스템에서 동일시간에 동력운전하는 열차수를 최소화하여 전기에너지소모의 최대치를 최소화하고자 한다. 이를 위하여 열차동력운전 분산 열차 시각표 작성에 대한 문제를 정의하였다. 정의된 문제를 혼합정수계획(Mixed Integer Programming)모형으로 정식화하고 문제의 해법으로 상용소프트웨어를 활용한 해법과 휴리스틱 해법 두 가지를 제시하였다. 실제 열차시각표에 적용하여 동시 동력운전 열차수를 25% 감소시켰으며 본 연구결과의 유용성을 확인하였다. 이를 통하여 기존 시각표의 서비스품질을 악화시키지 않는 에너지 효율적 열차시각표를 작성하였다.