Aggregation effects on the network design problem

Abstract

This article examines the effects of various network extraction schemes on the network design problem. Given an original network, many criteria can be used to identify subnetworks on which the network design problem is solved. For the purposes of this article, these subnetworks are obtained using an extraction algorithm which preserves the magnitude of the user equilibrium flows on the links of these subnetworks. The results of the implementation of the network design problem on the original and the extracted subnetworks are presented and compared. We conclude that very good solutions to the network design problem can be obtained from the use of highly aggregate networks. Copyright © 1986 John Wiley & Sons Ltd