• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.478-478
• /
• 2021

전 세계적으로 많은 나라들이 기후변화에 적응하기 위해 수자원 관리 전략을 마련하고 있으며, 수자원의 근간이 되는 빗물의 효율적 사용을 위해 우리나라에서도 빗물이용시설이 많이 도입되고 있다. 본 연구에서는 사용자 편의 환경(graphical user interface; GUI)을 갖춘 빗물이용시설의 용량 결정 프로그램(capacity design aid for rainwater harvesting; CARAH)을 개발하여 관련 연구와 업무에 활용성을 높이고자 하였다. CARAH는 저수지 질량 보존식과 python의 pyswarm package에 탑재된 메타 휴리스틱 방법 중 하나인 입자 군집 최적화(particle swarm optimization; PSO) 기법을 연계하여 빗물이용시설의 최적 용량을 짧은 시간에 결정될 수 있도록 개발되었다. 그리고, C#의 Windows Forms Application을 이용하여 사용자 편의 환경을 구현하였다. CARAH의 입력 자료는 모의 기간, 유입량, 목표공급량, 공급보장률이고, 출력 자료는 공급보장률-저류조용량, 목표공급량-실공급량-미달성량, 저류용량-유입량-실공급량이다. 빗물이용시설 계획에 필요한 여러 입력 자료를 쉽게 입력할 수 있도록 구현하였고, 그래프와 표의 형태로 계산된 결과를 화면에 직접 표출함으로써 사용자가 직관적으로 확인할 수 있도록 하였다. 한편, 입·출력 자료를 포함한 분석 결과는 파일로 관리할 수 있도록 기능을 갖추어 수정 및 보완 등의 반복적 활용이 가능하도록 하였다. 개발된 프로그램의 활용성을 검토하기 위해 실제 저류지가 설계된 인천의 청라지구 1공구를 대상으로 적용하였고, 분석 결과의 적절성을 확인하였다. 본 연구에서 개발된 CARAH는 빗물이용시설의 용량 결정에 관한 효율을 높일 수 있는 프로그램이고, 누구나 쉽고 간편하게 사용할 수 있는 프로그램으로서 향후 활용성이 높을 것으로 판단된다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.2
• /
• pp.8-18
• /
• 2020

An Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was developed to enhance the performance of a Harmony Search (HS). EBHS-CGS added two methods to improve the performance of HS. The first method is an improvement of bandwidth (bw) that enhances the local search. This method replaces the existing bw with an exponential bw and reduces the bw value as the iteration proceeds. This form of bw allows for an accurate local search, which enables the algorithm to obtain more accurate values. The second method is to reduce the search range for an efficient global search. This method reduces the search space by considering the best decision variable in Harmony Memory (HM). This process is carried out separately from the global search of the HS by the new parameter, Centralized Global Search Rate (CGSR). The reduced search space enables an effective global search, which improves the performance of the algorithm. The proposed algorithm was applied to a representative optimization problem (math and engineering), and the results of the application were compared with the HS and better Improved Harmony Search (IHS).

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.5
• /
• pp.294-302
• /
• 2020

In a genetic algorithm, computer simulations are performed based on the natural evolution process of life, such as selection, crossover, and mutation. The genetic algorithm searches the approximate optimal solution by the parallel arrangement of Schema, which has a short definition length, low order, and high adaptability. This study examined the possibility of improving the efficiency of the optimal solution by considering the characteristics of the building block hypothesis, which are one of the key operating principles of a genetic algorithm. This study evaluated the efficiency of the optimization results according to the gene sequence for the implementation in solving problems. The optimal design problem of the water pipe was selected, and the genetic arrangement order reflected the engineering specificity by dividing into the existing, the network topology-based, and the flowrate-based arrangement. The optimization results with a flowrate-based arrangement were, on average, approximately 2-3% better than the other batches. This means that to increase the efficiency of the actual engineering optimization problem, a methodology that utilizes clear prior knowledge (such as hydraulic properties) to prevent such excellent solution characteristics from disappearing is essential. The proposed method will be considered as a tool to improve the efficiency of large-scale water supply network optimization in the future.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.1
• /
• pp.121-135
• /
• 2013

This paper propose an efficient algorithm for selecting electric bus charging facility location. In nature, the optimal charging facility location problem is similar to Set Covering Problem. Set Covering Problem is the problem of covering all the rows of an $m{\times}n$ matrix of ones and zeros by a subset of columns with a minimal cost. It has many practical applications of modeling of real world problems. The Set Covering Problem has been proven to be NP-Complete. In order to overcome the computational complexity involved in seeking optimal solutions, this paper present an enhanced greedy algorithm and simulated annealing algorithm. In this paper, we apply the developed algorithm to Seoul's public bus system.

• Korean Journal of Construction Engineering and Management
• /
• v.15 no.6
• /
• pp.53-62
• /
• 2014

Recently, the number of super high-rise building projects have been increased after recovering from international financial crisis. In super high-rise building project, vertical lifting is critical to overall project productivity, due to its limited lifting equipments. Also for projects which buildings' height are higher than 400m, transfer operation in lifting is inevitable because of lifts' maximum lifting height. In transfer operation, setting a transfer floor is essential for saving lifting time of resources. In this research, using discrete event simulation modeling with AnyLogic 7.0 software and metaheuristic optimization with OptQuest software, the method of optimizing a transfer floor for workers during the morning peak time is proposed. Comparing to the result of the case which transfer floor is designated to the middle floor, setting optimized transfer floor significantly decrease the total lifting time of workers. By using proposed simulation and optimization tool, saving budget and time through increasing available working hour is expected.

• The KIPS Transactions:PartB
• /
• v.16B no.3
• /
• pp.225-232
• /
• 2009

Author name disambiguation is essential for improving performance of document indexing, retrieval, and web search. Author name disambiguation resolves the conflict when multiple authors share the same name label. This paper introduces a novel approach which exploits ontologies and WordNet-based category utility for author name disambiguation. Our method utilizes author knowledge in the form of populated ontology that uses various types of properties: titles, abstracts and co-authors of papers and authors' affiliation. Author ontology has been constructed in the artificial intelligence and semantic web areas semi-automatically using OWL API and heuristics. Author name disambiguation determines the correct author from various candidate authors in the populated author ontology. Candidate authors are evaluated using proposed WordNet-based category utility to resolve disambiguation. Category utility is a tradeoff between intra-class similarity and inter-class dissimilarity of author instances, where author instances are described in terms of attribute-value pairs. WordNet-based category utility has been proposed to exploit concept information in WordNet for semantic analysis for disambiguation. Experiments using the WordNet-based category utility increase the number of disambiguation by about 10% compared with that of category utility, and increase the overall amount of accuracy by around 98%.

• KEPCO Journal on Electric Power and Energy
• /
• v.2 no.2
• /
• pp.311-316
• /
• 2016

Network intrusion detection system based on machine learning method such as artificial neural network is quite dependent on the selected features in terms of accuracy and efficiency. Nevertheless, choosing the optimal combination of features, which guarantees accuracy and efficienty, from generally used many features to detect network intrusion requires extensive computing resources. In this paper, we deal with a optimal feature selection problem to determine 6 denial service attacks and normal usage provided by NSL-KDD data. We propose a optimal feature selection algorithm. Proposed algorithm is based on the multi-start local search algorithm, one of representative meta-heuristic algorithm for solving optimization problem. In order to evaluate the performance of our proposed algorithm, comparison with a case of all 41 features used against NSL-KDD data is conducted. In addtion, comparisons between 3 well-known machine learning methods (multi-layer perceptron., Bayes classifier, and Support vector machine) are performed to find a machine learning method which shows the best performance combined with the proposed feature selection method.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.221-226
• /
• 2004

Ant Colony System(ACS) Algorithm is new meta-heuristic for hard combinational optimization problem. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. Recently, various methods and solutions are proposed to solve optimal solution of graph coloring problem that assign to color for adjacency node($v_i, v_j$) that they has not same color. In this paper introducing ANTCOL Algorithm that is method to solve solution by Ant Colony System algorithm that is not method that it is known well as solution of existent graph coloring problem. After introducing ACS algorithm and Assignment Type Problem, show the wav how to apply ACS to solve ATP And compare graph coloring result and execution time when use existent generating functions(ANT_Random, ANT_LF, ANT_SL, ANT_DSATUR, ANT_RLF method) with ANT_XRLF method that use XRLF that apply Randomize to RLF to solve ANTCOL. Also compare graph coloring result and execution time when use method to add re-search to ANT_XRLF(ANT_XRLF_R) with existent generating functions.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.1
• /
• pp.61-73
• /
• 2021

Metaheuristic search methods have been developed to solve problems with a range of purpose functions in situations lacking information and time constraints. In this study, the Hybrid Vision Correction Algorithm (HVCA), which enhances the performance of the Vision Correction Algorithm (VCA), was developed. The HVCA has applied two methods to improve the performance of VCA. The first method changes the parameters required by the user for self-adaptive parameters. The second method, the CGS structure of the Exponential Bandwidth Harmony Search With a Centralized Global Search (EBHS-CGS), was added to the HVCA. The HVCA consists of two structures: CGS and VCA. To use the two structures, a method was applied to increase the probability of selecting the structure with the optimal value as it was performed. The optimization problem was applied to determine the performance of the HVCA, and the results were compared with Harmony Search (HS), Improved Harmony Search (IHS), and VCA. The HVCA improved the number of times to find the optimal value during 100 repetitions compared to HS, IHS, and VCA. Moreover, the HVCA reduced the Number of Function Evaluations (NFEs). Therefore, the performance of the HVCA has been improved.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.2
• /
• pp.142-156
• /
• 2024

The transition to electric vehicles is a crucial step toward achieving carbon neutrality in the transportation sector. Adequate charging infrastructure at residential locations is essential. In South Korea, the predominant form of housing is multifamily dwellings, necessitating the provision of public charging stations for numerous residents. Although the government mandates the availability of charging facilities and designated parking areas for electric vehicles, it bases the supply of charging stations solely on the number of parking spaces. Slow chargers, mainly 3.5kW charging outlets and 7kW slow chargers, are commonly used. While the former is advantageous for installation and use, its slower charging speed necessitates the coexistence of both types of chargers. This study presents an optimization model that allocates chargers capable of meeting charging demands based on daily driving distances. Furthermore, using the metaheuristic algorithm Tabu Search, this model satisfies the optimization requirements and minimizes the costs associated with charger supply and usage. To conduct a case study, data from personal travel surveys were used to estimate the driving distances, and a hypothetical charging scenario and environment were set up to determine the optimal supply of 22 units of 3.5kW charging outlets for the charging demands of 100 BEVs.