首页 | 本学科首页   官方微博 | 高级检索  
     

�Ľ����Ŵ��㷨����ʱ�䴰���ͳ��������е�Ӧ��
引用本文:杨明,张立业. �Ľ����Ŵ��㷨����ʱ�䴰���ͳ��������е�Ӧ��[J]. 交通运输系统工程与信息, 2005, 5(4): 26-30
作者姓名:杨明  张立业
作者单位:???????? ??????????? ??? 410076
摘    要:针对有时间窗的车辆调度问题,在标准遗传算法的基础上,加入爬山算法增强算法的局部搜索能力,通过保护全局最优基因的方法提高了算法的收敛能力,并辅以自适应变异算子,构造了一种改进的混合遗传算法。实验结果表明,改进后的算法具有抗“早熟”能力强、收敛速度快和局部搜索能力强的特点。

关 键 词:???   ????????   ????????  ?????  ?????????????  
文章编号:1009-6744(2005)04-0026-05
收稿时间:2004-12-15
修稿时间:2004-12-15

The Application of Improved Genetic Algorithm in the Vehicle Scheduling Problem with Time Window
YANG Ming,ZHANG Li-ye. The Application of Improved Genetic Algorithm in the Vehicle Scheduling Problem with Time Window[J]. Journal of Transportation Systems Engineering and Information Technology, 2005, 5(4): 26-30
Authors:YANG Ming  ZHANG Li-ye
Affiliation:Traffic and Transportation College, Changsha University of Science & Technology Changsha 410076, China
Abstract:Focused on the vehicle scheduling problem with time window and based on standard genetic algorithm, a new improved genetic algorithm was set up. In the new algorithm, local search ability is enhanced by adding hill-climbing algorithm; the constringency ability is improved through global-best-gene-protection strategy; and a self--organized mutation arithmetic operator is involved. The experimentation demonstrated that the improved algorithm can constringe fast , have the strong ability of local search and can avoid prematurity in a certain sense.
Keywords:time window    vehicle schedual   complex generic algorithm   hill-climbing search   selforganized mutation arithmetic operator
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《交通运输系统工程与信息》浏览原始摘要信息
点击此处可从《交通运输系统工程与信息》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号