Integrated production and multiple trips vehicle routing with time windows and uncertain travel times
Integrated production and multiple trips vehicle routing with time windows and uncertain travel times
复制标题
具有时间窗和不确定行程时间的集成生产和多次行程车辆路线
DOI：
10.1016/j.cor.2018.10.011
复制
发表时间：
2019
影响因子：
4.6
通讯作者：
Wang Yanzhang
中科院分区：
文献类型：
--
作者：
Wang Dujuan;Zhu Jiaqi;Wei Xiaowen;Cheng T. C. Edwin;Yin Yunqiang;Wang Yanzhang
研究了带有时间窗和不确定行程时间的两阶段多行程集成生产车辆路径问题。第一阶段考虑调度一组工作的并行机与机器相关的准备时间，和第二阶段的重点是交付完成的工作由一个车队的相同的车辆，这可能会有所不同，在他们的准备时间。此外，旅行时间分布是不确定的。目标是最小化由延误引起的旅行成本和惩罚成本组成的总成本。我们提出了一个鲁棒性的方法，称为“弹性鲁棒性”，行程时间的变化时，历史风险数据是有限的或不存在的，并开发一个模因算法与有效的搜索策略来解决这个问题。我们进行数值研究随机生成的数据的基础上真实的经验，以评估所提出的方法的有效性和效率。计算结果表明，与当前主流的启发式算法相比，所提出的求解方法可以产生相对较好的解。
We study the integrated production and multiple trips vehicle routing problem with time windows and uncertain travel times involving two phases. The first phase considers scheduling a set of jobs on parallel machines with machine-dependent ready times, and the second phase focuses on the delivery of completed jobs by a fleet of identical vehicles, which may differ in their ready times. In addition, the travel times in distribution are uncertain. The objective is to minimize the total cost comprising the travel cost and penalty cost caused by tardiness. We present a robustness approach, known as “Elasticp-Robustness”, to deal with travel time variations when historical risk data are limited or non-existent, and develop a memetic algorithm with an effective search strategy to solve the problem. We conduct numerical studies on randomly generated data based on real experience to assess the effectiveness and efficiency of the proposed method. The computational results show that the proposed solution approach yields relatively good solutions in comparison with current mainstream heuristic algorithms.