摘要
在建立带有时间窗的物流配送路径优化问题数学模型的基础上,构造了求解该问题的遗传模拟退火混合算法。该混合算法利用了遗传算法较强的全局搜索能力和模拟退火算法较好的局部搜索能力,克服了两种算法各自在寻优方面的不足,使其在全局最优搜索和计算速度方面都有了很大的提高。最后经仿真试验证实了混合算法解决物流配送路径优化问题的优越性。
The thesis constructs the mathematical model of optimizing distribution routing problem with time window, and designs the hybrid algorithm of Genetic and Simulated Annealing Algorithm. The hybrid algorithm, which overcomes the disadvantages of the two algorithms in global search, adopts the advantages of both algorithms to solve the combinatorial and optimizing problem. The hybrid ＇algorithm improves the GB search and computation speed greatly. Finally, simulated test proves the superiority of the hybrid algorithm.
出处
《物流科技》
2008年第4期26-30,共5页
Logistics Sci-Tech
关键词
物流配送
数学模型
遣传算法
模拟退火算法
时间窗
logistics distribution
mathematical model
geneticalgorithm
simulated annealing algorithm
time window
