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

求解带时间窗车辆路径问题的混沌遗传算法
引用本文:王永锋,杨 育,顾永明,吴彩明. 求解带时间窗车辆路径问题的混沌遗传算法[J]. 计算机应用研究, 2012, 29(7): 2422-2425
作者姓名:王永锋  杨 育  顾永明  吴彩明
作者单位:1. 重庆大学机械传动国家重点实验室,重庆,400030
2. 重庆长安铃木汽车有限公司技术中心,重庆,401321
3. 重庆邮电大学光电工程学院,重庆,400065
基金项目:国家自然科学基金资助项目(71071173); 国家教育部高校博士点科研基金资助项目(20090191110004); 重庆市科技攻关重点资助项目(2011GGC351)
摘    要:针对遗传算法随机性大、末成熟收敛等缺点,提出了将混沌搜索技术和遗传算法相耦合的混沌遗传算法来求解带时间窗的物流配送车辆路径问题(VRPTW)。该算法将混沌变量映射到优化变量的取值范围中,把得到的混沌变量进行编码生成初始种群,然后在遗传操作进行之后对优秀个体增加混沌扰动,促进种群的进化收敛速度,得到最优解。实例计算结果与其他算法比较表明,该算法在求解VRPTW问题时,搜索效率高,能以较快的速度收敛于全局最优解,为求解VRPTW问题提供了一种新方法。

关 键 词:混沌搜索技术  混沌遗传算法  带时间窗的车辆路径问题

Chaotic genetic algorithm for solving vehicle routing problems with time windows
WANG Yong-feng,YANG Yu,GU Yong-ming,WU Cai-ming. Chaotic genetic algorithm for solving vehicle routing problems with time windows[J]. Application Research of Computers, 2012, 29(7): 2422-2425
Authors:WANG Yong-feng  YANG Yu  GU Yong-ming  WU Cai-ming
Affiliation:1. State Key Laboratory of Mechanical Transmissions, Chongqing University, Chongqing 400030, China; 2. Technical Centre of Chang'an Suzuki Automobile Company Limited, Chongqing Chang'an, Chongqing 401321, China; 3. School of Optoelectronic Engineering, Chongqing University of Posts & Telecommunications, Chongqing 400065, China
Abstract:Aiming at the disadvantage of big randomness and premature convergence in genetic algorithm, the paper put forward the chaotic genetic algorithms which was a combination of chaotic search technology and genetic algorithms to solve the vehicle routing problem with time windows VRPTW during the logistics and distribution. The algorithm mapped chaotic va-riables to the range of optimization variables and coded the getting variables to generate the initial population. Then, after the genetic operations, it increased chaotic disturbance to the excellent individuals, and promoted the convergence rate of populations' evolution and get the optional solution. Compared the calculation results with other algorithms show that when the algorithm solves the VRPTW problem, the search efficiency is high and it can converge in the optional solution in a fast speed and offers a new method to the VRPTW solving.
Keywords:
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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