期刊文献+

ICP策略下带软时间窗的动态车辆路径优化问题研究 被引量:2

The Dynamic Vehicle Routing Optimization Problem with Soft Time Windows Based on ICP Strategy
下载PDF
导出
摘要 针对动态车辆路径中出现新的客户请求时,输入信息(可能包括客户请求出现时的车辆位置、客户时间窗、服务时间、需求量等)也随着时间推移而动态改变,在服务客户时由于动态客户需要不停插入,导致不停地进行优化计算,致使车辆路径更新频繁的问题,提出了紧急动态客户和数据包的概念(简称ICP)。通过该策略并使用遗传方法(Genetic Algorithm,GA)与局部搜索方法(Local Search,LS)的混合算法(简称GA-LS),可提高车辆路径更新质量,降低车辆运输成本并控制配送中心管理成本,从而提高服务质量。通过实验证明了该策略的有效性。 For the new customer requests that appear in the dynamic vehicle path, the input information (which may include the location of the vehicle when the customer request appears, the customer's time window, service time, demand, etc. ) changes dynamically over time. In the service of customers, due to frequently inserting of dynamic customers' demand and the vehicle path updating ,which leads to the none-stop optimal calculation. In this paper, the concept of emergency dynamic customer and data packet (ICP) is proposed. Through using this strategy and GA-LS method , the transportation cost of vehicle is reduced and the management cost of distribution center is controlled, then the quality of service is optimized. The validity of the ICP method is proved By experiments.
作者 鄢栋 陈家琪
出处 《软件导刊》 2018年第3期172-175,共4页 Software Guide
关键词 车辆路径优化 DVRPSTW 遗传算法 LS 数据包 vehicle routing optimization DVRPSTW genetic algorithm LS data package
  • 相关文献

参考文献5

二级参考文献37

  • 1肖增敏,李军.动态网络车辆路径问题:研究现状及展望[J].系统工程,2004,22(7):68-71. 被引量:14
  • 2杨瑞臣,周永付,云庆夏.寻找车辆最优路径的混合算法[J].交通运输工程学报,2005,5(1):102-105. 被引量:23
  • 3胡大伟,朱志强,胡勇.车辆路径问题的模拟退火算法[J].中国公路学报,2006,19(4):123-126. 被引量:41
  • 4BIANCHI L. Notes on dynamic vehicle routing-the state of the arteRy. Lugano: Dalle Molle Institute for Artificial Intel ligence, 2000.
  • 5DU T C, LIE Y, CHOU D. Dynamic vehicle problem for online B2C delivery[J]. The International Journal of Management Science, 2005, 33(1): 33-45.
  • 6LARSEN A. The dynamic vehicle routing problem[D]. Lynghy: Technical University of Denmark, 2001.
  • 7FABRI A, RECHT P. On dynamic pickup and delivery vehi cle routing with several time windows and waiting times[J]. Transportation Research Part B, 2006, 40(4): 335-350.
  • 8MONTEMANNI R, GAMBARDELLA L M, RIZZOLI A E, et al. Ant colony system for a dynamic vehicle routing problem[J]. Combinatorial Optimization, 2005, 10(4):327-343.
  • 9POTVIN J Y, XU Y, BENYAHIA I. Vehicle routing and scheduling with dynamic travel times[J].Computers and Operations Research, 2006, 33(4): 1129- 1137.
  • 10BRAEYSY O, GENDREAU M. Vehicle routing problem with time windows, part i: route construction and local search algorithms [J].Transportation Science, 2005, 39 ( 1 ) 104 -118.

共引文献43

同被引文献18

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部