• 대한산업공학회지
• /
• 제30권2호
• /
• pp.93-106
• /
• 2004

This paper studied a maximal covering location problem with cost restrictions, to maximize level of service within predetermined cost. It is assumed that all demand have to be met. If the demand node is located within a given range, then its demand is assumed to be covered, but if it is not, then its demand is assumed to be uncovered. An uncovered demand is received a service but at an unsatisfactory level. The objective function is to maximize the sum of covered demand, Two heuristics based on the Lagrangean relaxation of allocation and decoupling are presented and tested. Upper bounds are found through a subgradient optimization and lower bounds are by a cutting algorithm suggested in this paper. The cutting algorithm enables the Lagrangean relaxation to be proceeded continually by allowing infeasible solution temporarily when the feasible solution is not easy to find through iterations. The performances are evaluated through computational experiments. It is shown that both heuristics are able to find the optimal solution in a relatively short computational time for the most instances, and that decoupling relaxation outperformed allocation relaxation.

• Advances in Energy Research
• /
• 제4권4호
• /
• pp.255-274
• /
• 2016

This paper presents a novel symbiotic organisms search (SOS) algorithm to optimize both real power loss (RPL) and voltage stability limit (VSL) of a transmission network by controlling the variables such as unified power flow controller (UPFC) location, UPFC series injected voltage magnitude and phase angle and transformer taps simultaneously. Mathematically, this issue can be formulated as nonlinear equality and inequality constrained multi objective, multi variable optimization problem with a fitness function integrating both RPL and VSL. The symbiotic organisms search (SOS) algorithm is a nature inspired optimization method based on the biological interactions between the organisms in ecosystem. The advantage of SOS algorithm is that it requires a few control parameters compared to other meta-heuristic algorithms. The proposed SOS algorithm is applied for solving optimum control variables for both single objective and multi-objective optimization problems and tested on New England 39 bus test system. In the single objective optimization problem only RPL minimization is considered. The simulation results of the proposed algorithm have been compared with the results of the algorithms like interior point successive linear programming (IPSLP) and bacteria foraging algorithm (BFA) reported in the literature. The comparison results confirm the efficacy and superiority of the proposed method in optimizing both single and multi objective problems.

• 경영과학
• /
• 제29권3호
• /
• pp.121-134
• /
• 2012

In this study, we consider a component procurement planning problem where the procurement amounts of components are determined under assemble-to-order systems with demand uncertainty. In the problem, procurement amount of each component is decided before the demands of finished products are known and after the demands are identified the assembly amounts of the finished products are decided. In this study, the objective function of the problem is minimizing the total costs which are composed of purchase and inventory costs of the components and the backorder costs of the finished products. We assume that the uncertain demand information is given as multiple scenarios of the demands, and we propose procurement planning methods based on stochastic models which considering the multiple demand scenarios. To evaluate the performances of the proposed methods, computational experiments were carried out on the proposed methods as well as benchmarks including a method based on deterministic mathematical model and a heuristic. From the results of the computational tests, the superiorities of the proposed methods were shown.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume II
• /
• pp.574-577
• /
• 2006

In this paper, we developed a forest fire detection algorithm which uses a regression function between NDVI and land surface temperature. Previous detection algorithms use the land surface temperature as a main factor to discriminate fire pixels from non-fire pixels. These algorithms assume that the surface temperatures of non-fire pixels are intrinsically analogous and obey Gaussian normal distribution, regardless of land surface types and conditions. And the temperature thresholds for detecting fire pixels are derived from the statistical distribution of non-fire pixels’ temperature using heuristic methods. This assumption makes the temperature distribution of non-fire pixels very diverse and sometimes slightly overlapped with that of fire pixel. So, sometimes there occur omission errors in the cases of small fires. To ease such problem somewhat, we separated non-fire pixels into each land cover type by clustering algorithm and calculated the residuals between the temperature of a pixel under examination whether fire pixel or not and estimated temperature of the pixel using the linear regression between surface temperature and NDVI. As a result, this algorithm could modify the temperature threshold considering land types and conditions and showed improved detection accuracy.

• IEIE Transactions on Smart Processing and Computing
• /
• 제5권6호
• /
• pp.430-439
• /
• 2016

Estimation and analysis of traffic jams plays a vital role in an intelligent transportation system and advances safety in the transportation system as well as mobility and optimization of environmental impact. For these reasons, many researchers currently mainly focus on the brilliant machine learning-based prediction approaches for traffic prediction systems. This paper primarily addresses the analysis and comparison of prediction accuracy between two machine learning algorithms: Naïve Bayes and K-Nearest Neighbor (K-NN). Based on the fact that optimized estimation accuracy of these methods mainly depends on a large amount of recounted data and that they require much time to compute the same function heuristically for each action, we propose an approach that applies multi-threading to these heuristic methods. It is obvious that the greater the amount of historical data, the more processing time is necessary. For a real-time system, operational response time is vital, and the proposed system also focuses on the time complexity cost as well as computational complexity. It is experimentally confirmed that K-NN does much better than Naïve Bayes, not only in prediction accuracy but also in processing time. Multi-threading-based K-NN could compute four times faster than classical K-NN, whereas multi-threading-based Naïve Bayes could process only twice as fast as classical Bayes.

• 대한전기학회논문지:전력기술부문A
• /
• 제53권10호
• /
• pp.565-572
• /
• 2004

This paper proposes an expert system which can enhance the accuracy of real-time bus reconfiguration strategy by adopting local minimum tree search method and minimize the spreading effect of the fault by considering totally the operating condition when a main transformer fault occurs in the automated substation. The local minimum tree search method to expand the best-first search method. This method has an advantage which can improve the performance of solution within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. And, second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules for the obtained switching candidate set. Also, this paper studies the generalized distribution substation modelling using graph theory and a substation database is designed based on the study result. The inference engine of the expert system and the substation database is implemented in MFC function of Visual C++. Finally, the performance and effectiveness of the proposed expert system is verified by comparing the best-first search solution and local minimum tree search solution based on diversity event simulations for typical distribution substation.

• 제어로봇시스템학회논문지
• /
• 제16권8호
• /
• pp.761-765
• /
• 2010

This paper presents the design of optimal fuzzy classifier for human detection by using genetic algorithms, one of the best-known meta-heuristic search methods. For this purpose, encoding scheme to search the optimal sequential intersection points between adjacent fuzzy membership functions is originally presented for the fuzzy classifier design for HOG (Histograms of Oriented Gradient) descriptors. The intersection points are sequentially encoded in the proposed encoding scheme to reduce the redundancy of search space occurred in the combinational problem. Furthermore, the fitness function is modified with the true-positive and true-negative of the confusion matrix instead of the total success rate. Experimental results show that the two proposed approaches give superior performance in HOG datasets.

• ETRI Journal
• /
• 제39권1호
• /
• pp.30-40
• /
• 2017

In this study, we investigate topology control as a means of obtaining the best possible compromise between the conflicting requirements of reducing energy consumption and improving network connectivity. A topology design algorithm capable of producing network topologies that minimize energy consumption under a minimum-connectivity constraint is presented. To this end, we define a new topology metric, called connectivity efficiency, which is a function of both algebraic connectivity and the transmit power level. Based on this metric, links that require a high transmit power but only contribute to a small fraction of the network connectivity are chosen to be removed. A connectivity-efficiency-based topology control (CETC) algorithm then assigns a transmit power level to each node. The network topology derived by the proposed CETC heuristic algorithm is shown to attain a better tradeoff between energy consumption and network connectivity than existing algorithms. Simulation results demonstrate the efficiency of the CECT algorithm.

• 한국정보통신학회논문지
• /
• 제17권7호
• /
• pp.1715-1724
• /
• 2013

무선 센서 네트워크에서 최대 수명 데이터 수집 문제는 네트워크에 배치된 모든 노드의 데이터 전송 에너지를 최소화함으로써 네트워크의 수명을 최대화하는 문제이다. 본 논문은 무선 센서 네트워크에서 최대 수명 데이터 수집문제를 효과적으로 해결하기 위한 메타휴리스틱 기법 중 하나인 시뮬레이티드 어닐링 알고리즘을 제안한다. 제안된 알고리즘에서는 보다 효과적인 해를 찾기 위해 새로운 이웃해 생성방식과 복구함수를 적용한다. 제안된 알고리즘의 성능은 네트워크 수명과 알고리즘 실행시간 관점에서 기존의 알고리즘과 비교평가 하였으며, 실험 결과에서 제안된 알고리즘이 최대 수명 데이터 수집 문제에 효과적으로 적용됨을 보여준다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
• /
• pp.249-255
• /
• 2000

HRIV(Hybrid Rule-Interval Variation) method is presented to stabilize a class of nonlinear systems, where SMC(Sliding Mode Control) and ADC (ADaptive Control) schemes are incorporated to overcome the unstable characteristics of a conventional FLC(Fuzzy Logic Control). HRIV method consists of two modes: I-mode (Integral Sliding Mode PLC) and R-mode(RIV method). In I-mode, SMC is used to compensate for MAE(Minimum Approximation Error) caused by the heuristic characteristics of FLC. In R-mode, RIV method reduces interval lengths of rules as states converge to an equilibrium point, which makes the defined Lyapunov function candidate negative semi-definite without considering MAE, and the new uncertain parameters generated in R-mode are compensated by SMC. In RIV method, the overcontraction problem that the states are out of a rule-table can happen by the excessive reduction of rule intervals, which is solved with a dynamic modification of rule-intervals and a transition to I-mode. Especially, HRIV method has advantages to use the analytic upper bound of MAE and to reduce Its effect in the control input, compared with the previous researches. Finally, the proposed method is applied to stabilize a simple nonlinear system and a modified inverted pendulum system in simulation experiments.