Related Experiment Video
Updated: Jul 7, 2026

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
Published on: October 14, 2017
Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics
Zne-Jung Lee1, Shun-Feng Su, Chou-Yuan Lee
1Dept. of Inf. Manage., Kang-Ning Junior Coll., Taipei, Taiwan.
Abstract:
A general weapon-target assignment (WTA) problem is to find a proper assignment of weapons to targets with the objective of minimizing the expected damage of own-force asset. Genetic algorithms (GAs) are widely used for solving complicated optimization problems, such as WTA problems. In this paper, a novel GA with greedy eugenics is proposed. Eugenics is a process of improving the quality of offspring. The proposed algorithm is to enhance the performance of GAs by introducing a greedy reformation scheme so as to have locally optimal offspring. This algorithm is successfully applied to general WTA problems. From our simulations for those tested problems, the proposed algorithm has the best performance when compared to other existing search algorithms.
Related Concept Videos
Inclusive Fitness
Limits to Natural Selection
What is Genetic Engineering?
Conservative Site-specific Recombination and Phase Variation
The recognition sites for Cre recombinase called LoxP...
Pharmacogenomics: Identification of New Drug Targets
In-vitro Mutagenesis
