The papers in this special issue on transportation network design were first presented at a workshop held at the University of Illinois in September 1977 under the auspices of the Mathematical Social Science Board with the support of the National Science Foundation. The participants in the...

Two versions of an optimal network design problem with shipments proportional to transportation costs are formulated. Extensions of an algorithm developed in prior research for solving these problems are proposed and tested. The performance of the algorithms is found to improve substantially as...

In this note, a simple network equilibrium based approach for estimating a trip matrix using link traffic count data is proposed. In essence a combined distribution and assignment model is formulated in which the link flow data serve to furnish an estimate for the sum of the integrals of the...

Three network design problems are formulated for optimizing discrete additions to link capacities. Trip distribution and assignment are functions of travel expenditure in each problem. A reformulation of Wilson's doubly-constrained trip distribution problem, in which entropy instead of total...