摘要
探讨用于求解软硬时间窗共存情况下的车辆路径问题的改进遗传算法。对基本遗传算法的交叉、变异操作的交叉概率和变异概率进行改进,使之更加具有自适应性,能根据种群染色体的优劣程度自动进行调整。通过算例证明改进的算法比原算法在计算软硬时间窗共存配送路径问题上更具有效性。
This paper discussed an improved genetic algorithm for vehicle routing problem with soft and hard time windows. By improving the probabilities of crossover and mutation, they could make adjustments as the chromosomes, and the adaptability of the algorithm would be stronger. A case was given could show the improved algorithm was more efficient than the traditional genetic algorithm.
出处
《山东交通学院学报》
CAS
2013年第2期14-18,共5页
Journal of Shandong Jiaotong University
关键词
时间窗
车辆路径问题
遗传算法
time window
vehicle routing problem
genetic algorithm
