• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.10
• /
• pp.562-574
• /
• 2004

We address the problem of energy-optimal voltage scheduling for fixed-priority hard real-time systems. First, we prove that the problem is NP-hard. Then, we present a fully polynomial time approximation scheme (FPTAS) for the problem. for any $\varepsilon$>0, the proposed approximation scheme computes a voltage schedule whose energy consumption is at most (1+$\varepsilon$) times that of the optimal voltage schedule. Furthermore, the running time of the proposed approximation scheme is bounded by a polynomial function of the number of input jobs and 1/$\varepsilon$. Experimental results show that the approximation scheme finds more efficient voltage schedules faster than the best existing heuristic.

• Journal of the Korean Society for Railway
• /
• v.14 no.3
• /
• pp.276-284
• /
• 2011

In our study, we present a new LOGIT-based traffic assignment model applicable to intercity railway network. Most traffic assignment models have been developed for public transit assignment in urban area, so that they are known to produce unrealistic results in intercity railway demand analysis. Especially, since the introduction of KTX, more passengers are using a route including KTX service and the schedule becomes more compatible with transfer. Our study presents a new LOGIT-based traffic assignment model considering passenger transfer. To do so, we suggest a new route search algorithm to find K paths with non increasing order in the utility value.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.11a
• /
• pp.475-478
• /
• 2005

본 논문에서는 자기구성 퍼지다항식 뉴럴 네트워크(SOFPNN)를 구성하고 있는 퍼지 다항식뉴론(FPM)의 구조와 파라미터를 유전자 알고리즘을 이용하여 최적화시킨 새로운 개념의 진화론적 최적 고급 자기구성 퍼지 다항식 뉴릴 네트워크를 소개한다. 기존의 자기구성 퍼지 다항식 뉴럴 네트워크에서 모델을 설계할 때에는 설계자의 주관적인 특징과 시행착오에 의해서 모델을 구축하였다. 이러한 설계자의 경험을 배제하고 객관적이고 효율적인 모델을 구축하기 위해서 본 논문에서는 FPH의 파라미터들을 최적화 알고리즘인 유전자 알고리즘을 이용하여 동조하였다. 즉, 모델을 구축하는데 기본이 되는 FPN의 각각의 파라미터들-입력변수의 수, 다항식 차수, 입력변수, 멤버쉽 함수의 수, 그리고 멤버쉽 함수의 정점-을 동조함으로써 기존의 모델에 비해서 구조적으로 그리고 파라미터적으로 최적화된 네트워크를 생성할 수 있다. 뿐만 아니라 주어진 데이터의 특성을 모델 구축에 반영하고자 멤버쉽 함수의 정점 역시 유전자 알고리즘으로 동조하였다. 실험적 예제를 통하여 제안된 모델의 성능을 확인한 결과 기존의 퍼지모델 및 신경망 모델에 비해서 아주 우수한 근사화 능력과 일반화 능력을 가짐을 알 수 있다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.257-266
• /
• 2015

There is no polynomial-time algorithm that can be obtain the optimal solution for economic load dispatch problem with non-convex fuel cost functions. Therefore, electrical field uses quadratic fuel cost function unavoidably. This paper proposes a valve-point optimization (VPO) algorithm for economic load dispatch problem with non-convex fuel cost functions. This algorithm sets the initial values to maximum powers $P_i{\leftarrow}P_i^{max}$ for each generator. It then reduces the generation power of generator i with an average power cost of $_{max}\bar{c}_i$ to a valve point power $P_{ik}$. The proposed algorithm has been found to perform better than the extant heuristic methods when applied to 13 and 40-generator benchmark data. This paper consequently proves that the optimal solution to economic load dispatch problem with non-convex fuel cost functions converges to the valve-point power of each generator.

• Journal of the Korean Society for Geothermal and Hydrothermal Energy
• /
• v.13 no.2
• /
• pp.9-15
• /
• 2017

When applying geothermal systems in cities such as seoul where high density development prevails, the selection of geothermal system capable of obtaining a large capacity in the limited grounds is necessary. In this study, an easy-to-use design tool is developed in the form of spreadsheet by applying the calculation theory of existing closed-loop vertical ground heat exchanger that can be used in the early design stage of the open-loop ground heat exchanger. By only using the maximum cooling and heating load, it is possible to calculate optimal design open-loop ground heat exchanger. Further research is needed, we are plan to improve the program considering the heat loss of groundwater flowing in the inner casing, G-Function for Open-Loop, and verification by applying actual projects.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.161-168
• /
• 2014

The optimal solution of minimum cost for aircraft landing problem(ALP) is very difficult problem because the approached aircraft are random time interval. Therefore this problem has been applied by various meta heuristic methods. This paper suggests O(nlog n) polynomial time heuristic algorithm to obtain the optimal solution for ALP. This algorithm sorts the target time of aircraft into ascending order. Then we apply the optimization of change the landing sequence take account of separation time and the cost of landing. For the Airland1 through Airland8 of benchmark data of ALP, we choose 25 data until the number of runway m that the total landing cost is 0. We can be obtain the optimal solution for all of the 25 data. Especially we can be improve the known optimal solution for m = 1of Airland8.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.2
• /
• pp.337-351
• /
• 2016

There exist many real situations that statistical decision problems are classified into more than two categories. In these cases, the concordance statistics by the pair approach are mostly used. However, the expression of the classification of categories are ambiguous. Recently, the standardized evaluation data and re-expressed concordance statistics are defined and could be explained their meanings. They have still some non-specific problems for standard criteria of the statistics. Since these can be considered between result and truth categories additionally, two alternative concordance statistics might be proposed in this paper. Some advantages are founded that the proposed statistics could be discriminated all possible cases for two randomly selected categories. Moreover since the proposed statistics are represented with indicator functions, these could be transformed non-parametrically, so that these concordances are used for hypothesis testing.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.145-153
• /
• 2008

Existing shortest-path algorithms mainly consider a single attribute. But traveler actually chooses a route considering not single attribute but various attributes which are synthesized travel time, route length, personal preference, etc. Therefore, to search the optimal path, these attributes are considered synthetically. In this study route searching algorithm which selects the maximum utility route using discrete choice model has developed in order to consider various attributes. Six elements which affect route choice are chosen for the route choice model and parameters of the models are estimated using survey data. A multinomial logit models are developed to design the function of route choice model. As a result, the model which has route length, delay time, the number of turning as parameter is selected based on the significance test. We use existing shortest path algorithm, which can reflect urban transportation network such as u-turn or p-turn, and apply it to the real network.

• Journal of the Korean Geotechnical Society
• /
• v.33 no.12
• /
• pp.59-73
• /
• 2017

Numerical analysis using 3D finite element program (PLAXIS 3D) evaluated the interaction of soil - pile structure under dynamic surface loading. The dynamic p-y curve of the 1-g shaking table experiment by numerical analysis was calculated, and the parametric studies were presented by considering the pile-soil condition, the pile tip condition, and the loading condition. The frequency of 1.4 Hz is almost equal to the natural frequency of the pile - soil system. The p and y values of resonance phenomenon are significantly different from the results of other frequencies. The results can be summarized by a third order polynomial function representing the trend line in the p-y curve. In the case of a single pile, the shape of the dominant curve was found to be an ellipse by mathematical proof. The elliptic equation can be used for the dynamic design or analysis of soil-pile system.

• Proceedings of the Korea Database Society Conference
• /
• 1999.06a
• /
• pp.195-202
• /
• 1999

본 논문은 배전 계통에서 부하 제약조건과 운전 제약조건을 고려한 손실 감소와 부하 평형에 대해 시뮬레이티드 어닐링 알고리즘을 적용한 재구성 방법을 서술하였다. 네트워크 재구성은 수많은 연계 개폐기와 구분 개폐기의 조합에 의해 이루어지기 때문에 조합적인 최적화 문제이다. 이러한 문제는 수많은 조합에 제약조건까지 있어 해를 구하기가 쉽지 않을 뿐 아니라 국소 해에 빠질 가능성이 많다. 따라서 신경망 중에서 제약조건에 따라 신경망 구조에 영향을 미치지 않으면서 전역 최소해에 수렴하는 특성을 가진 시뮬레이티드 어닐링 기법을 이용하여 배전 계통의 선로를 재구성하였다. 시뮬레이티드 어닐링은 이론적으로 최적해가 보장되지만 무한대의 시간이 걸리기 때문에 현실적으로 적용할 때 해 공간을 탐색하는 규칙과 온도를 적절히 내리는 냉각 스케줄(cooling schedule)이 중요하다. 본 논문에서는 알고리즘 상에서 제약조건 위반 여부를 점검할 수 있는 제약조건과 페널티 상수(penalty factor)를 통해 목적함수에 반영하는 제약조건으로 나누어 모든 후보해를 가능해가 되게 하였고 기존에 사용되던 Kirkpatrick의 냉각 스케줄 대신에 후보해의 통계적 처리에 의해 온도를 내리는 다항-시간 냉각 스케줄(polynomial-time cooling schedule)을 사용하여 수행시간을 단축하고 수렴성을 높였다. 제안한 알고리즘의 효용성을 입증하기 위해 32, 69모선 예제 계통으로 테스트하였다.