首页> 外文会议>International Conference on Business Intelligence and Financial Engineering >Optimization of the Dynamic Vehicle Routing Problem with Increasing Scale
【24h】

Optimization of the Dynamic Vehicle Routing Problem with Increasing Scale

机译:随着规模越来越多的动态车辆路由问题优化

获取原文

摘要

The developing retail industry in China presents colony type characteristics, i.e., the amount of stores is increasing, the order per store is small but the total demand is large. This paper examines the dynamic vehicle routing problem with increasing scale (DIS-VRP) in this setting. We present a new model for this problem, which incorporates large and increasing scale and uncertainty. A three-phase heuristic algorithm is proposed to solve the model. The application of our model and algorithm in Meiyijia shows that it is effective and efficient.
机译:中国的发展零售业呈殖民地特征,即,商店的数量正在增加,每家商店的订单很小,但总需求大。本文在此设置中介绍了越来越大的秤(DIS-VRP)的动态车辆路由问题。我们为此问题提出了一个新的模型,它包含大幅增加的规模和不确定性。提出了一种三相启发式算法来解决模型。我们模型和算法在Meiyijia中的应用表明它是有效和高效的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号