Ahn Jong Il, Jung Kyung Sook, Chung Tae Choong

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 6, pp. 1550-1556, Jun. 1997
10.3745/KIPSTE.1997.4.6.1550,   PDF Download:

Abstract

In this paper, we apply the evolutionary algorithm to the combinatorial optimization problem. Evolutionary algorithm useful for the optimization of the large space problem. This paper propose a method for the reuse of wastes of light water in atomic reactor system. These wastes contain several reusable elements, and they should be carefully selected and blended to satisfy requirements as an input material to the heavy water atomic reactor system. This problem belongs to an NP-hard like the 0/1 knapsack problem. Two evolutionary strategies are used as approximation algorithms in the highly constrained combinatorial optimization problem. One is the traditional strategy, using random operator with evaluation function, and the other is heuristic based search that uses the vector operator reducing between goal and current status. We also show the method which perform the feasible test and solution evaluation by using the vectored knowledge in problem domain. Finally, We compare the simulation results of using random operator and vector operator for such combinatorial optimization problems.

Statistics
Cite this article