Methods for asymmetric traffic assignment model with variable demand

Two newly developed methods are described in this study for solution of the asymmetric traffic equilibrium problem with variable demand, i.e. the Hybrid and EHB methods. The convergence of the two methods is guaranteed under positive definite assumption for the Jacobian matrices of the cost function and negative inverse of demand function. The primary advantage of these two methods is that only moderate memory is required. Thus, larger networks than those presented in previous literature can be tested in a PC environment. To demonstrate the correctness of the two methods, a numerical example is included. An intensive study is currently underway to speed up the convergence, and provide a comparison with other available solution algorithms.