• Journal of the Korea Society of Computer and Information
• /
• v.27 no.9
• /
• pp.69-76
• /
• 2022

The traveling salesman problem(TSP) is one of the most famous combinatorial optimization problem. So far, many metaheuristic search algorithms have been proposed to solve the problem, and one of them is local search. One of the very important factors in local search is neighbor generation method, and random-based neighbor generation methods such as inversion have been mainly used. This paper proposes 4 new greedy-based neighbor generation methods. Three of them are based on greedy insertion heuristic which insert selected cities one by one into the current best position. The other one is based on greedy rotation. The proposed methods are applied to first-choice hill-climbing search and simulated annealing which are representative local search algorithms. Through the experiment, we confirmed that the proposed greedy-based methods outperform the existing random-based methods. In addition, we confirmed that some greedy-based methods are superior to the existing local search methods.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.9-15
• /
• 2009

Ant Colony System is new meta heuristic for hard combinatorial optimization problem. The original ant colony system accomplishes a pheromone updating about only the global optimal path using global updating rule. But, If the global optimal path is not searched until the end condition is satisfied, only pheromone evaporation happens to no matter how a lot of iteration accomplishment. In this paper, the length of the global optimal path does not improved within the limited iterations, we evaluates this state that fall into the local optimum and selects the next node using changed parameters in the state transition rule. This method has effectiveness of the search for a path through diversifications is enhanced by decreasing the value of parameter of the state transition rules for the select of next node, and escape from the local optima is possible. Finally, the performance of Best and Average_Best of proposed algorithm outperforms original ACS.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2020.06a
• /
• pp.314-314
• /
• 2020

SWAT (Soil and Water Assessment Tool)은 미국 농무성 농업연구소에서 개발된 준분포형(semi-distributed) 수문 모형으로 복합토지이용유역에서 장기간에 걸친 다양한 종류의 토양, 토지이용 및 토지관리 상태의 변화에 따른 유역의 유출량, 유사량 및 영양물질의 영향을 예측하기 위해 개발되었다. SWAT은 기본적으로 다양한 매개변수에 대한 수동 보정 기능을 제공하고 있지만 매개변수 보정에 따른 모의결과의 불확실성을 수반하게 된다. 이러한 문제를 해결하기 위해 자동보정 기능을 제공하는 SWAT-CUP (Calibration and Uncertainty Program)이 개발되었다. SWAT-CUP에서 제공하는 매개변수의 최적화 과정에서 유사한 모의 결과를 산출하는 수천 개의 매개변수조합이 존재하기 때문에 보정기법의 선택에 따라 최종 매개변수의 값이 달라질 수 있다. 불확실성을 발생시키는 요인으로 (1) 매개변수의 선택, (2) 보정 기법, (3) 목적함수, (4) 매개변수의 초기 범위, (5) 모의(simulation)의 실행(run) 및 반복(iteration) 횟수, (6) 위치, 개수 등 보정 자료의 선택 등이 주로 지목된다. 이러한 요인으로 발생하는 불확실성은 SWAT 모형의 구조 및 입력 자료에서 기인하는 것으로, 사용자의 설정에 따라 크게 좌우된다. 본 연구에서는 SWAT 매개변수 보정 과정에서 발생할 수 있는 불확실성을 평가하고, 효율적인 보정 방안을 제시하기 위해 수행되었다. 낙동강 권역의 내성천 유역을 대상으로 SWAT 모형을 구축하였으며, 내성천 본류에 위치한 수위(유량) 관측소의 자료를 활용하여 검·보정을 수행하였다. 모의 결과는 유량의 크기 뿐 아니라 유량의 발생 시기, 유역의 반응 및 증가·감소 경향성을 함께 고려하여 평가하였다. 그 결과 모형 구조에 따른 불확실성의 전이과정을 정확하게 파악하는 것은 불가능하지만 SWAT 모형의 비고유성(non-uniqueness)에 의한 불확실성을 정량화하여 나타내었다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.6A
• /
• pp.1023-1032
• /
• 2006

In this paper, a new method for the bridge maintenance is proposed to overcome the limit of the existing methods and to implement the preventive bridge maintenance system. The proposed method can establish the lifetime optimum maintenance strategy of the deteriorating bridges considering the life-cycle performance as well as the life-cycle cost. The lifetime performance of the deteriorating bridges is evaluated by the safety index based on the structural reliability and the condition index detailing the condition state. The life-cycle cost is estimated by considering not only the direct maintenance cost but also the user and failure cost. The genetic algorithm is applied to generate a set of maintenance scenarios which is the multi-objective combinatorial optimization problem related to the life-cycle cost and performance. The study examined the proposed method by establishing a maintenance strategy for the existing bridge and its advantages. The result shows that the proposed method can be effectively applied to deciding the bridge maintenance strategy.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2022.05a
• /
• pp.215-215
• /
• 2022

현재 국내 정수시설은 정수공정별 감시제어-데이터수집시스템(SCADA: Supervisory Control And Data Acquisition)에 기반하여 감시제어 및 모니터링 위주로 운영·관리를 실시하고 있다. 또한, 주요 핵심 공정인 응집제 약품투입, 소독 및 여과 설비 공정의 운영방식에 있어서 선험적 운영지식에 의한 방식으로 운영되고 있기 때문에 지속적인 안정적 운영을 위해서는 표준적이고 체계적인 운영관리 수단이 필요하다. 국외에서는 다양한 운영 조건에 기반한 정수처리 효율을 예측할 수 있는 모의(simulation) 도구의 개발을 통해 기존 운영되고 있는 정수장의 효율을 예측하는 데 활용하고 있는 실정이다. 본 논문은 실시간 운영관리가 가능한 기반을 구축하여 정수처리의 효율을 예측할 수 있는 시뮬레이터 개발을 통해 정수처리 공정별 기본 및 조합의 공정 시뮬레이션 모의 모듈 기술을 개발하기 위한 연구를 수행하였다. 또한 개발된 기술의 실증 운영을 통해 검증된 모듈을 반영한 정수장 시뮬레이터 시스템을 개발을 위한 연구를 수행하였다. 정수장 시뮬레이터는 수질정보, 물질수지, 수두손실등의 운영현황 데이터를 수집하는 기능, 착수-혼화-응집-침전-여과-소독 등 개별 공정별 주요 운전변수의 모니터링 및 제어를 통한 운영관리 기능, 원수 수질변화에 신속한 대응을 위한 정수처리 공정제어 의사결정지원 기능, 그리고 온라인 관망해석을 포함한 정수처리 전(단위)공정 시뮬레이터 기능 및 공정별 운영인자 최적화 기능 등으로 구성되어 있다. 현재 운영 중인 정수장의 공정별 운전 상태를 평가·관리하여 정수공정 운영 안정화 체계를 확보하고, 정수장의 유량과 수질의 갑작스런 변화에 따른 모의를 통한 수질예측으로 실시간 정수장 최적운영관리가 가능하다. 또한 원수 성상에 따른 적정 공정운영 자동화로 운영비 절감 및 효율적 인력 활용으로 정수장 운영 효율성을 제고함으로써 지속적이고 안정적인 정수장 운영 체계를 확보할 수 있다.

• Journal of Advanced Navigation Technology
• /
• v.27 no.5
• /
• pp.540-545
• /
• 2023

AESA radar is able to instantaneously and adaptively position and control the beam, and this enables to have interleaved mode in modern airborne AESA radar which can maximize situational awareness capability. Interleaved mode provides two or more modes simultaneously, such as Air to Air mode and Sea Surface mode by time sharing technique. In this interleaved mode, performance degradation is inevitable, compared with single mode operation, and effective resource allocation is the key component for the success of interleaved mode. In this paper, we identified performance evaluation items for each mode to analyze interleaved mode performance and proposed effective resource allocation methodology to achieve graceful performance degradation of each mode, focusing on detection range. We also proposed beam scheduling techniques for interleaved mode.

• Journal of Advanced Technology Convergence
• /
• v.2 no.4
• /
• pp.43-48
• /
• 2023

Globally, there is a collaborative effort to achieve global carbon neutrality in response to climate change. In the case of South Korea, greenhouse gas emissions are rapidly increasing, presenting an urgent situation that requires resolution. In this context, this study developed a thermal energy collection device named a 'steam trap' and created an AI model capable of predicting future electricity usage by collecting energy usage data through steam traps. The average accuracy of electricity usage prediction with this AI model was 96.7%, demonstrating high precision. Consequently, the AI model enables the prediction and management of days with high electricity consumption and identifies which facilities contribute to elevated power usage. Future research aims to optimize energy consumption efficiency through efficient equipment operation using anomaly detection in steam traps and standardizing energy management systems, with the ultimate goal of reducing greenhouse gas emissions.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.4
• /
• pp.1-8
• /
• 2024

The traveling salesman problem(TSP) is one of the well known combinatorial optimization problems. Local search has been used as a method to solve TSP. Greedy Random Insertion(GRI) is known as an effective neighbor generation method for local search. GRI selects some cities from the current solution randomly and inserts them one by one into the best position of the current partial solution considering only one city at a time. We first propose another greedy neighbor generation method which is named Full Greedy Insertion(FGI). FGI determines insertion location one by one like GRI, but considers all remaining cities at once. And then we propose a method to combine GRI with FGI, in which GRI or FGI is randomly selected and executed at each iteration in simulated annealing. According to the experimental results, FGI alone does not necessarily perform very well. However, we confirmed that the combined method outperforms the existing local search methods including GRI.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.11 no.4
• /
• pp.109-120
• /
• 2007

In this study, a bridge maintenance system is developed to generate performance-based optimum maintenance strategy by considering the life-cycle cost. A multi-objective combinatorial optimization problem is formulated to generate a tradeoff maintenance scenarios which satisfies the balance among the conflicting objectives such as the performance and cost during the bridge lifetime and a genetic algorithm is applied to the system. By using the developed program, this study proposes a process of optimum maintenance scenario applying to the steel girder bridge of national road. The developed system improves the current methods of establishing the bridge maintenance strategy and can be utilized as an efficient tool to provide the optimum bridge maintenance scenario corresponding to the various constraints and requirements of bridge agency.

• KSBB Journal
• /
• v.14 no.5
• /
• pp.593-599
• /
• 1999

In this study, optimal conditions to infect CD34 positive cells containing hematopoietic stem cells obtained from cord blood and bone marrow were found using two different retroviral vectors expressing human growth hormone (hGH) and $\beta$-galactosidase. CD34 positive cells were successfully infected with recombinant retroviruses only when the CD34 positive cells were co-cultured with packaging cells secreting recombinant retroviruses. To find the highest infection efficiency for the gene transfer, CD34 positive cells from cord blood were co-cultured with packaging cells secreting recombinant retroviruses encoding E. coli lacZ gene. The highest infection efficiency was obtained when CD34 positive cells were cultured for 3 days, and then co-culturing was done for another 2 days. When CD34 positive cells from bone marrow were co-cultured with packaging cells secreting recombinant retroviruses encoding hGH gene, the maximum amount of hGH was also secreted at the same conditions found above, i.e. 3 days of culture and 2 days of co-culture. These results show that there are optimal conditions for the gene transfer into hematopoietic stem cells regardless of sources of target cells or retroviral vectors used to infect.