摘要
研究了一类有时间约束、车辆数量不确定的随机车辆路径问题;建立了该类问题的随机规划数学模型;设计了模型求解的遗传算法、禁忌搜索算法和遗传-禁忌混合算法。禁忌算法采用了对当前解的车辆-顾客分配结构和解的路径顺序分别禁忌的双层禁忌算法,使算法全局性更好,同时也降低了搜索时间。把禁忌算法作为变异算子应用于遗传算法形成了混合算法。最后给出了计算示例,对算法进行了比较分析。
In this paper , a class of variable fleet stochastic vehicle routing problem with time-constraint is discussed. The stochastic program model of this problem is constructed. For this model, a genetic algorithm （GA） , a tabu search heuristic（TS） and a hybrid algorithm are designed . In TS, a two-stage tabu search is used to improve search effect and decrease program run-time. Using TS as mutation operator in GA, the hybrid algorithm is proposed. In the end, an example is given. The result about these three algorithms is analysed.
出处
《工业工程》
2007年第3期115-118,127,共5页
Industrial Engineering Journal
关键词
物流
随机车辆路径问题
随机规划
遗传算法
禁忌搜索算法
logistics
stochastic vehicle routing problem （SVRP）
stochastic program
genetic algorithm
tabu search
