Constrained Newton Methods for Transport Network Equilibrium Analysis

A set of constrained Newton methods were developed for static traffic assignment problems.The Newton formula uses the gradient of the objective function to determine an improved feasible direction scaled by the second-order derivatives of the objective function.The column generation produces the active paths necessary for each odgin-destlnation pair.These methods then select an optimal step size or make an orthogonal projection to achieve fast,accurate convergence.These Newton methods based on the constrained Newton formula utilize path information to explicitly implement Wardrop's principle in the transport network modelling and complement the traffic assignment algodthms.Numedcal examples are presented to compare the performance with all possible Newton methods.The computational results show that the optimal-step Newton methods have much better convergence than the fixed-step ones,while the Newton method with the unit step size is not always efficient for traffic assignment problems.Furthermore,the optimal-step Newton methods are relatively robust for all three of the tested benchmark networks of traffic assignment problems.