• Title/Summary/Keyword: optimization problems

Search Result 2,423, Processing Time 0.029 seconds

A Study on Developing an Optimization Model for Particleboard Manufacturing Processes (파티클보드 제조공정(製造工程)의 최적화(最適化) 모델개발에 관한 연구(硏究))

  • Chung, Joo Sang;Park, Hee Jun;Lee, Phil Woo
    • Journal of Korean Society of Forest Science
    • /
    • v.82 no.4
    • /
    • pp.396-405
    • /
    • 1993
  • In this paper, a nonlinear programming model to determine the optimal operating policy to minimize production costs for particleboard plants is presented. The model provides optimal values for three decision variables : specific gravity of particleboard, mat moisture content and mat resin content. These decision variables are key factors influencing the cost and quality of particleboard manufacturing processes. In formulating the nonlinear programming model, the minimum quality standards for internal bond strength and modulus of rupture of particleboard are used as industry-wide quality constraints. These quality standards are expressed as nonlinear functions of the decision variables. In order to demonstrate the applicability of the proposed model, the model is applied to solve for optimal solutions of four theoretical problems. The problem scenarios are built to investigate effects of changes in hot-pressing speed and purchase price of chip and resin.

  • PDF

Analysis of the Levy Mutation Operations in the Evolutionary prograamming using Mean Square Displacement and distinctness (평균변화율 및 유일성을 통한 진화 프로그래밍에서 레비 돌연변이 연산 분석)

  • Lee, Chang-Yong
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.11
    • /
    • pp.833-841
    • /
    • 2001
  • Abstract In this work, we analyze the Levy mutation operations based on the Levy probability distribution in the evolutionary programming via the mean square displacement and the distinctness. The Levy probability distribution is characterized by an infinite second moment and has been widely studied in conjunction with the fractals. The Levy mutation operators not only generate small varied offspring, but are more likely to generate large varied offspring than the conventional mutation operators. Based on this fact, we prove mathematically, via the mean square displacement and the distinctness, that the Levy mutation operations can explore and exploit a search space more effectively. As a result, one can get better performance with the Levy mutation than the conventional Gaussian mutation for the multi-valued functional optimization problems.

  • PDF

PAPR Reduction in Limited Feedback MIMO Beeamforming OFDM Systems (제한된 되먹임의 송신 빔성형 MIMO OFDM 시스템에서 PAPR 감소 기법)

  • Shin, Joon-Woo;Jeong, Eui-Rim;Lee, Yong-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8C
    • /
    • pp.758-766
    • /
    • 2007
  • High peak-to-average power ratio(PAPR) is one of serious problems in the orthogonal frequency division multiplexing(OFDM) systems. This paper proposes a PAPR reduction technique for limited feedback multiple input multiple output(MIMO) OFDM systems. The proposed method is based on the null space of the MIMO channel where a dummy signal is made in the channel's null space and then, subtracted from the original signal to reduce the PAPR. First, we show that a problem occurs when the existing method is directly applied to limited feedback MIMO case. Then, a weight function for the dummy signal is proposed to mitigate the degradation of the receiver performance while still reducing PAPR significantly. The weight function is derived from a constrained nonlinear optimization problem to minimize the mean square error between the received signal and its ideal signal. Simulation results shows that the proposed technique provides about 2.5dB PAPR reduction with 0.2dB bit-error probability loss.

Graph Construction Based on Fast Low-Rank Representation in Graph-Based Semi-Supervised Learning (그래프 기반 준지도 학습에서 빠른 낮은 계수 표현 기반 그래프 구축)

  • Oh, Byonghwa;Yang, Jihoon
    • Journal of KIISE
    • /
    • v.45 no.1
    • /
    • pp.15-21
    • /
    • 2018
  • Low-Rank Representation (LRR) based methods are widely used in many practical applications, such as face clustering and object detection, because they can guarantee high prediction accuracy when used to constructing graphs in graph - based semi-supervised learning. However, in order to solve the LRR problem, it is necessary to perform singular value decomposition on the square matrix of the number of data points for each iteration of the algorithm; hence the calculation is inefficient. To solve this problem, we propose an improved and faster LRR method based on the recently published Fast LRR (FaLRR) and suggests ways to introduce and optimize additional constraints on the underlying optimization goals in order to address the fact that the FaLRR is fast but actually poor in classification problems. Our experiments confirm that the proposed method finds a better solution than LRR does. We also propose Fast MLRR (FaMLRR), which shows better results when the goal of minimizing is added.

Intelligent Digital Redesign for Uncertain Nonlinear Systems Using Power Series (Powrer Series를 이용한 불확실성을 갖는 비선형 시스템의 지능형 디지털 재설계)

  • Sung Hwa Chang;Park Jin Bae;Go Sung Hyun;Joo Young Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.7
    • /
    • pp.881-886
    • /
    • 2005
  • This paper presents intelligent digital redesign method of global approach for hybrid state space fuzzy-model-based controllers. For effectiveness and stabilization of continuous-time uncertain nonlinear systems under discrete-time controller, Takagi-Sugeno(TS) fuzzy model is used to represent tile complex system. And global approach design problems viewed as a convex optimization problem that we minimize the error of the norm bounds between nonlinearly interpolated linear operators to be matched. Also, by using the power series, we analyzed nonlinear system's uncertain parts more precisely. When a sampling period is sufficiently small, the conversion of a continuous-time structured uncertain nonlinear system to an equivalent discrete-time system have proper reason. Sufficiently conditions for the global state-matching of tile digitally controlled system are formulated in terms of linear matrix inequalities (LMIs). Finally, a TS fuzzy model for the chaotic Lorentz system is used as an example to guarantee the stability and effectiveness of the proposed method.

A Study on the Convergence of the Evolution Strategies based on Learning (학습에의한 진화전략의 수렴성에 관한연구)

  • 심귀보
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.9 no.6
    • /
    • pp.650-656
    • /
    • 1999
  • In this paper, we study on the convergence of the evolution strategies by introducing the Lamarckian evolution and the Baldwin effect, and propose a random local searching and a reinforcement local searching methods. In the random local searching method some neighbors generated randomly from each individual are med without any other information, but in the reinforcement local searching method the previous results of the local search are reflected on the current local search. From the viewpoint of the purpose of the local search it is suitable that we try all the neighbors of the best individual and then search the neighbors of the best one of them repeatedly. Since the reinforcement local searching method based on the Lamarckian evolution and Baldwin effect does not search neighbors randomly, but searches the neighbors in the direction of the better fitness, it has advantages of fast convergence and an improvement on the global searching capability. In other words the performance of the evolution strategies is improved by introducing the learning, reinforcement local search, into the evolution. We study on the learning effect on evolution strategies by applying the proposed method to various function optimization problems.

  • PDF

An Analysis of the Effects of Walking Guidance System in Subway Stations using Genetic Algorithm (유전 알고리즘을 이용한 지하철 역사 동선 분리 시스템의 효과 분석)

  • Kim, Jin-Ho;Lee, Joo-Yong;Kim, Tae-Wan
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.35 no.3
    • /
    • pp.617-624
    • /
    • 2015
  • The conflict of opposing pedestrian traffic-flow in a subway station(made up of stair, passageway, and escalator) diminishes the convenience and mobility of its users. In addition, the station's efficiency would be negatively affected by the growth of delay and queue length in pedestrian facilities. As these phenomena have been resulted by the overlapping in pedestrian's traffic-line, the separation of it would alleviate these problems. For the criteria and methodology of separation, this paper has investigated the bi-directional queue length and delay on the entrance of each facility (stair, passageway and escalator). Since the pedestrian flow exists bidirectionally, we have used the weighted average by inflow rate for the delay value. For the optimization of the separation, the Genetic Algorithm has been utilized in order to minimize the delay.

GE 7FA+e DLN-2.6 Gas Turbine Combustor : Part Ⅰ Operating Condition Optimization (GE 7FA+e DLN-2.6 가스터빈 연소기 연구 : Part Ⅰ 운전조건 최적화)

  • Oh, Jeong-Seog;Kim, Min-Ki;Heo, Pil-Won;Lee, Jang-Soo;Yoon, Young-Bin
    • Journal of the Korean Society of Propulsion Engineers
    • /
    • v.12 no.5
    • /
    • pp.43-50
    • /
    • 2008
  • DLN-2.6 combustion tuning was carried out for the maintenance of GE 7FA+e gas turbine at Seo-Incheon combined cycle power plant. DLN-2.6 combustion system has the higher level of yellow plume and combustion vibration problem in the initial operating mode than that of the base mode($100{\sim}160MW$). The objectives of this study are to investigate the causes of yellow plume and combustion vibration problems at the starting mode and to suggest the best operating condition for the reliable working of the real combustors. By the analysis of tuning data, we could conclude that a yellow plume is caused by the rich mixture(${\phi}{\sim}1$) in a PM 1 nozzle at mode 3($20{\sim}30MW$). In addition, the combustion vibration($120{\sim}140Hz$) might be related to the cold flow characteristics of PM 3 nozzles at mode 6B($40{\sim}45MW$).

Accuracy of Ventricular Volume and Ejection Fraction Measured by Gated Tl-201 Perfusion Single Photon Emission Tomography (심전도 게이트 심근관류 Tl-201 SPECT로 측정된 좌심실 기능 및 좌심실 용적의 정확성)

  • Pai, Moon-Sun;Moon, Dae-Hyuk
    • The Korean Journal of Nuclear Medicine
    • /
    • v.39 no.2
    • /
    • pp.94-99
    • /
    • 2005
  • Electrocardiogram-gated single photon omission computed tomography (SPECT) provides valuable information in the assessment of both myocardial perfusion and ventricular function. Tl-201 is a suboptimal isotope for gating. Tl-201 images are more blurred compared with Tc-99m tracers due to the increased amount of scattered photons and use of a smooth filter. The average myocardial count densities are approximately one-half those of conventional technetium tracers. However, Tl-201 is still widely used because of its well-established utility for assessing myocardial perfusion, viability and risk stratification. Gated SPECT with Tl-201 enables us to assess both post-stress and rest left ventricular volume and function. Previous studies with gated Tl-201 SPECT measurements of ejection fraction (EF), end-diastolic volume (EDV), end-systolic volume (ESV) have shown high correlation with first-pass radionuclide angiography, gated blood pool scan, Tc-99m-MIBI gated SPECT, contrast ventriculography, echocardiography, and 3-dimensional magnetic resonance imaging. However, problems related to these studies include few agreement data of EDV and ESV, use of a reference method that is likely to have the same systemic errors (gated Tc-99m-MIBI SPECT), and other technical factors related to the count density of gated SPECT. With optimization of gated imaging protocols and more validation studies, gated Tl-201 SPECT would be an accurate method to provide perfusion and function information in patients with coronary artery disease.

A Digital Elevation Analysis : Sparially Distributed Flow Apportioning Algorithm (수치 고도 분석 : 분포형 흐름 분배 알고리즘)

  • Kim, Sang-Hyeon;Kim, Gyeong-Hyeon;Jeong, Seon-Hui
    • Journal of Korea Water Resources Association
    • /
    • v.34 no.3
    • /
    • pp.241-251
    • /
    • 2001
  • A flow determination algorithm is proposed for the distributed hydrologic model. The advantages of a single flow direction scheme and multiple flow direction schemes are selectively considered to address the drawbacks of existing algorithms. A spatially varied flow apportioning factor is introduced in order to accommodate the accumulated area from upslope cells. The channel initiation threshold area(CIT) concept is expanded and integrated into the spatially distributed flow apportioning algorithm in order to delineate a realistic channel network. An application of a field example suggests that the linearly distributed flow apportioning scheme provides some advantages over existing approaches, such as the relaxation of over-dissipation problems near channel cells, the connectivity feature of river cells, the continuity of saturated areas and the negligence of the optimization of few parameters in existing algorithms. The effects of grid sizes are explored spatially as well as statistically.

  • PDF