• 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 Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.622-627
• /
• 2006

TSP(Traveling Salesman Problem) is a problem finding out the shortest distance out of many courses where given cities of the number of N, one starts a certain city and turns back to a starting city, visiting every city only once. As the number of cities having visited increases, the calculation rate increases geometrically. This problem makes TSP classified in NP-Hard Problem and genetic algorithm is used representatively. To obtain a better result in TSP, various operators have been developed and studied. This paper suggests new method of population initialization and of sequential transformation, and then proves the improvement of capability by comparing them with existing methods.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1090-1098
• /
• 2014

In this paper, an improved ACDE (Adaptive Cauchy Differential Evolution) algorithm with faster convergence speed, called ACDE2, is suggested. The baseline ACDE algorithm uses a "DE/rand/1" mutation strategy to provide good population diversity, and it is appropriate for solving multimodal optimization problems. However, the convergence speed of the mutation strategy is slow, and it is therefore not suitable for solving unimodal optimization problems. The ACDE2 algorithm uses a "DE/current-to-best/1" mutation strategy in order to provide a fast convergence speed, where a control parameter initialization operator is used to avoid converging to local optimization. The operator is executed after every predefined number of generations or when every individual fails to evolve, which assigns a value with a high level of exploration property to the control parameter of each individual, providing additional population diversity. Our experimental results show that the ACDE2 algorithm performs better than some state-of-the-art DE algorithms, particularly in unimodal optimization problems.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.489-492
• /
• 2005

TSP(Traveling Salesman Problem)는 N개의 주어진 도시를 한번씩만 방문하여 다시 출발지로 돌아오는 여러 경로들 중 가장 짧은 거리를 구하는 문제로 유전자 알고리즘이 대표적으로 이용된다. NP-Hard문제로 분류되어 보다 우수한 결과를 얻기 위해 현재까지 다양한 연산자들이 개발되고 연구되어왔다. 본 논문에서는 이러한 연산자들을 적용하여 보다 나은 해를 얻기 위해 새로운 집단초기화 방법과 순차변환 방법을 제안하여 기존의 방법들과 비교를 통해 성능 향상을 입증 하였다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.6
• /
• pp.710-719
• /
• 2017

This study conducted a survey on the time serial change in the aging ratio and population structure in new towns and their housing complex of Korea and Japan, and revealed the differences in the factors that affect the aging ratio in new towns of Korea and Japan through a comparison of the housing provision of housing complex with a high aging ratio. Rapid aging is underway around the housing complexes that were developed in the beginning of Tama new town in Japan. Agingtends to increase in proportion to the opening time of the housing complex. Rental housing residents of early migration households showed rapid aging because they had generation separation early due to narrow housing. On the other hand, Bundang new town maintains a lower aging ratio and speed than Seoul and Seoul metropolitan area due to the constant influx of student population. On the other hand, aging is more likely to increase in large houses due to the depression of the real estate market.

• Journal of the Korean Geographical Society
• /
• v.49 no.5
• /
• pp.747-760
• /
• 2014

This study presents the extent of disparity of human capital across regions, its trend, and the impact of aging on it, using Korean census data of years 1985, 1995, and 2005. Main results are as follows. First, the absolute level of human capital in cities and districts have increased, but the relative positions of those regions have not changed over time. Second, the proportion of college graduated tends to increase as the size of cities increases. Third, following Berry and Glaeser(2005), the increase in the proportion of college graduated is regressed on the initial proportion and the estimates indicate that the disparity of human capital across regions has increased over time. Fourth, the proportion of aging population is shown to have a negative relationship with the proportion of college graduated. Finally, using a counter-factual scenario that there were no differences in proportions of aging population across regions, it is shown that the disparity of human capital across regions could be reduced substantially.

• Journal of the Korea Organic Resources Recycling Association
• /
• v.12 no.3
• /
• pp.112-118
• /
• 2004

Laying hens' excrement from eating food wastes was mixed with paper mill sludge, aged for 21 days and then provided to the juvenile earthworms(Eisenia fetida) for 10 weeks. Biomass of earthworm population decreased by 5.7% of initially introduced population. Very few juvenile earthworms developed into the clitellates and clitellated earthworms could not produce cocoons at all, which was supposed to be caused by inhibition effects of salts in laying hens' excrement upon the sexual development of Eisenia fetida. But there was no significant effect on the survivorship of earthworm population.

• Journal of the Korea Organic Resources Recycling Association
• /
• v.5 no.2
• /
• pp.17-28
• /
• 1997

To study the possibility of agricultural utilization of industrial wastewater sludge, the changes of the substances, such as temperature, pH, inorganic and organic matter, the form of nitrogen, fatty acid and the population number of microorganisms during composting periods were investigated. Temperature and $CO_2$ generation were the highest in the second day of composting peroids, and then were gradually fallen. And they were similar to room temperature after the sixth day of composting periods. C/N ratio was a little increased as time went by. pH value was not changed in early composting periods and then pH had been gradually decreased since it was rapidly increased. It was in the range of 8.7~8.8 in late composting periods. The contents of $P_2O_5$, $K_2O$, CaO, MgO and Fe were a little increased and that of ${SO_4}^{2-}$ was increased with 62~67% in late in comparing with early composting periods. The contents of ether extracted materials, water soluble polysaccharides, hemicellulose and cellulose were decreased but that of resins and lignin were not changed during composting periods. The contents of total and organic nitrogen were decreased but that of inorganic nitrogen was increased during composting periods. The population number of microorganism during composting periods was too much changed according to the kinds of bulking agents and microorganisms, and the composting periods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.1
• /
• pp.12-17
• /
• 2003

Optimal determination of cluster size has an effect on the result of clustering. In K-means algorithm, the difference of clustering performance is large by initial K. But the initial cluster size is determined by prior knowledge or subjectivity in most clustering process. This subjective determination may not be optimal. In this Paper, the genetic algorithm based optimal determination approach of cluster size is proposed for automatic determination of cluster size and performance upgrading of its result. The initial population based on attribution is generated for searching optimal cluster size. The fitness value is defined the inverse of dissimilarity summation. So this is converged to upgraded total performance. The mutation operation is used for local minima problem. Finally, the re-sampling of bootstrapping is used for computational time cost.

• Journal of KIISE:Software and Applications
• /
• v.32 no.5
• /
• pp.357-365
• /
• 2005

We present a B-spline fitting method based on genetic algorithm for the extraction of object contours from the complex image sequence, where objects with similar shape and intensity are adjacent each other. The proposed algorithm solves common malfitting problem of the existing B-spline fitting methods including snakes. Classical snake algorithms have not been successful in such an image sequence due to the difficulty in initialization and existence of multiple extrema. We propose a B-spline fitting method using a genetic algorithm with a new initial population generation and fitting function, that are designed to take advantage of the contour of the previous slice. The test results show that the proposed method extracts contour of individual object successfully from the complex image sequence. We validate the algorithm by false-positive/negative errors and relative amounts of agreements.