, Volume 34, Issue 1, pp 163-176

Efficient implementation of heuristics for the continuous network design problem

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


In this paper, we present an efficient implementation of heuristic procedures for solving the continuous network design problem where network users behave according to Wardrop's first principle of traffic equilibrium. Numerical results involving a “standard” benchmark problem are given. Also, it is shown that the cost mapping arising in the Iterative-Optimization-Assignment algorithm is integrable if and only if the volume-delay function is of either the BPR or some logarithmic form.

Research supported by the National Sciences and Engineering Research Council of Canada (Grant A5789) and the Academic Research Program of the Department of National Defense (Grant FUHBP).