• Title/Summary/Keyword: Optimum Algorithm

Search Result 1,621, Processing Time 0.028 seconds

Components sizing of powertrain for a Parallel Hybridization of the Mid-size Low-Floor Buses (중형저상버스 병렬형 하이브리드화를 위한 동력전달계 용량매칭)

  • Kim, Gisu;Park, Yeong-il;Ro, Yun-sik;Jung, Jae-wook
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.8
    • /
    • pp.582-594
    • /
    • 2016
  • Most studies on hybrid buses are on large-sized buses and not mid-sized low-floor buses. This study uses MATLAB simulation to evaluate the fuel efficiency of such buses powered by diesel. Based on the results, a hybrid electric vehicle system is recommended for the best combination of power and gear ratio. A parallel hybrid system was selected for the hybridization, which transmits front and rear wheel power independently. The necessary power to satisfy the target performance was calculated, and the applicable capacity area was designed. Dynamic programing was used to create and optimize a component sizing algorithm, which was used to scale the capacity of each component of the power source to satisfy the design criteria. The fuel efficiency rate, optimum power source capacity, and gear ratio can be improved by converting a conventional bus into a parallel hybrid bus.

Development of Copycat Harmony Search : Adapting Copycat Scheme for the Improvement of Optimization Performance (모방 화음탐색법의 개발 : 흉내내기에 의한 최적화 성능 향상)

  • Jun, Sang Hoon;Choi, Young Hwan;Jung, Donghwi;Kim, Joong Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.9
    • /
    • pp.304-315
    • /
    • 2018
  • Harmony Search (HS) is a recently developed metaheuristic algorithm that is widely known to many researchers. However, due to the increasing complexity of optimization problems, the optimal solution cannot be efficiently found by HS. To overcome this problem, there have been many studies that have improved the performance of HS by modifying the parameter settings and incorporating other metaheuristic algorithms. In this study, Copycat HS (CcHS) is suggested, which improves the parameter setting method and the performance of searching for the optimal solution. To verify the performance of CcHS, the results were compared to those of HS variants with a set of well-known mathematical benchmark problems. The effectiveness of CcHS was proven by finding final solutions that are closer to the global optimum than other algorithms in all problems. To analyze the applicability of CcHS to engineering optimization problems, it was applied to a design problem for Water Distribution Systems (WDS), which is widely applied in previous research. As a result, CcHS proposed the minimum design cost, which was 21.91% cheaper than the cost suggested by simple HS.

A Basic Study on the Differential Diagnostic System of Laryngeal Diseases using Hierarchical Neural Networks (다단계 신경회로망을 이용한 후두질환 감별진단 시스템의 개발)

  • 전계록;김기련;권순복;예수영;이승진;왕수건
    • Journal of Biomedical Engineering Research
    • /
    • v.23 no.3
    • /
    • pp.197-205
    • /
    • 2002
  • The objectives of this Paper is to implement a diagnostic classifier of differential laryngeal diseases from acoustic signals acquired in a noisy room. For this Purpose, the voice signals of the vowel /a/ were collected from Patients in a soundproof chamber and got mixed with noise. Then, the acoustic Parameters were analyzed, and hierarchical neural networks were applied to the data classification. The classifier had a structure of five-step hierarchical neural networks. The first neural network classified the group into normal and benign or malign laryngeal disease cases. The second network classified the group into normal or benign laryngeal disease cases The following network distinguished polyp. nodule. Palsy from the benign laryngeal cases. Glottic cancer cases were discriminated into T1, T2. T3, T4 by the fourth and fifth networks All the neural networks were based on multilayer perceptron model which classified non-linear Patterns effectively and learned by an error back-propagation algorithm. We chose some acoustic Parameters for classification by investigating the distribution of laryngeal diseases and Pilot classification results of those Parameters derived from MDVP. The classifier was tested by using the chosen parameters to find the optimum ones. Then the networks were improved by including such Pre-Processing steps as linear and z-score transformation. Results showed that 90% of T1, 100% of T2-4 were correctly distinguished. On the other hand. 88.23% of vocal Polyps, 100% of normal cases. vocal nodules. and vocal cord Paralysis were classified from the data collected in a noisy room.

Dynamic Block Reassignment for Load Balancing of Block Centric Graph Processing Systems (블록 중심 그래프 처리 시스템의 부하 분산을 위한 동적 블록 재배치 기법)

  • Kim, Yewon;Bae, Minho;Oh, Sangyoon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.5
    • /
    • pp.177-188
    • /
    • 2018
  • The scale of graph data has been increased rapidly because of the growth of mobile Internet applications and the proliferation of social network services. This brings upon the imminent necessity of efficient distributed and parallel graph processing approach since the size of these large-scale graphs are easily over a capacity of a single machine. Currently, there are two popular parallel graph processing approaches, vertex-centric graph processing and block centric processing. While a vertex-centric graph processing approach can easily be applied to the parallel processing system, a block-centric graph processing approach is proposed to compensate the drawbacks of the vertex-centric approach. In these systems, the initial quality of graph partition affects to the overall performance significantly. However, it is a very difficult problem to divide the graph into optimal states at the initial phase. Thus, several dynamic load balancing techniques have been studied that suggest the progressive partitioning during the graph processing time. In this paper, we present a load balancing algorithms for the block-centric graph processing approach where most of dynamic load balancing techniques are focused on vertex-centric systems. Our proposed algorithm focus on an improvement of the graph partition quality by dynamically reassigning blocks in runtime, and suggests block split strategy for escaping local optimum solution.

Optimum Structural Design of Tankers Using Multi-objective Optimization Technique (다목적함수 최적화기법을 이용한 유조선의 최적구조설계)

  • 신상훈;장창두;송하철
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.15 no.4
    • /
    • pp.591-598
    • /
    • 2002
  • In the ship structural design, the material cost of hull weight and the overall cost of construction processes should be minimized considering safety and reliability. In the past, minimum weight design has been mainly focused on reducing material cost and increasing dead weight reflect the interests of a ship's owner. But, in the past experience, the minimum weight design has been inevitably lead to increasing the construction cost. Therefore, it is necessary that the designer of ship structure should consider both structural weight and construction cost. In this point of view, multi-objective optimization technique is proposed to design the ship structure in this study. According to the proposed algorithm, the results of optimization were compared to the structural design of actual VLCC(Very Large Crude Oil Carrier). Objective functions were weight cost and construction cost of VLCC, and ES(Evolution Strategies), one of the stochastic search methods, was used as an optimization solver. For the scantlings of members and the estimations of objectives, classification rule was adopted for the longitudinal members, and the direct calculation method, GSDM(Generalized Slope Deflection Method), lot the transverse members. To choose the most economical design point among the results of Pareto optimal set, RFR(Required Freight Rate) was evaluated for each Pareto point, and compared to actual ship.

Porewater Pressure Predictions on Hillside Slopes for Assessing Landslide Risks (II) Development of Groundwater Flow Model (산사태 위험도 추정을 위한 간극수압 예측에 관한 연구(II) -산사면에서의 지하수위 예측 모델의 개발-)

  • Lee, In-Mo;Park, Gyeong-Ho;Im, Chung-Mo
    • Geotechnical Engineering
    • /
    • v.8 no.2
    • /
    • pp.5-20
    • /
    • 1992
  • The physical-based and lumped-parameter hydrologic groundwater flow model for predicting the rainfall-triggered rise of groundwater levels in hillside slopes is developed in this paper to assess the risk of landslides. The developed model consists of a vertical infiltration model for unsaturated zone linked to a linear storage reservoir model(LSRM) for saturated zone. The groundwater flow model has uncertain constants like soil depttL slope angle, saturated permeability, and potential evapotranspiration and four free model parameters like a, b, c, and K. The free model parameters could be estimated from known input-output records. The BARD algorithm is uses as the parameter estimation technique which is based on a linearization of the proposed model by Gauss -Newton method and Taylor series expansion. The application to examine the capacity of prediction shows that the developed model has a potential of use in forecast systems of predicting landslides and that the optimal estimate of potential 'a' in infiltration model is the most important in the global optimum analysis because small variation of it results in the large change of the objective function, the sum of squares of deviations of the observed and computed groundwater levels. 본 논문에서는 가파른 산사면에서 산사태의 발생을 예측하기 위한 수문학적 인 지하수 흐름 모델을 개발하였다. 이 모델은 물리적인 개념에 기본하였으며, Lumped-parameter를 이용하였다. 개발된 지하수 흐름 모델은 두 모델을 조합하여 구성되어 있으며, 비포화대 흐름을 위해서는 수정된 abcd 모델을, 포화대 흐름에 대해서는 시간 지체 효과를 고려할 수 있는 선형 저수지 모델을 이용하였다. 지하수 흐름 모델은 토층의 두께, 산사면의 경사각, 포화투수계수, 잠재 증발산 량과 같은 불확실한 상수들과 a, b, c, 그리고 K와 같은 자유모델변수들을 가진다. 자유모델변수들은 유입-유출 자료들로부터 평가할 수 있으며, 이를 위해서 본 논문에서는 Gauss-Newton 방법을 이용한 Bard 알고리즘을 사용하였다. 서울 구로구 시흥동 산사태 발생 지역의 산사면에 대하여 개발된 모델을 적용하여 예제 해석을 수행함으로써, 지하수 흐름 모델이 산사태 발생 예측을 위하여 이용할 수 있음을 입증하였다. 또한, 매개변수분석 연구를 통하여, 변수 a값은 작은 변화에 대하여 목적함수값에 큰 변화를 일으키므로 a의 값에 대한 최적값을 구하는 것이 가장 중요한 요소라는 결론을 얻었다.

  • PDF

Optimum Drying Conditions of On-Farm Red Pepper Dryer (고추건조기의 최적운전조건)

  • Lee, Dong-Sun;Keum, Dong-Hyuk;Park, Noh-Hyun;Park, Mu-Hyun
    • Korean Journal of Food Science and Technology
    • /
    • v.21 no.5
    • /
    • pp.676-685
    • /
    • 1989
  • Optimal operating conditions of on-farm red pepper dryer were searched by using the simulation-optimization algorithm combining the drying and quality deterioration models of red pepper with Box's complex method. Determination of control variables such as air temperature, air recycle ratio and air flow rate was based on a criterion of minimizing energy consumption under the constrainst conditions that satisfied the specified color retention of carotenoids. As quality constraint was stricter, energy consumption increased and total drying time decreased with lower recycle ratio and higher air flow rate Product mixing during drying was found to be able to improve the energy efficiency and product quality. Currently used air flow rate was assessed to be increased for the optimal operation. Two stage drying at the fixed optimal air flow rate was proven to be useful means for further saying of energy consumption. In the optimal bistaged drying, the second stage began at about one third of the total drying time and low air temperature in the first stage Increased to a high value and air recycle ratio increased slightly in the second stage. Optimal control variable scheme could be explained by the dryer performance and the carotenoids destruction kinetics in red pepper drying.

  • PDF

Detection Model of Malicious Nodes of Tactical Network for Korean-NCW Environment (한국형 NCW를 위한 전술네트워크에서의 악의적인 노드 검출 모델)

  • Yang, Ho-Kyung;Cha, Hyun-Jong;Shin, Hyo-Young;Ryou, Hwang-Bin;Jo, Yong-Gun
    • Convergence Security Journal
    • /
    • v.11 no.1
    • /
    • pp.71-77
    • /
    • 2011
  • NCW(Network Centric- Warfare) encompasses the concept to use computer data processing and network linkage communications techniques, share information and furthermore, enhance the effectiveness of computer-operating systems. As IT(Information & Technology) have become developed in the recent years, the existing warfare system-centered conventional protocol is not use any longer. Instead, network-based NCW is being widely-available, today. Under this changing computer environment, it becomes important to establish algorithm and build the stable communication systems. Tools to identify malign node factors through Wireless Ad-hoc network cause a tremendous error to analyze and use paths of even benign node factors misreported to prove false without testing or indentifying such factors to an adequate level. These things can become an obstacle in the process of creating the optimum network distribution environment. In this regard, this thesis is designed to test and identify paths of benign node factors and then, present techniques to transmit data through the most significant open short path, with the tool of MP-SAR Protocol, security path search provider, in Ad-hoc NCW environment. Such techniques functions to identify and test unnecessary paths of node factors, and thus, such technique users can give an easy access to benign paths of node factors.

On the Performance Analysis of Blind Equalization for Parial Response Channels (부분응답 채널에 대한 블라인드 등화기의 성능분석)

  • Lee, Sang-Kyung;Lee, Jae-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.4C
    • /
    • pp.413-423
    • /
    • 2003
  • The CMA algorithmis most widely investigated blind algorithm and the most widely used one in practice. But, since nonlinear CM cost function have not closed form solution about the optimum weight. There have been difficultiesto analyze the CMA equalizer's theoretical performance. Recently, Zeng presents the notable theoretical resultabout the MSE of CM-minimizing estimators for the FIR linear channel in the presence of AWGN. Through this method, It wouldbe possible to campare the theoretical performance between CMA and Wiener equalizer in terms of MSE. In this paper, based on Zeng's method, we first calculate the theoretical MSE bound of CMA equalizer in partial response channel which is widely used in HDD, digital VCR such as high-density digital recording.playback systems. We confirmedthis result withthe computer simulation. Except this, we also performedthe theoretical and simulation analysis about the modified CMA equalizer, which was proposed to improve the performance of CMA equalizer in partial response channel. Finally, we compare and evaluate the performance analysis results between CMA and Modified CMA equalizer.

Design of Multilayer Radome with Particle Swarm Optimization (Particle Swarm Optimization을 이용한 다층 구조 레이돔 설계)

  • Lee, Kyung-Won;Hong, Ic-Pyo;Park, Beom-Jun;Chung, Yeong-Chul;Yook, Jong-Gwan
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.21 no.7
    • /
    • pp.744-751
    • /
    • 2010
  • In this paper, the design of multilayer radome within, the insertion loss, -0.3 dB in X-band with PSO was carried out based on two cases. The first is that, deciding material constant of skin and core, each layer thickness of c-sandwich radome with PSO is found and the second is that, deciding material constant and thickness of the skins of both sides, the material constant and thickness of three layers between skins of both sides using PSO is decided. The performance of the designed radome almost agreed with the required performance. It was showed that the radome design applying PSO algorithm is easy and fast and the optimum radome is also designed in combination of the various parameters of radome. From these results, the radome having various performance can be designed except the tedious calculation and also be applied to various radome structure.