检索
E-mail
RSS
作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (14): 185-187.doi: 10.3969/j.issn.1000-3428.2007.14.065

• 人工智能及识别技术 • 上一篇    下一篇

基于混合算法的带时间窗的车辆路径问题求解

张瑞锋1,2   

  1. (1. 天津大学管理学院，天津 300072；2. 河北经贸大学财税学院，石家庄 050061)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-07-20 发布日期:2007-07-20

Solution to Vehicle Routing Problem with Time Window Based on Hybrid Genetic Algorithm

ZHANG Ruifeng1,2   

  1. (1. School of Management, Tianjin University, Tianjin 300072; 2. School of Finance and Taxation, Hebei University of Economics & Business, Shijiazhuang 050061)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-07-20 Published:2007-07-20

PDF

1043

被引次数

24

摘要： 建立了有时间窗车辆路径问题的数学模型，针对遗传算法在局部搜索能力方面的不足，提出将模拟退火算法与遗传算法相结合，从而构造了有时间窗车辆路径问题的混合遗传算法，并进行了实验计算。结果表明，用混合遗传算法求解该优化问题，可以在一定程度上克服遗传算法在局部搜索能力方面的不足和模拟退火算法在全局搜索能力方面的不足，从而得到了质量较高的解。

关键词: 车辆路径问题, 时间窗, 遗传算法, 模拟退火算法

Abstract: A universal mathematical model of vehicle routing problem with time windows is stated. On the basis of analyzing the weakness of genetic algorithm in local search, a new stochastic approach called the genetic simulated annealing algorithm is proposed to vehicle routing problem with time windows, and makes some experimental computations. The computational results demonstrate that the genetic simulated annealing algorithm can overcome the weakness of genetic algorithm and local search algorithm, so the high quality solutions to the vehicle routing problem with time windows is obtained.

Key words: vehicle routing problem, time window, genetic algorithm, simulated annealing algorithm

中图分类号: