| 用混合遗传算法解决有时间窗的车辆路径规划问题 |
| |
| 引用本文： | 阎庆,邰蕾蕾.用混合遗传算法解决有时间窗的车辆路径规划问题[J].安徽大学学报(自然科学版),2007,32(2):41-44. |
| |
| 作者姓名： | 阎庆 邰蕾蕾 |
| |
| 作者单位： | 安徽大学,电子科学与技术学院,安徽,合肥,230039;安徽中医学院,医药经济管理学院,安徽,合肥,230036 |
| |
| 摘 要： | 有时间窗约束的车辆路径规划问题是一种NP-hard问题,这种问题往往采用遗传算法来解决.但是传统的遗传算法本身存在的不足将严重影响整个算法的性能.本文设计了一种混合遗传算法,并进行了仿真试验.试验结果表明,用这种算法求解带有时间窗约束的车辆调度问题,可以在一定程度上克服上述问题,从而得到较高质量的解.
|
| 关 键 词： | 时间窗 遗传算法 模拟退火算法 |
| 文章编号： | 1000-2162（2007）02-0041-04 |
| 修稿时间： | 2006-07-11 |
The hybrid genetic algorithm for vehicle routing problem with time windows |
| |
| YAN Qing,TAI Lei-lei.The hybrid genetic algorithm for vehicle routing problem with time windows[J].Journal of Anhui University(Natural Sciences),2007,32(2):41-44. |
| |
| Authors: | YAN Qing TAI Lei-lei |
| |
| Institution: | 1. School of Electronic Science and Technology, Anhui University, Hefei 230039,China; 2. School of Medical Economy Management, Ahui College of Traditional Chinese Medicine, Hefei 230036, China |
| |
| Abstract: | The vehicle routing problem with time window is a kind of NP-Hard problem.We often use the genetic algorithm to solve such problem.But the traditional genetic algorithm have some weaknesses,which will affect the performance of the algorithm.This paper brings forward a kind of hybrid genetic algorithm called remembered genetic simulated annealing algorithm.We make some experimental computation,the result demonstrates this algorithm can overcome the weakness above,and the high quality solutions obtained. |
| |
| Keywords: | time window the genetic algorithm the simulated annealing algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
