This paper proposes a subnetwork origin-destination (OD) matrix estimation model under travel demand constraints (SME-DC) that explicitly considers both internal-external subnetwork connections and OD demand consistency between the subnetwork and full network. This new model uses the maximum entropy of OD demands as the objective function and uses the total traffic generations (attractions) along with some fixed OD demands of the subnetwork OD nodes as the constraints. The total traffic generations and attractions along with the fixed OD demands of the subnetwork OD nodes are obtained through an OD node transformation and subnetwork topology analysis. For solving the proposed model, a convex combination method is used to convert the nonlinear SME-DC to the classical linear transportation problem, and a tabular method is used to solve the transportation problem. The Sioux Falls network and Kunshan network were provided to illustrate the essential ideas of the proposed model and the applicability of the proposed solution algorithm.

中文翻译：

---

在旅行需求约束下的子网起源-目的地矩阵估计

本文提出了一种在旅行需求约束下（SME-DC）的子网起源-目的地（OD）矩阵估计模型，该模型明确考虑了内部-外部子网连接以及子网与整个网络之间的OD需求一致性。该新模型将OD需求的最大熵用作目标函数，并将总流量生成（吸引力）以及子网OD节点的某些固定OD需求用作约束。通过OD节点转换和子网拓扑分析，可以获得总的通信量和吸引力以及子网OD节点的固定OD需求。为了解决该模型，我们采用凸组合方法将非线性SME-DC转换为经典的线性运输问题，用表格的方式解决运输问题。提供了苏福尔斯网络和昆山网络，以说明所提出模型的基本思想以及所提出解决方案算法的适用性。