Clustering Problem Using Adaptive Genetic Algorithm

Author(s):  
Qingzhan Chen ◽  
Jianghong Han ◽  
Yungang Lai ◽  
Wenxiu He ◽  
Keji Mao
2007 ◽  
Vol 16 (06) ◽  
pp. 919-934
Author(s):  
YONGGUO LIU ◽  
XIAORONG PU ◽  
YIDONG SHEN ◽  
ZHANG YI ◽  
XIAOFENG LIAO

In this article, a new genetic clustering algorithm called the Improved Hybrid Genetic Clustering Algorithm (IHGCA) is proposed to deal with the clustering problem under the criterion of minimum sum of squares clustering. In IHGCA, the improvement operation including five local iteration methods is developed to tune the individual and accelerate the convergence speed of the clustering algorithm, and the partition-absorption mutation operation is designed to reassign objects among different clusters. By experimental simulations, its superiority over some known genetic clustering methods is demonstrated.


2013 ◽  
Vol 694-697 ◽  
pp. 2895-2900 ◽  
Author(s):  
Xiao Yang ◽  
Bo Jiang

Since the beginning of the twenty-first century, energy conservation has become the theme of the development of the world. China government set the emissions-reduction targets in various industries on the 12th Five-Year Plan. And the airlines were committed to reduce their carbon emissions. From an operational perspective, the airline model assignment problem is a key factor of the total carbon emissions on the entire route network. But the traditional aircraft assignment models approach did not account for this purpose to reduce carbon emissions. By constructing the multi-objective optimization models consider carbon emissions assignment model using a genetic algorithm, numerical example shows that the model is able to meet all aspects demand which include meeting route network capacity demand, minimizing operating costs and reducing total aircraft fleet carbon emissions.


Sign in / Sign up

Export Citation Format

Share Document