...
首页> 外文期刊>International Journal of Production Research >Modelling and solution of a large-scale vehicle routing problem at GE appliances & lighting
【24h】

Modelling and solution of a large-scale vehicle routing problem at GE appliances & lighting

机译:GE电器和照明部门的大规模车辆路径问题的建模和解决方案

获取原文
获取原文并翻译 | 示例
           

摘要

We consider a special case of the vehicle routing problem where not only each customer has specified delivery time window, but each route has limited time duration. We propose a solution algorithm using network reduction techniques and simulated annealing meta-heuristic. The objective is twofold: minimising the travel time and minimising the total number of vehicles required. The time-window constraint ensures delivery without delay, thus, a potentially higher level of customer satisfaction. The algorithm has helped the transportation planning team at General Electric Appliances & Lighting to significantly reduce the number of required trucks in two real cases, while its performance on randomly generated cases is also efficient when compared to properly selected benchmarking algorithms.
机译:我们考虑车辆路线问题的一种特殊情况,其中不仅每个客户都有指定的交货时间窗口,而且每个路线的持续时间都是有限的。我们提出了一种使用网络约简技术和模拟退火元启发式算法的求解算法。目标是双重的:最大限度地减少旅行时间,并减少所需的车辆总数。时间窗口约束确保交货没有延迟,因此潜在地提高了客户满意度。该算法已帮助通用电气与照明公司的运输规划团队在两种实际情况下大大减少了所需卡车的数量,而与适当选择的基准算法相比,它在随机生成的情况下的性能也很有效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号