• Communications for Statistical Applications and Methods
• /
• v.26 no.2
• /
• pp.149-161
• /
• 2019

In this article, we suggest the following approaches to simultaneous variable selection and outlier detection. First, we determine possible candidates for outliers using properties of an intercept estimator in a difference-based regression model, and the information of outliers is reflected in the multiple regression model adding mean shift parameters. Second, we select the best model from the model including the outlier candidates as predictors using stochastic search variable selection. Finally, we evaluate our method using simulations and real data analysis to yield promising results. In addition, we need to develop our method to make robust estimates. We will also to the nonparametric regression model for simultaneous outlier detection and variable selection.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.363-365
• /
• 1991

This paper presents a method for feeder reconfiguration in order to operate distribution systems efficiently using heuristic rules. The reconfiguration method presented here not only eliminates various abnormal states but also achieves minimum power loss and optimum load balance of the distribution feeders under normal operating condition transfering loads from one feeder to anoter applying the experiences of the experts. To implement the method effectively, a best-first tree searching strategy based on heuristics is used to evaluate the various load transfer alternatives. The development of a rule-based system aimed at the reduction of the search space is presented as a means of implementing the best-first searching strategy. The results of the computer simulation of the above procedure are as follows; 1) achieving minimum power loss of the distribution feeder adopting the optimum load transfer alternative. 2) Enhencing system reliability and achieving load balance through rational allocation of the feeder loads.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.99-101
• /
• 1993

This paper presents an approach to feeder reconfiguration in order to achieve an efficient operation of distribution systems utilizing knowledge base. The optimal feeder reconfiguration in this study eliminates various abnormal states which will create feeder overloads and feeder constraint problems. and will also accomplish minimum power loss of the distribution systems under normal operating condition by means of branch exchanges to change the status of sectionalizing switches with experiences of the experts. For an effective implementation of feeder reconfiguration, a best-first tree searching strategy based on heuristics is employed to evaluate the various alternatives of load transfer. The heuristic exchange of branches results in reduction of the search space as a means of implementing the best-first searching strategy.

• Industrial Engineering and Management Systems
• /
• v.8 no.4
• /
• pp.239-246
• /
• 2009

This paper deals with the makespan minimization problem of job shops. The problem is known as one of hard problems to optimize, and therefore, many heuristic methods have been proposed by many researchers. The aim of this study is also to propose a heuristic scheduling method for the problem. However, the difference between the proposed method and many other heuristics is that the proposed method is based on depth-first branch and bound, and thus it is possible to find an optimal solution at least in principle. To accelerate the search, when a node is judged hopeless in the search tree, the proposed flexible branch and bound method can indicate a higher backtracking node. The unexplored nodes are stored and may be explored later to realize the strict optimization. Two methods are proposed to generate the backtracking point based on the critical path of the current best feasible schedule, and the minimum lower bound for the makespan in the unexplored sub-problems. Schedules are generated based on Giffler and Thompson's active schedule generation algorithm. Acceleration of the search by the flexible branch and bound is confirmed by numerical experiment.

• The Journal of the Korea Contents Association
• /
• v.14 no.11
• /
• pp.541-548
• /
• 2014

In this paper, we introduce a second version of modified binary particle swarm optimization using a concept of genotype-phenotype in genetic algorithms. Particle swarm optimization uses an information of difference between a position of the best solution and one's own position in the process of searching optimum. To obtain this difference of positions, the first version of modified binary particle swarm optimization uses a phenotype but the proposed second version uses a genotype. We can represent the solution space in large search space by using a genotype which provides continuous whole space as search space compared to a phenotype which provides only binary information. Experimental results in 10 De Jong benchmark function show that the second version outperforms the first version in six functions which has a broad search space and many local optima.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.8
• /
• pp.1004-1009
• /
• 2014

The redundancy allocation problem has usually considered only the component redundancy at the lowest-level for the enhancement of system reliability. A system can be functionally decomposed into system, module, and component levels. Modular redundancy can be more effective than component redundancy at the lowest-level because in modular systems, duplicating a module composed of several components can be easier, and requires less time and skill. We consider a multi-level redundancy allocation problem in which all cases of redundancy for system, module, and component levels are considered. A tabu search of memory-based mechanisms that balances intensification with diversification via the short-term and long-term memory is proposed for its solution. To the best of our knowledge, this is the first attempt to use a tabu search for this problem. Our tabu search algorithm is compared with the previous genetic algorithm for the problem on the new composed test problems as well as the benchmark problems from the literature. Computational results show that the proposed method outstandingly outperforms the genetic algorithm for almost all test problems.

• 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 Society of Computer and Information
• /
• v.16 no.3
• /
• pp.203-210
• /
• 2011

Ant Colony System is a new meta heuristics algorithms to solve hard combinatorial optimization problems. 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. In this paper, we propose the searching method to consider the overlapping edge of the global best path of the previous and the current. This method is that we first determine the overlapping edge of the global best path of the previous and the current will be configured likely the optimal path. And, to enhance the pheromone for the overlapping edges increases the probability that the optimal path is configured. Finally, the performance of Best and Average-Best of proposed algorithm outperforms ACS-3-opt, ACS-Subpath and ACS-Iter algorithms.

• IE interfaces
• /
• v.8 no.1
• /
• pp.23-30
• /
• 1995

Optimization in the engineering design is to select the best of many possible design alternatives in a complex design space. One major problem of local minimization algorithm is that they often result in local optima. In this paper, a hybrid method was developed by coupling the genetic algorithm and a traditional direct search method. The proposed method first finds a region for possible global optimum using the genetic algorithm and then searchs for a global optimum using the direct search method. To evaluate the performance of the hybrid method, it was applied to three test problems and a problem of designing corrugate bulkhead of a ship.

• Industrial Engineering and Management Systems
• /
• v.14 no.4
• /
• pp.413-419
• /
• 2015

This study solved the problem of unstable production chains by considering allocation rate conformance. We proposed two phased algorithm suitable for solving production planning that considers allocation rate conformance; the first phase was heuristic initial solution generation, and the second phase was tabu-search based solution improvement. By using three data sets which have different sizes of data and three different criteria, the results of proposed algorithm were compared with MIP results. The proposed algorithm showed the best production plan in terms of allocation rate conformance, and it was appropriate for other criteria; it solved the problem of unstable production chains by solving concentrated and unfair allocation.