中文摘要：

规模条件下的协同运输集散路线优化问题（CTROLBF）研究,要求给定中枢路段上汇集的流量必须达到规定的上限,O-D流在满足绕道距离约束下如何选择直通运输、单点中转或两点中转的集散路线,使得总成本最小。CTROLBF广泛应用于航空、公路运输与邮政等领域的物流实践。构造了CTROLBF的线性规划模型和Dantzig-Wolfe分解算法。实验显示,算法表现出非常好的计算绩效。最后,将CTROLBF应用于最低流量限制下的我国中枢航线网络设计问题。

英文摘要：

This paper studies collaborative transportation route optimization with lower bound flows （CTROLBF）. CTROLBF allows all O-D （origin-destination） flows reaching the destination optionally passing through 0, 1 or 2 hulas within a limited routing distance, while the number of flows oh huh arcs are bigger than a giver number, and seeks the optimal way of transportation routing of all O-D flows to minimize the total costs. CTROLBF arises airline transportation, road transportation and postal services. We build a linear programming model and provide a heuristic algorithm based on Dantzig-Wolfe decomposition. The computational experiments show the algorithm works well. We also apply the algorithm to Chinese hub-and-spoke airline network with lower bound flows on hub airlines.