Pickup and delivery problem with hard time windows considering stochastic and time-dependent travel times
Pickup and delivery problem with hard time windows considering stochastic and time-dependent travel times
复制标题
考虑随机和时间相关的行程时间的困难时间窗口的取货和送货问题
DOI：
10.1016/j.ejtl.2022.100099
复制
发表时间：
2023
影响因子：
2.4
通讯作者：
Ioannou, Petros
中科院分区：
文献类型：
--
作者：
Wang, Zheyu;Dessouky, Maged;Van Woensel, Tom;Ioannou, Petros
由于交通系统的不确定性，对于快递公司来说，可靠地满足客户的时间窗口并不是小事。为了保证随机和时间依赖的旅行时间下的皮卡和交付服务的可靠性，我们考虑了一个皮卡和交付问题的硬时间窗考虑随机和时间依赖的旅行时间。我们提出了一个机会约束模型，其中考虑了运营成本和服务的可靠性。为了量化服务可靠性，每个节点都与一个期望的节点服务水平相关联，并且存在一个全局服务水平，两者都通过成功概率来度量。我们提出了一种估计方法的到达时间和成功概率随机旅行和服务时间。我们提出了一个精确的解决方案的基础上的分支价格和削减框架，标签算法生成列。计算实验进行评估的解决方案框架的有效性，并使用蒙特卡罗模拟表明，所提出的方法可以生成满足节点和全球服务水平的路由。
Due to the uncertain nature of the traffic system, it is not trivial for delivery companies to reliably satisfy customers’ time windows. To guarantee the reliability of the pickup and delivery service under stochastic and time-dependent travel times, we consider a pickup and delivery problem with hard time windows considering stochastic and time-dependent travel times. We propose a chance-constrained model where the operational cost and the service’s reliability are considered. To quantify the service reliability, every node is associated with a desired node service level, and there exists a global service level, both measured by success probabilities. We present an estimation method for arrival times and success probabilities under stochastic travel and service times. We propose an exact solution approach based on a branch-price-and-cut framework, where a labeling algorithm generates columns. Computational experiments are conducted to assess the effectiveness of the solution framework, and Monte Carlo simulations are used to show that the proposed method can generate routes that satisfy both node and global service levels.
DOI：
10.1016/j.ejor.2017.07.004
发表时间：
2018-02
期刊：
Eur. J. Oper. Res.
影响因子：
--
作者：
P. Sun;Lucas P. Veelenturf;S. Dabia;T. Woensel
通讯作者：
P. Sun;Lucas P. Veelenturf;S. Dabia;T. Woensel