By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite co...By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite collapses within the finite region of [-1,1].Some measures in the optimization algorithm,such as adjusting the searching space of optimized variables continuously by using adaptive mutative scale method and making the most circle time as its control guideline,were taken to ensure its speediness and veracity in seeking the optimization process.The calculation examples about three testing functions reveal that AMSCGA has both high searching speed and high precision.Furthermore,the average truncated generations,the distribution entropy of truncated generations and the ratio of average inertia generations were used to evaluate the optimization efficiency of AMSCGA quantificationally.It is shown that the optimization efficiency of AMSCGA is higher than that of genetic algorithm.展开更多
To overcome the limitations of traditional force aggregation methods,this paper proposes a novel clustering model integrating the self-adaptive tent chaos search ant lion optimizer(SATC-ALO)and the self-organizing map...To overcome the limitations of traditional force aggregation methods,this paper proposes a novel clustering model integrating the self-adaptive tent chaos search ant lion optimizer(SATC-ALO)and the self-organizing map(SOM)network.The model introduces a hybrid distance calculation method to measure inter-target distances and enhances the ant lion optimization algorithm through tent chaos sequences,adaptive tent chaos search,tournament selection,and logistic chaos sequences.Aggregation accuracy is evaluated using minimum quantization error and confidence value for the SOM neural network.The model is resolved using SATC-ALO and SOM independently,with experiments demonstrating that SOM achieves fast and accurate grouping,while SATC-ALO offers higher precision but requires longer computational runtime,making it more suitable for hybrid approaches.Both methods are validated as practical solutions for force aggregation tasks.展开更多
基金Project(60874114) supported by the National Natural Science Foundation of China
文摘By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite collapses within the finite region of [-1,1].Some measures in the optimization algorithm,such as adjusting the searching space of optimized variables continuously by using adaptive mutative scale method and making the most circle time as its control guideline,were taken to ensure its speediness and veracity in seeking the optimization process.The calculation examples about three testing functions reveal that AMSCGA has both high searching speed and high precision.Furthermore,the average truncated generations,the distribution entropy of truncated generations and the ratio of average inertia generations were used to evaluate the optimization efficiency of AMSCGA quantificationally.It is shown that the optimization efficiency of AMSCGA is higher than that of genetic algorithm.
基金supported by the Youth Talent Support Program of Xi’an Association for Science and Technology(0959202513098)the National Natural Science Foundation of China(62106284)the Natural Science Foundation of Shanxi Province(2021JQ370).
文摘To overcome the limitations of traditional force aggregation methods,this paper proposes a novel clustering model integrating the self-adaptive tent chaos search ant lion optimizer(SATC-ALO)and the self-organizing map(SOM)network.The model introduces a hybrid distance calculation method to measure inter-target distances and enhances the ant lion optimization algorithm through tent chaos sequences,adaptive tent chaos search,tournament selection,and logistic chaos sequences.Aggregation accuracy is evaluated using minimum quantization error and confidence value for the SOM neural network.The model is resolved using SATC-ALO and SOM independently,with experiments demonstrating that SOM achieves fast and accurate grouping,while SATC-ALO offers higher precision but requires longer computational runtime,making it more suitable for hybrid approaches.Both methods are validated as practical solutions for force aggregation tasks.
