[an error occurred while processing this directive]
   
 
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2009, Vol. 35 Issue (10) :1245-1248    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
�Ľ���Ⱥ�㷨���ʱ�����������·������
����ǿ, �� ��, �ܻ���*
�������պ����ѧ ������Ϣ����ѧԺ, ���� 100191
Improved ant colony algorithm for shortest path problem in time-dependent networks
Liu Yongqiang, Chang Qing, Xiong Huagang*
School of Electronics and Information Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100191, China

ժҪ
�����
�������
Download: PDF (318KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ ����һ��ʱ����������Ⱥ�㷨����Ϣ�ظ��²���,ʹ���ϲ�����Ϣ���ܹ���ȷ��ӳʱ�������б���Ȩֵ�ı仯���;�Ľ��˴�ͳ��Ⱥ�㷨�����ڽڵ�ѡ�����,ʹ����ֻ������뵱ǰ�ڵ����ֱ��·���Ľڵ��ת�Ƹ���,�����㷨�ļ�����;����Ⱥ�㷨���Ŵ��㷨���,����Ⱥ�㷨ÿ�α������γɵĽ���Ϊ��ʼȺ�ֽ��е��㽻�����,��������ֲ����Ž�,����㷨�����ٶ�.����������,�Ľ�����Ⱥ�㷨�ܹ���Ч���ʱ�����������·������,�ȴ�ͳ��Ⱥ�㷨�õ�ȫ�����Ž�ĸ��ʸ���,�㷨�������ٶȸ���.
Service
�ѱ����Ƽ�������
�����ҵ����
�������ù�����
Email Alert
RSS
�����������
����ǿ
����
�ܻ���
�ؼ����� ʱ������   ���·��   ��Ⱥ�㷨     
Abstract�� An improved pheromone update strategy suitable for time-dependent networks was proposed. Under this strategy, the residual pheromone of each road can accurately reflect the change of weighted value of each road. An improved selection strategy between adjacent cities was used to compute the cities- transfer probabilities, as a result, the calculation of algorithm was greatly reduced, and the compute speed was greatly increased. To avoid the algorithm converging to the local optimal result, the ant colony algorithm was combined with genetic algorithm. In this way, the solutions after each traversal were used as the initial species to carry out single-point crossover. An improved ant colony algorithm for the shortest path problem in time-dependent networks based on these improved strategies was presented. The results of experiment show that the improved algorithm has greater probability to get the global optimal solution, and the convergence rate of algorithm is better than traditional ant colony algorithm.
Keywords�� time-dependent networks   shortest path problem   ant colony algorithm(ACO)     
Received 2008-10-15;
Fund:

������Ȼ��ѧ����������Ŀ(60879024, 60872062)

About author: ����ǿ(1978-),��,������Ϫ��,��ʿ��,yongqiangliu@sina.com.
���ñ���:   
����ǿ, �� ��, �ܻ���.�Ľ���Ⱥ�㷨���ʱ�����������·������[J]  �������պ����ѧѧ��, 2009,V35(10): 1245-1248
Liu Yongqiang, Chang Qing, Xiong Huagang.Improved ant colony algorithm for shortest path problem in time-dependent networks[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2009,V35(10): 1245-1248
���ӱ���:  
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2009/V35/I10/1245
Copyright 2010 by �������պ����ѧѧ��