首页> 外文期刊>Applied Mathematical Modelling >Simultaneous product and service delivery vehicle routing problem with time windows and order release dates
【24h】

Simultaneous product and service delivery vehicle routing problem with time windows and order release dates

机译:同时产品和服务交付车辆路由问题与时间窗口和订单发布日期

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

摘要

In this paper, a new variant of the well-known vehicle routing problem with time windows (VRPTW) called as the simultaneous product and service delivery problem with order release dates is studied. The problem is motivated by the operations of a 3PL service provider who manages the last mile delivery of electrical and electronic home appliances of a large retailing company based out of China;. Apart from the usual constraints on time windows and vehicle capacities, an interesting characteristic of this problem is that the product and service delivery has to happen simultaneously with the explicit consideration of order release dates. This situation necessitates the presence of a skilled service technician at the time of product delivery itself. Being a proven NP-hard problem, we propose a mixed-integer linear programming (MILP) formulation for the problem. For solving large problem instances, an adaptive large neighborhood search (ALNS) algorithm is developed with three new customized removal operators. The proposed approaches are validated using real-life data as well as benchmark problem instances available in the literature. The computational results are quite encouraging and demonstrate the superior performance of the proposed algorithm in terms of computational time as well as the quality of the solutions generated. We also analyze the effect of length of time windows and compare simultaneous and separate modes of delivery and identify favorable conditions for choosing one mode over the other.
机译:在本文中,研究了与时间窗口(VRPTW)的众所周知的车辆路由问题的新变种称为与订单发布日期的同时产品和服务交付问题称为。问题是由3PL服务提供商的运营产生的,他们基于中国的大型零售公司的电气和电子家电的最后一次英里交付;除了关于时间窗口和车辆能力的平常约束之外,这个问题的有趣特征是,产品和服务交付必须同时发生,并明确考虑订单发布日期。这种情况需要在产品交付本身时存在熟练的服务技术人员。经过验证的NP难题,我们提出了一个混合整数线性规划(MILP)制定的问题。为了解决大问题实例,使用三种新的定制拆除操作员开发了一种自适应大邻域搜索(ALNS)算法。使用现实生活数据以及文献中可用的基准问题实例验证了所提出的方法。计算结果非常令人鼓舞,并在计算时间和解决方案的质量方面展示所提出的算法的卓越性能。我们还分析了时间长度窗口的效果,并比较了同时和单独的交付方式,并确定了在另一个模式下选择一种模式的有利条件。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号