초록

용어보기논문에서 용어와 풀이말을 자동 추출한 결과로, 시범 서비스 중입니다. AI-Helper

Abstract ▼ AI-Helper

In this paper, we use a genetic algorithm to solve the weapon target assignment problem (WTA), which is one of combinatorial optimization problems. In contrast to the existing WTA with one constraint, we deal with an extended WTA with an additional constraint. To solve WTA, which is a constrained as...

In this paper, we use a genetic algorithm to solve the weapon target assignment problem (WTA), which is one of combinatorial optimization problems. In contrast to the existing WTA with one constraint, we deal with an extended WTA with an additional constraint. To solve WTA, which is a constrained assignment problem, we propose a new repair mechanism, and the repair operation the extended proceeds in the two stagesfitted onto each constraint. In addition, we compare the performance of different crossover operations for effective WTA solutions. Genetic algorithm using uniform crossover and one using block-uniform crossover are designed and applied to WTA on various instances to compare the two methods. As a results, the proposed method successfully solved the WTA problem with significant improvement over multi-start random assignment. We found that block-uniform crossover, which replicates chromosomes on block-by-block basis, is more suitable for WTA that requires two-dimensional representation.

주제어