| 混合智能算法在CVRPTW中的应用 |
| |
| 引用本文： | 林国玺,宣慧玉.混合智能算法在CVRPTW中的应用[J].工业工程,2006,9(1):107-111. |
| |
| 作者姓名： | 林国玺 宣慧玉 |
| |
| 作者单位： | 西安交通大学,管理学院,陕西,西安,710049 |
| |
| 摘 要： | 考虑到遗传算法本身存在易"早熟收敛"的缺陷,提出将模拟退火算法中的Metropolis接受准则引入到遗传算法的群体更新策略中,并将其应用于物流管理中的带容量约束和时间窗的车辆路径问题(CVRPTW).针对Solomon提出的几个标准问题,从数值计算上探索了遗传算法和模拟退火算法融合后的优化能力,获得了满意的效果.
|
| 关 键 词： | 车辆路径问题 容量约束 时间窗 遗传算法 模拟退火算法 |
| 文章编号： | 1007-7375（2006）01-0107-05 |
| 收稿时间： | 2004-07-08 |
| 修稿时间： | 2004年7月8日 |
Application of Hybrid Strategies to Capacitated Vehicle Routing Problem with Time Windows |
| |
| LIN Guo-xi,XUAN Hui-yu.Application of Hybrid Strategies to Capacitated Vehicle Routing Problem with Time Windows[J].Industrial Engineering Journal,2006,9(1):107-111. |
| |
| Authors: | LIN Guo-xi XUAN Hui-yu |
| |
| Abstract: | Genetic algorithm has the disadvantage of premature convergence.A hybrid algorithm is obtained by adding Metropolis principles of simulated annealing algorithm to the population replacement of genetic algorithm.The hybrid algorithm is employed to solve capacitated vehicle routing problems with time windows(CVRPTW) in logistic management.It is tested by Solomon's standard set of test instances,which demonstrates its powerful ability. |
| |
| Keywords: | vehicle routing problem capacity constraint time windows genetic algorithm simulated annealing algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
