Application of Good?Point Set Genetic Algorithm
Chunsheng Zhao
Abstract
Chunsheng Zhao
Abstract
In this paper, on the basis of the good-point set theory, a good-point set genetic algorithm is designed. The new algorithm is applied to some typical combinatorial optimization problem. Being compared with traditional GA, the satisfied emulation results show that the good-point set GA not only improves efficiency and accuracy, but also effectively avoids the prematurity. [
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, on the basis of the good-point set theory, a good-point set genetic algorithm is designed. The new algorithm is applied to some typical combinatorial optimization problem. Being compared with traditional GA, the satisfied emulation results show that the good-point set GA not only improves efficiency and accuracy, but also effectively avoids the prematurity. [
Key concepts: Computer science, Emulation, Set (abstract data type), Point (geometry), Genetic algorithm, Algorithm, Basis (linear algebra), Mathematical optimization