[an error occurred while processing this directive]
   
 
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2005, Vol. 31 Issue (08) :930-933    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
˫����ѡ���Ŵ��㷨
����, ������*
�������պ����ѧ �ѧԺ, ���� 100083
Genetic algorithm with double roulette wheels
Liu Gang, He Linshu*
School of Astronautics, Beijing University of Aeronautics and Astronautics, Beijing 100083, China

ժҪ
�����
�������
Download: PDF (329KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ ����˿���ֱ�Ӵ�����ʽԼ��������˫����ѡ���Ŵ��㷨.ΪȺ���еĿ��н�Ͳ����н�ֱ��岻ͬ����Ӧ�Ⱥ���.���н����Ӧ�Ⱥ�����ӳĿ�꺯��ֵ�Ĵ�С;�����н����Ӧ�Ⱥ�����ӳԼ������������̶�.����2�����ֱַ�ѡ����н�Ͳ����н�.����2�����ָ���ת�������Ĺ�ʽ,ʹ���н��и���ı�ѡ�л���.�������Ž����Ľ���,��Ⱥ���Զ�����������ƶ�.�����ͼ򵥡�ֱ�ӵش����˲���ʽԼ��,���������ʼ��Ⱥȫ��Ϊ�����н�.����,������һ���Ľ���ʵ����������㽻������.������͵������ڲ�ֵ��������������,����������Ӿ��и�ǿ��̽������.�������Ա���˫����ѡ���Ŵ��㷨��ȫ��Ѱ��������ǿ,�Բ���ʽԼ���Ĵ������Ч.
Service
�ѱ����Ƽ�������
�����ҵ����
�������ù�����
Email Alert
RSS
�����������
�ؼ����� �Ŵ��㷨   Լ��   ѡ��     
Abstract�� Double roulette wheels genetic algorithm was proposed to deal with the inequality constraints directly. Deferent fitness function was built for the feasible and infeasible individual in the population, respectively. The fitness function of the feasible individual reflected the objective function value; the fitness function of the infeasible individual reflected the degree of which the constraints were satisfied. Double roulette wheels was employed to select them respectively. A formula to decide the rotation times of each roulette wheel was given to make the feasible individual has greater probability to be selected than the infeasible ones. During the evolution, the individuals could move to the feasible region automatically. Then the inequality constraints were dealt with in a directive way and all infeasible initial population could be allowed. In addition, an improved real-coding copulation operator was also raised. This operator has more detecting ability than the classical two points inner interpolative operator. Examples show that the algorithm is not only an easy way to give global solution but also a simple and high effective method to deal with the inequality constraints.
Keywords�� genetic algorithm   constraints   selection     
Received 2004-04-02;
About author: �� ��(1976-),��,������,��ʿ��, lgiuang@21cn.com.
���ñ���:   
����, ������.˫����ѡ���Ŵ��㷨[J]  �������պ����ѧѧ��, 2005,V31(08): 930-933
Liu Gang, He Linshu.Genetic algorithm with double roulette wheels[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2005,V31(08): 930-933
���ӱ���:  
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2005/V31/I08/930
Copyright 2010 by �������պ����ѧѧ��