| 利用微正则退火算法求解车辆路径问题 |
| |
| 引用本文： | 徐俊杰. 利用微正则退火算法求解车辆路径问题[J]. 安庆师范学院学报(自然科学版), 2009, 15(2): 36-38 |
| |
| 作者姓名： | 徐俊杰 |
| |
| 作者单位： | 安庆师范学院,经济与管理学院,安徽,安庆,246133 |
| |
| 基金项目： | 安徽省高校省级自然科学研究项目 |
| |
| 摘 要： | 在建立单配送中心的车辆路径问题模型后，提出了一种基于微正则退火算法的求解方法，对一个包含20个需求节点的单配送中心实例进行了实验分析。实验数据表明，微正则退火算法能以较大概率搜索到最优路径集，与传统模拟退火算法相比，它的优势是目标函数值下降更快，能够在较短时间内搜索到满意解。
|
| 关 键 词： | 交通工程 车辆路径问题 微正则退火算法 全局优化 |
Solving Vehicle Routing Problem by Micro-canonical Annealing Algorithm |
| |
| XU Jun-jie. Solving Vehicle Routing Problem by Micro-canonical Annealing Algorithm[J]. Journal of Anqing Teachers College(Natural Science Edition), 2009, 15(2): 36-38 |
| |
| Authors: | XU Jun-jie |
| |
| Affiliation: | School of Economics and Management;Anqing Teachers College;Anqing 246133;China |
| |
| Abstract: | 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 implementation 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. |
| |
| Keywords: | traffic engineering vehicle routing problem micro-canonical annealing algorithm global optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
