摘要
采用并行遗传算法研究了带时间窗限制的车辆路径问题。通过设计并行算法和交叉、变异等算子提高了算法的计算效率和性能。通过计算若干benchmark问题,验证了模型的有效性。
To solve vehicle routing problem with time window, parallel genetic algorithm is presented in the paper. Computing efficiency and performance of algorithm are improved by designing parallel algorithm, crossover and mutation operators. Validity of algorithm is confirmed by solving some benchmark problems.
出处
《工业工程》
2007年第3期111-114,共4页
Industrial Engineering Journal
基金
深圳物流中心基金资助项目
