利用微正则退火算法求解车辆路径问题

Solving Vehicle Routing Problem by Micro—canonical Annealing Algorithm

在建立单配送中心的车辆路径问题模型后,提出了一种基于微正则退火算法的求解方法,对一个包含20个需求节点的单配送中心实例进行了实验分析。实验数据表明,微正则退火算法能以较大概率搜索到最优路径集,与传统模拟退火算法相比,它的优势是目标函数值下降更快,能够在较短时间内搜索到满意解。

After constructing a mathematical model for the vehicle routing problem with single distribution center, an optimized method based on micro--canonical annealing algorithm is proposed. The annealing mechanism and ixmplementation steps are introduced in detail. Simulations are carried out on an instance including twenty nodes and micro--canonical annealing algorithm obtained from optimal solution with high success rate. The result shows that the convergence speed of this introduced algorithm is faster than that of simulated annealing and it hit satisfactory solutions within less time.