In this paper, we propose an extension of the vehicle routing problem with cross-docking that takes into account resource constraints at the cross-dock. These constraints limit the number of docks that can be used simultaneously. To solve this new problem, we adapt a recently proposed matheuristic based on large neighborhood search. In particular, we focus on the feasibility tests for insertions and compare heuristics and constraint programming strategies. Finally, computational experiments on instances adapted from the vehicle routing problem with cross-docking are reported. They give insights on the impact of a limited cross-dock capacity on the routing cost.

在本文中，我们提出了一种通过交叉停靠扩展车辆路径问题的方法，该方法考虑了交叉停靠点的资源限制。这些限制限制了可以同时使用的扩展坞的数量。为了解决这个新问题，我们采用了基于大型邻域搜索的最近提出的数学方法。特别是，我们专注于插入的可行性测试，并比较启发式和约束编程策略。最后，报告了针对具有交叉停靠的车辆路径问题的实例的计算实验。他们提供了有限的跨坞容量对路由成本的影响的见解。