Solving an integrated operational transportation planning problem with forwarding limitations
Solving an integrated operational transportation planning problem with forwarding limitations
复制标题
DOI：
10.1016/j.tre.2016.01.006
复制
发表时间：
2016-03
影响因子：
10.6
通讯作者：
Mario Ziebuhr;H. Kopfer
中科院分区：
文献类型：
--
作者：
Mario Ziebuhr;H. Kopfer
在综合运营运输规划（IOTP）问题中，传统的车辆路径问题被扩展为使用外部资源来满足运输请求。当某些请求的实现模式的选择受到限制时，IOTP变得更加复杂。在本文中，现有的列生成为基础的启发式IOTP扩展了两个策略，用于处理转发限制。计算实验表明，一个扩展版本的启发式优于所有以前的方法在文献中。此外，转发限制对不同的位置结构和私人车队的规模的影响进行了分析。
In integrated operational transportation planning (IOTP) problems, the traditional vehicle routing problem is extended by using external resources for the fulfillment of transportation requests. IOTP is getting more complex when the choice of the fulfillment mode is limited for some requests. In this paper, an existing column generation-based heuristic for IOTP is extended by two strategies for handling forwarding limitations. The computational experiments indicate that one of the extended versions of the heuristic outperforms all previous approaches in literature. Further on, the impact of forwarding limitations on different location structures and on the size of the private fleet is analyzed.