Network Aggregation in Transportation Planning Models.

摘要

This report contains six papers addressed at mathematical and computational aspects of an extraction aggregation model often employed in transportation planning studies. This model concerns the optimal flowing of an extracted subnetwork of a given network. Nonlinear decompositions are developed,duality theory is explored as a tool for measuring error,and heuristic methods are tested. An overview section summarizes prior work on network aggregation and the six papers of this report.