J4 ›› 2013, Vol. 26 ›› Issue (5): 104-110.doi: 10.3976/j.issn.1002-4026.2013.05.019

• 交通运输专栏 • 上一篇    下一篇

一种带软时间窗的物流配送中心车辆路径问题的模型与算法

周略略,魏玉光   

  1. 北京交通大学交通运输学院,北京 100044
  • 收稿日期:2013-04-20 出版日期:2013-10-20 发布日期:2013-10-20
  • 作者简介:周略略(1989-), 女,硕士研究生,研究方向为运输与物流,多式联运,快捷货运。 Email:12120986@bjtu.edu.cn

Soft time window associated model and algorithm for the  vehicles routingproblem  of logistics distribution center

 ZHOU Lue-Lue, WEI Yu-Guang   

  1. School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
  • Received:2013-04-20 Online:2013-10-20 Published:2013-10-20

摘要:

       针对单配送中心带时间窗的车辆路径问题,将时间约束折算为惩罚费用,在时间、车辆体积和载重约束的条件下,建立了一种带软时间窗的物流车辆路径总费用最小数学模型。同时在遗传算法的基础上加入记忆功能和退火操作,采用带有记忆的遗传模拟退火算法求解此模型,并将优化结果进行比较。结果表明,该算法收敛速度快、搜索领域宽,能取得较高质量的最优解。

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

Abstract:

      We construct a soft time window associated mathematical model minimizing total vehicle routing cost by converting time constraint into penalty cost under the constraint of time, vehicle volume and vehicle carrying capacity in view of time window associated vehicle routing issue in a single distribution center. We employ memory dependent genetic simulated annealing algorithm (GSAA) to solve the model, which adds memory functionality and annealing operation to a genetic algorithm. We further compare optimized results. Results show that the algorithm has quick convergence rate, broad search scope and higherquality optimization solution.

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

中图分类号: 

  • U492.3

开放获取 本文遵循知识共享-署名-非商业性4.0国际许可协议(CC BY-NC 4.0),允许第三方对本刊发表的论文自由共享(即在任何媒介以任何形式复制、发行原文)、演绎(即修改、转换或以原文为基础进行创作),必须给出适当的署名,提供指向本文许可协议的链接,同时表明是否对原文作了修改,不得将本文用于商业目的。CC BY-NC 4.0许可协议详情请访问 https://creativecommons.org/licenses/by-nc/4.0