• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.1263-1266
• /
• 1998

In this paper, we propose an optimal feature extraction method for normally distributed multiclass data. We search the whole feature space to find a set of features that give the smallest classification error for the Gaussian ML classifier. Initially, we start with an arbitrary feature vector. Assuming that the feature vector is used for classification, we compute the classification error. Then we move the feature vector slightly and compute the classification error with this vector. Finally we update the feature vector such that the classification error decreases most rapidly. This procedure is done by taking gradient. Alternatively, the initial vector can be those found by conventional feature extraction algorithms. We propose two search methods, sequential search and global search. Experiment results show that the proposed method compares favorably with the conventional feature extraction methods.

• 전기학회논문지
• /
• 제58권7호
• /
• pp.1287-1293
• /
• 2009

This paper presents an application of Harmony Search (HM) meta-heuristic optimization algorithm for optimal operation of microgrid system. The microgrid system considered in this paper consists of a wind turbine, a diesel generator, and a fuel cell. An one day load profile which divided 20 minute data and wind resource for wind turbine generator were used for the study. In optimization, the HS algorithm is used for solving the problem of microgrid system operation which a various generation resources are available to meet the customer load demand with minimum operating cost. The application of HS algorithm to optimal operation of microgrid proves its effectiveness to determine optimally the generating resources without any differences of load mismatch and having its nature of fast convergency time as compared to other optimization method.

• 대한산업공학회지
• /
• 제26권2호
• /
• pp.155-164
• /
• 2000

Recently Fiber-optic Micro-cellular Wireless Network is considered to solve frequent handoffs and local traffic unbalance in microcellular systems. In this system, central station which is connected to several microcells by optical fiber manages the channels. We propose an efficient sectorization algorithm which dynamically clusters the microcells to minimize the blocked and handoff calls and to balance the traffic loads in each cell. The problem is formulated as an integer linear programming. The objective is to minimize the blocked and handoff calls. To solve this real time sectorization problem the Tabu Search is considered. In the tabu search intensification by Swap and Delete-then-Add (DTA) moves is implemented by short-term memory embodied by two tabu lists. Diversification is considered to investigate proper microcells to change their sectors. Computational results show that the proposed algorithm is highly effective. The solution is almost near the optimal solution and the computation time of the search is considerably reduced compared to the optimal procedure.

• 대한기계학회논문집
• /
• 제18권10호
• /
• pp.2606-2615
• /
• 1994

Sorting time is one of the most important issues for auto IC test handling systems. In actual system, because of too much path, reducing the computing time for finding a sorting path is the key way to enhancing the system performance. The exhaustive path search technique can not be used for real systems. This paper proposes heuristic sorting algorithm to find the minimal sorting time. The suggested algorithm is basically based on the best-first search technique and multi-level search technique. The results are close to the optimal solutions and computing time is greately reduced also. Therefore the proposed algorthm can be effectively used for real-time sorting process in auto IC test handling systems.

• Industrial Engineering and Management Systems
• /
• 제8권1호
• /
• pp.29-36
• /
• 2009

We present two local-search based metaheuristics for the multi-source capacitated facility location problem. In such a problem, each customer's demand can be supplied by one or more facilities. The problem is NP-hard and the number of locations in the optimal solution is unknown. To keep the search process effective, the proposed methods adopt the following features: (1) a multi-exchange neighborhood structure, (2) a tabu list that keeps track of recently visited solutions, and (3) a multi-start to enhance the diversified search paths. The transportation simplex method is applied in an efficient manner to obtain the optimal solutions to neighbors of the current solution under the algorithm framework. Two in-and-out selection rules are also proposed in the algorithms with the purpose of finding promising solutions in a short computational time. Our computational results for some of the benchmark instances, as well as some instances generated using a method in the literature, have demonstrated the effectiveness of this approach.

• 한국시뮬레이션학회논문지
• /
• 제14권3호
• /
• pp.21-31
• /
• 2005

In state-of-the-art games, characters can move in a goal-directed manner so that they can move to the goal position without colliding obstacles. Many path-finding methods have been proposed and implemented for these characters and most of them use the A* search algorithm. When .the map is represented with a regular grid of squares or a navigation mesh, it often takes a long time for the A* to search the state space because the number of cells used In the grid or the mesh increases for higher resolution. Moreover the A* search on the grid often causes a zigzag effect, which is not optimal and realistic. In this paper we propose to use visibility graphs to improve the search time by reducing the search space and to find the optimal path. We also propose a method of taking into account the size of moving characters in the phase of planning to prevent them from colliding with obstacles as they move. Simulation results show that the proposed method performs better than the grid-based A* algorithm in terms of the search time and space and that the resulting paths are more realistic.

• 한국구조물진단유지관리공학회 논문집
• /
• 제28권4호
• /
• pp.1-12
• /
• 2024

본 연구에서는 강사장교의 비선형 거동과 하모니 서치 알고리즘에 기반한 사장교 부재 단면 결정 방법을 제시하였다. 하모니 서치 알고리즘은 초기값 설정, 하모니 메모리 초기화, 새로운 하모니 메모리 구성 및 하모니 메모리 업데이트의 과정을 반복하여 최적값을 탐색함으로써 사장교 부재 단면을 결정한다. 하모니 서치 알고리즘으로 선정된 주요 부재 단면으로 3차원 강사장교의 비선형 초기형상해석을 수행하였으며, 초기장력과 형상을 고려하여 복잡한 거동특성과 각 부재의 비선형성을 반영한 사장교 주요 부재인 주탑, 보강거더, 가로보 및 케이블의 최적 단면을 결정하였다. 사장교 주요 부재의 단면 결정을 위한 목적함수로는 전체 중량을 사용하였으며, 제약조건으로 한계상태설계법을 바탕으로 하중저항능력과 사용성에 대한 제약조건식 및 보강거더와 가로보 단면의 폭과 높이의 비율을 추가적인 제약조건으로 고려하고, 주탑, 보강거더 및 가로보의 기하 및 재료 비선형성과 케이블 부재의 비선형성에 따라 부재 단면을 결정할 수 있도록 하였다. 최적 단면 결정 결과, 제안한 해석 방법은 사장교의 다양한 설치조건에 따라 최적 단면을 결정할 수 있으며, 비선형성을 고려한 사장교 부재 단면제원을 하모니 서치 기법을 통하여 결정할 수 있음을 확인하였다.

• Water Engineering Research
• /
• 제1권1호
• /
• pp.63-74
• /
• 2000

This paper presents a two- phase search scheme for optimal pipe expansion of expansion of existing water distribution systems. In pipe network problems, link flows affect the total cost of the system because the link flows are not uniquely determined for various pipe diameters. The two-phase search scheme based on stochastic optimization scheme is suggested to determine the optimal link flows which make the optimal design of existing pipe network. A sample pipe network is employed to test the proposed method. Once the best tree network is obtained, the link flows are perturbed to find a near global optimum over the whole feasible region. It should be noted that in the perturbation stage the loop flows obtained form the sample existing network are employed as the initial loop flows of the proposed method. It has been also found that the relationship of cost-hydraulic gradient for pipe expansion of existing network affects the total cost of the sample network. The results show that the proposed method can yield a lower cost design than the conventional design method and that the proposed method can be efficiently used to design the pipe expansion of existing water distribution systems.

• 한국정보통신학회논문지
• /
• 제9권2호
• /
• pp.454-461
• /
• 2005

텔레매틱스의 주요 응용분야인 차량 항법 시스템은 CIS의 지도기술과 CPS의 측위 기술에 융합되어 탄생한 것이다. 기존의 시스템들은 정점과 정점간의 최단경로를 중심으로 한 경로 탐색을 제시하였지만 교통량의 변화와 교통사고 및 수시 병목 구간 등의 교통 변화에 대해서는 능동적인 대처를 할 수 없는 시스템이다. 바꿔 말하면 현실적으로 최단경로 탐색보다는 교통 정보를 파악하며 최단시간에 목적지로 도착하는 최적경로 탐색 시스템이 필요하다. 이 논문에서는 교통 정보를 기반으로 최적경로를 탐색하는 알고리즘을 제안한다. 구체적으로 최적 경로 탐색을 위한 시스템 구조를 제안하며 기존의 최단경로 탐색 알고리즘의 문제점을 살펴보고 수집되는 교통정보의 방향성을 활용하는 최적경로 탐색 알고리즘을 새롭게 제안한다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.6-8
• /
• 2005

In this paper, we discuss model identification of nonlinear data using GAs-based Fuzzy Polynomial Neural Networks(GAs-FPNN). Fuzzy Polynomial Neural Networks(FPNN) is proposed model based Group Method Data Handling(GMDH) and Neural Networks(NNs). Each node of FPNN is expressed Fuzzy Polynomial Neuron(FPN). Network structure of nonlinear data is created using Genetic Algorithms(GAs) of optimal search method. Accordingly, GAs-FPNN have more inflexible than the existing models (in)from structure selecting. The proposed model select and identify its for optimal search of Genetic Algorithms that are no. of input variables, input variable numbers and consequence structures. The GAs-FPNN model is select tuning to input variable number, number of input variable and the last part structure through optimal search of Genetic Algorithms. It is shown that nonlinear data model design using Genetic Algorithms based FPNN is more usefulness and effectiveness than the existing models.