We introduce a new optimization problem, the Service Network Design and Routing Problem that integrates long-haul and local transportation planning decisions. Such a problem is particularly important for consolidation carriers that face customer demands for fast delivery and thus must synchronize the different levels of their transportation operations. We present two formulations of the problem: (1) a route-based formulation that allows for the modeling of a rich set of rules governing local delivery routes at the expense of increased instance size and computational solve time, and, (2) an arc-based formulation that can be solved more quickly but has less modeling power. We solve each with a Dynamic Discretization Discovery algorithm that was recently proposed and designed for solving Service Network Design problems that require the precise modeling of time. With an extensive computational study, we examine the benefits of each formulation.

中文翻译：

---

整合长途运输和本地运输规划：服务网络设计和路由问题

我们引入了一个新的优化问题，即服务网络设计和路由问题，该问题将远程和本地运输计划决策结合在一起。对于面对客户要求快速交付并因此必须同步其运输操作的不同水平的合并运输公司，此问题尤其重要。我们提供该问题的两种表达方式：（1）基于路线的表达方式，该模型可以建模一组丰富的规则来管理本地传递路径，但以增加实例大小和计算求解时间为代价；以及（2）弧线基于公式的公式，可以更快地解决，但建模能力更差。我们使用最近提出的动态离散发现算法来解决每个问题，该算法旨在解决需要精确建模时间的服务网络设计问题。通过广泛的计算研究，我们研究了每种配方的益处。