• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.9-15
• /
• 2009

Ant Colony System is new meta heuristic for hard combinatorial optimization problem. The original ant colony system accomplishes a pheromone updating about only the global optimal path using global updating rule. But, If the global optimal path is not searched until the end condition is satisfied, only pheromone evaporation happens to no matter how a lot of iteration accomplishment. In this paper, the length of the global optimal path does not improved within the limited iterations, we evaluates this state that fall into the local optimum and selects the next node using changed parameters in the state transition rule. This method has effectiveness of the search for a path through diversifications is enhanced by decreasing the value of parameter of the state transition rules for the select of next node, and escape from the local optima is possible. Finally, the performance of Best and Average_Best of proposed algorithm outperforms original ACS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1406-1409
• /
• 2016

In this paper, we propose the heuristic signal grouping algorithm to estimate channel state value over full blind communication situation which means that there is no information about the modulation scheme and the channel state information between the transmitter and the receiver. Hereafter, using the constellation rotation method and the probability density function(pdf) the modulation scheme is determined to perform automatic modulation classification(AMC). Furthermore, the modulation type and a channel state value estimation capability is evaluated by comparing the proposed scheme with other conventional techniques from the simulation results in terms of the symbol error rate(SER) and the root mean square error (RMSE).

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.409-420
• /
• 2001

Recently a new approach to evaluation of software reliability, one of important attributes of a software system, during testing has been devised. This approach utilizes test coverage information. The coverage-based software reliability growth models recently appeared in the literature are first reviewed and classified into two classes. Inherent problems of each of the two classes are then discussed and their validity is empirically investigated. In addition, a new mean value function in coverage and a heuristic procedure for selecting the best coverage are proposed.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.11
• /
• pp.1382-1387
• /
• 1999

This paper presents an optimal fuzzy power system stabilizer to damp out low frequency oscillation. So far fuzzy controllers have been applied to power system stabilizing controllers due to its excellent properties on the nonlinear systems. But the design process of fuzzy logic power system stabilizer requires empirical and heuristic knowledge of human experts as well as many trial-and-errors in general. This paper presents and optimal design method of the fuzzy logic stabilizer using the genetic algorithm. Non-symmetric membership functions are optimally tuned over an evaluation function. The present inputs of fuzzy stabilizer are torque angle error and the change of torque angle error without loss of generality. The coding method used in this paper is concatenated binary mapping. Each linguistic fuzzy variable, defined as the peak of a membership function, is assigned by the mapping from a minimum value to a maximum value using eight bits. The tournament selection and the elitism are used to keep the worthy individuals in the next generation. The proposed system is applied to the one-machine infinite-bus model of a power system, and the results showed a promising possibility.

• Geomechanics and Engineering
• /
• v.24 no.3
• /
• pp.237-251
• /
• 2021

The main purpose of this study is to investigate the performance of the proposed hybrid teaching-learning based optimization algorithm on the optimum design of reinforced concrete (RC) cantilever retaining walls. For this purpose, three different design examples are optimized with 100 independent runs considering continuous and discrete variables. In order to determine the algorithm performance, the optimization results were compared with the outcomes of the nine powerful meta-heuristic algorithms applied to this problem, previously: the big bang-big crunch (BB-BC), the biogeography based optimization (BBO), the flower pollination (FPA), the grey wolf optimization (GWO), the harmony search (HS), the particle swarm optimization (PSO), the teaching-learning based optimization (TLBO), the jaya (JA), and Rao-3 algorithms. Moreover, Rao-1 and Rao-2 algorithms are applied to this design problem for the first time. The objective function is defined as minimizing the total material and labor costs including concrete, steel, and formwork per unit length of the cantilever retaining walls subjected to the requirements of the American Concrete Institute (ACI 318-05). Furthermore, the effects of peak ground acceleration value on minimum total cost is investigated using various stem height, surcharge loads, and backfill slope angle. Finally, the most robust results were obtained by HTLBO with 50 populations. Consequently the optimization results show that, depending on the increase in PGA value, the optimum cost of RC cantilever retaining walls increases smoothly with the stem height but increases rapidly with the surcharge loads and backfill slope angle.

• Journal of Distribution Science
• /
• v.12 no.10
• /
• pp.99-108
• /
• 2014

Purpose - The goals of this study are the following. First, this study focused on customer satisfaction of in-flight service. Specifically, in-flight duty free items were considered because of their potential value related with the differentiated strategy of airline companies. Second, this study analyzed feasible strategies that would fence off the aversive attitudes of consumers toward innovation regarding in-flight duty free items. Third, this study strived to discover implicit routes related with the reactions of of consumers to innovation. Fourth, the construal level theory was applied to the context of in-flight service. Psychological distance is expected to promote acceptance of innovation for duty free items. Research design, data, and methodology - This study consisted of three experiments. All data were collected through the participation of university students. First, the experiment employed a 2×2 between-subject design. The first independent variable was temporal distance (long vs. short of navigation time). The second independent variable was innovativeness (innovative duty free items vs. typical items). Further, experiment 2 involved a 2×2 between-subject design. The first independent variable was social distance (typical vs. atypical stewardess image). The second was innovativeness that was based on a pattern similar to that of the prior experiment. The third experiment involved a 2×2×2 design. The first and second independent variables were temporal distance and item innovation, respectively, based on the method of experiment 1. The third independent variable was cognitive depletion (depletion vs. control condition). Results - Experiment 1 demonstrated that the innovation of duty free items would need to consider the journey time of the airline. Specifically, innovative items were preferred in case of a long journey; typical items, however, were liked in a short journey. Further, experiment 2 demonstrated that, in spite of a short journey, innovative items would be preferred if an atypical stewardess was serving. An atypical stewardess was linked with social distance, and the psychological effects would activate a creative and flexible mindset that would fit with innovative duty free items. The final experiment was accomplished for the examination of cognitive processing of psychological distance on innovation-acceptance. Specifically, if the effects were related with systematic processing, then cognitive effort would be needed. In contrast, if they were related with heuristic processing, then such efforts would not be required. The same pattern appeared under both cognitive depletion and control condition; therefore, the effects of psychological distance were implied to be heuristic processing. Conclusions - Managers need to consider the navigation time, stewardess concepts, and depletion of consumers as important factors for innovative strategy regarding in-flight service. Longer journeys are more successful for innovative trials. Further, a more atypical stewardess image is more successful for atypical service. Long navigation and unfamiliar stewardesses may activate creative and flexible thinking. Further, cognitive depletion of consumers is not a dominant factor of psychological distance effects, because the effects are not related with systematic processing, but with heuristic processing.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.5
• /
• pp.540-548
• /
• 2012

The Weapon Target Allocation(WTA) problem is the NP-Complete problem. The WTA problem is that the threatful air targets are assigned by weapon of allies for killing the targets. A good solution of NP-complete problem is heuristic algorithms. Genetic algorithms are commonly used heuristic for global optimization, and it is good solution on the diverse problem domain. But there has been very little research done on the generation of their initial population. The initialization of population is one of the GA step, and it decide to initial value of individuals. In this paper, we propose to the population initialization method to improve a Genetic Algorithm. When it initializes population, the proposed algorithm reflects the characteristics of the WTA problem domain, and inherits the dominant gene. In addition, the search space widely spread in the problem space to find efficiently the good quality solution. In this paper, the proposed algorithm to verify performance examine that an analysis of various properties and the experimental results by analyzing the performance compare to other algorithms. The proposed algorithm compared to the other initialization methods and a general genetic algorithm. As a result, the proposed algorithm showed better performance in WTA problem than the other algorithms. In particular, the proposed algorithm is a good way to apply to the variety of situation WTA problem domain, because the proposed algorithm can be applied flexibly to WTA problem by the adjustment of RMI.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.161-166
• /
• 2016

This paper suggests heuristic algorithm with O(m) linear time complexity for choice of expansion projects that can't be obtain the optimal solution using linear programming until now. This algorithm ascending sort of net profit for all projects. Then, we apply a simple method that deletes the project with minimum net profit until this result satisfies the carried over for n-years more than zero value. While this algorithm using simple rule, not the linear programing fails but the proposed algorithm can be get the optimal solution for experimental data.

• The Journal of Information Systems
• /
• v.9 no.1
• /
• pp.27-44
• /
• 2000

The structure of neural networks is represented by a weighted directed graph with nodes representing units and links representing connections. Each link is assigned a numerical value representing the weight of the connection. In learning process, the values of weights are adjusted by errors. Following experiment results, the interval of adjusting weights, that is, epoch size influenced neural networks＇ performance. As epoch size is larger than a certain size, neural networks＇performance decreased drastically. And the number of hidden layer＇s node also influenced neural networks＇performance. The networks＇performance decreased as hidden layers have more nodes and then increased at some number of hidden layer＇s node. So, in implementing of neural networks the epoch size and the number of hidden layer＇s node should be decided by systematic methods, not empirical or heuristic methods.

• Journal of Korean Society of Transportation
• /
• v.14 no.1
• /
• pp.135-154
• /
• 1996

This paper presents a heuristic algorithm for classifying vehicles using a single loop detector. The data used for the development of the algorithm are the frequency variation of a vehicle sensored from the circle-shaped loop detectors which are normal buried beneath the expressway. The pre-processing of data is required for the development of the algorithm that actually consists of two parts. One is both normalization of occupancy time and that with frequency variation, the other is finding of an adaptable number of sample size for each vehicle category and calculation of average value of normalized frequencies along with occupancy time that will be stored for comparison. Then, detected values are compared with those stored data to locate the most fitted pattern. After the normalization process, we developed some frameworks for comparison schemes. The fitted scales used were 10 and 15 frames in occupancy time(X-axis) and 10 and 15 frames in frequency variation (Y-axis). A combination of X-Y 10-15 frame turned out to be the most efficient scale of normalization producing 96 percent correct classification rate for six types of vehicle.