Efficient implementation of heuristics for the continuous network design problem

In this paper, the authors 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.