• Journal of Electrical Engineering and Technology
• /
• v.4 no.3
• /
• pp.337-345
• /
• 2009

Deregulation in power industry has made the reactive power ancillary service management a critical task to power system operators from both technical and economic perspectives. Reactive power management in power systems is a complex combinatorial optimization problem involving nonlinear functions with multiple local minima and nonlinear constraints. This paper proposes a practical market-based reactive power ancillary service management scheme to tackle the challenge. In this paper a new model for voltage security and reactive power management is presented. The proposed model minimizes reactive support cost as an economic aspect and insures the voltage security as a technical constraint. For modeling validation study, two optimization algorithm, a genetic algorithm (GA) and particle swarm optimization (PSO) method are used to solve the problem of optimum allocation of reactive power in power systems under open market environment and the results are compared. As a case study, the IEEE-30 bus power system is used. Results show that the algorithm is well competent for optimal allocation of reactive power under practical constraints and price based conditions.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.3
• /
• pp.213-220
• /
• 2008

The object of this paper is to propose a method to deal with the problem of modeling user specifications in approaches based on supervisory control and Petri nets. However, most of Petri Net approaches are based on forbidden states specifications, and these specifications are suitable the use of tool such as the reachability graph. But these methods were not able to show the user specification easily and these formalisms are generally limited by the combinatorial explosion that occurs when attempting to model complex systems. Herein, we propose a new efficient method using FSSTP (Forbidden Sequences of State-Transitions Problem) and theory of region. Also, to detect and avoid the deadlock problem in control process, we use DAPN method (Deadlock Avoidance Petri nets) for solving this problem in control model.

• Water for future
• /
• v.29 no.4
• /
• pp.109-118
• /
• 1996

The neural network is a mathematical model of theorized brain activity which attempts to exploit the parallel local processing and distributed storage properties. The neural metwork is a good model to be applied for the classification problem, large combinatorial optimization and nonlinear mapping. A multi-layer neural network is constructed to predict rainfall. The network learns continuourvalued input and output data. Application of neural network to 1-hour real data in Seoul metropolitan area and the Soyang River basin shows slightly good predictions. Therefore, when good data is available, the neural network is expected to predict the complicated rainfall successfully.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.8
• /
• pp.122-129
• /
• 1997

In this paper, we propose a Hopfield model for solving the part-matching in case that is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and total path of part-connections. Therefore, this kind of problem is referred to as a combinatiorial optimization problem. First of all, we review the theoretical basis for Hopfield model and present two optimal algorithms of part-matching. The first algorithm is Traveling Salesman Problem(TSP) which improved the original and the second algorithm is Wdighted Matching Problem (WMP). Finally, we show demonstration through com- puter simulation and analyze the stability and feasibility of the generated solutions for the proposed con- nection methods. Therefore, we prove that the second algorithm is better than the first algorithm.

• Asia pacific journal of information systems
• /
• v.30 no.4
• /
• pp.719-740
• /
• 2020

The stock market changes continuously as new information emerges, affecting the judgments of investors. Online news articles are valued as a traditional window to inform investors about various information that affects the stock market. This paper proposed new ways to utilize online news articles with technical indicators. The suggested hybrid model consists of three models. First, a self-attention-based convolutional neural network (CNN) model, considered to be better in interpreting the semantics of long texts, uses news content as inputs. Second, a self-attention-based, bi-long short-term memory (bi-LSTM) neural network model for short texts utilizes news titles as inputs. Third, a bi-LSTM model, considered to be better in analyzing context information and time-series models, uses 19 technical indicators as inputs. We used news articles from the previous day and technical indicators from the past seven days to predict the share price of the next day. An experiment was performed with Korean stock market data and news articles from 33 top companies over three years. Through this experiment, our proposed model showed better performance than previous approaches, which have mainly focused on news titles. This paper demonstrated that news titles and content should be treated in different ways for superior stock price prediction.

• Korea Real Estate Review
• /
• v.28 no.1
• /
• pp.23-37
• /
• 2018

The genetic algorithm (GA) and branch and bound (B&B) methods are the useful methods of searching the optimal project combination (combinatorial optimization) to maximize the project effect considering the budget constraint and the balance of regional development with regard to the Urban Regeneration New Deal policy, the core real estate policy of the Moon Jae-in government. The Ministry of Land, Infrastructure, and Transport (MOLIT) will choose 13 central-city-area-type projects, 2 economic-base-type projects, and 10 public-company-proposal-type projects among the numerous projects from 16 local governments while each government can apply only 4 projects, respectively, for the 2017 Urban Regeneration New Deal project. If MOLIT selects only those projects with a project effect maximization purpose, there will be unselected regions, which will harm the balance of regional development. For this reason, an optimization model is proposed herein, and a combinatorial optimization method using the GA and B&B methods should be sought to satisfy the various constraints with the object function. Going forward, it is expected that both these methods will present rational decision-making criteria if the central government allocates a special-purpose-limited budget to many local governments.

• The Journal of the Korea Contents Association
• /
• v.5 no.3
• /
• pp.193-199
• /
• 2005

One of the important fields for heuristics algorithm is how to balance between Intensificationand Diversification. Ant Colony System(ACS) is a new meta heuristics algorithm to solve hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem(TSP). In this paper, we propose Multi Colony Interaction Ant Model that achieves positive negative interaction through elite strategy divided by intensification strategy and diversification strategy to improve the performance of original ACS. And, we apply multi colony interaction ant model by this proposed elite strategy to TSP and compares with original ACS method for the performance.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.471-477
• /
• 2005

This paper proposes an efficient constraint-based optimization model for the design of 3G mobile networks, such as universal mobile telecommunications system (UMTS). The model concerns about finding a set of sites for locating radio network controllers (RNCs) from a set of pre-defined candidate sites, and at the same time optimally assigning node Bs to the selected RNCs. All these choices must satisfy a set of constraints and optimize an objective function. This problem is NP-hard and consequently cannot be practically solved by exact methods for real size networks. Thus, this paper proposes a hybrid search strategy for tackling this complex and combinatorial optimization problem. The proposed hybrid search strategy is composed of three phases: A constraint satisfaction method with an embedded problem-specific goal which guides the search for a good initial solution, an optimization phase using local search algorithms, such as tabu algorithm, and a post­optimization phase to improve solutions from the second phase by using a constraint optimization procedure. Computational results show that the proposed search strategy and the model are highly efficient. Optimal solutions are always obtained for small or medium sized problems. For large sized problems, the final results are on average within $5.77\%$ to $7.48\%$ of the lower bounds.

• Journal of KIISE:Software and Applications
• /
• v.28 no.9
• /
• pp.612-628
• /
• 2001

This paper presents a methodology to extract classes and inheritance relations from procedural software. The methodology is based on the idea of generating all groups of class candidates, based on the combinatorial groups of object candidates, and their inheritance with all possible combinations and selecting a group of object candidates, and their inheritance with all possible combinations and selecting a group with the best or optimal combination of candidates with respect to the degree of relativity and similarity between class candidates in the group and classes in a domain model. The methodology has innovative features in class candidates in the group and classes in a domain model. The methodology has innovative features in class and inheritance extraction: a clustering method based on both static (attribute) and dynamic (method) clustering, the combinatorial cases of grouping class candidate cases based on abstraction, a signature similarity measurement for inheritance relations among n class candidates or m classes, two-dimensional similarity measurement for inheritance relations among n class candidates or m classes, two-dimensional similarity measurement, that is, the horizontal measurement for overall group similarity between n class candidates and m classes, and the vertical measurement for specific similarity between a set of classes in a group of class candidates and a set of classes with the same class hierarchy in a domain model, etc. This methodology provides reengineering experts with a comprehensive and integrated environment to select the best or optimal group of class candidates.

• Journal of the Korea Computer Graphics Society
• /
• v.1 no.2
• /
• pp.254-261
• /
• 1995

지금까지 솔리드의 인식이나 복원 문제는 단면이나 삼면도에서의 다면체에 관한 것들이 대부분이다. 본 연구에서는 2면도로 표현된 도면을 이용하여 3차윈 솔리드 모델로 자동 복원하는 알고리즘의 제안으로, 주어진 2면도를 해석하고 이 2면도를 만족하면서 물체의 구성 조건에 모순되지 않는 입체 모델을 생성하는 방법에 관해서 논한다. 본 논문의 특징은, 첫째 두 면도간의 정합성을 고려하는 규칙(rule)을 도입하여 후보면의 수를 줄이고, 둘째, 면의 combinatorial search과정에서 면의 결정 규칙을 도입하여 탐색 후보면을 솔리드 생성에 사용되는 면과 사용하지 않는 허물체 요소로 미리 구분하는 과정을 통해 탐색 공간의 축소와 탐색 시간의 효율화를 이루는 것이다. 실험을 통하여 이 방법에 대한 유효성과 타당성을 확인한다.