Service network design problems are used to address a variety of services in transportation and logistics planning. In the present paper, we consider the service network design problem with design-balanced requirements. This problem is particularly relevant to operations for consolidation transportation systems and determines the transportation network configuration and the characteristics of the corresponding services. We present a solution approach that combines a capacity scaling procedure for finding an initial feasible solution and a MIP neighborhood search for improving the solutions. Computational experiments on benchmark instances show that the proposed heuristic finds high-quality solutions in a short computation time.

中文翻译：

---

具有设计平衡需求的服务网络设计问题的MIP邻域搜索启发式方法

服务网络设计问题用于解决运输和物流规划中的各种服务。在本文中，我们考虑了具有设计平衡需求的服务网络设计问题。该问题与合并运输系统的操作特别相关，并确定了运输网络的配置和相应服务的特性。我们提出了一种解决方案方法，该方法结合了用于寻找初始可行解决方案的容量缩放过程和用于改进解决方案的MIP邻域搜索。对基准实例的计算实验表明，所提出的启发式算法可在较短的计算时间内找到高质量的解决方案。