An Improved Integer Coded Genetic Algorithm for Discrete Optimization of Structures
Ling Zhang
Abstract
Ling Zhang
Abstract
In this paper, an improved integer coded genetic algorithm is presented for discrete optimization of structures. It takes (-1,0,1) programming operator to expand the ability of local searching and presents a strategy to choose the starting point of (-1,0,1) programming operator. It also presents a restriction punish gene to discriminate the phenomenon of the same fitness for different combinations. The result of an example shows that this algorithm converges to the best solution quite quickly.
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, an improved integer coded genetic algorithm is presented for discrete optimization of structures. It takes (-1,0,1) programming operator to expand the ability of local searching and presents a strategy to choose the starting point of (-1,0,1) programming operator. It also presents a restriction punish gene to discriminate the phenomenon of the same fitness for different combinations. The result of an example shows that this algorithm converges to the best solution quite quickly.
Key concepts: Integer programming, Operator (biology), Mathematical optimization, Algorithm, Integer (computer science), Genetic algorithm, Genetic programming, Discrete optimization